Parallel simulations of 3d DC borehole resistivity measurements with goaloriented self-adaptive hp finite element method
Access Status
Authors
Date
2012Type
Metadata
Show full item recordCitation
Source Title
ISSN
School
Collection
Abstract
In this paper we present a parallel algorithm of the goal-oriented self-adaptive hp Finite Element Method (hp-FEM) with shared data structures and with parallel multi-frontal direct solver. The algorithm generates in a fully automatic mode (without any user interaction) a sequence of meshes delivering exponential convergence of the prescribed quantity of interest with respect to the mesh size (number of degrees of freedom). The sequence of meshes is generated from the prescribed initial mesh, by performing h (breaking elements into smaller elements), p (adjusting polynomial orders of approximation) or hp (both) refinements on selected finite elements. The new parallel implementation utilizes a computational mesh shared between multiple processors. We describe the parallel self-adaptive hp-FEM algorithm with shared computational domain, as well as its efficiency measurements. The presentation is enriched by numerical simulation of the problem of through casing 3D DC borehole resistivity measurement simulations in presence of invasion.
Related items
Showing items related by title, author, creator and subject.
-
Calo, Victor; Pardo, D.; Paszynski, M. (2011)In this paper we present a goal-oriented self-adaptive hp Finite Element Method (hp-FEM) with shared data structures and a parallel multi-frontal direct solver. The algorithm automatically generates (without any user ...
-
Campbell, Stuart M. (1999)Parallel computing has long been an area of research interest because exploiting parallelism in difficult problems has promised to deliver orders of magnitude speedups. Processors are now both powerful and cheap, so that ...
-
Paszynska, A.; Paszynski, M.; Jopek, K.; Wofniak, M.; Goik, D.; Gurgul, P.; Aboueisha, H.; Moshkov, M.; Calo, Victor; Lenharth, A.; Nguyen, D.; Pingali, K. (2015)We construct quasi-optimal elimination trees for 2D finite element meshes with singularities.These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination ...