Views
3 years ago

MPI parallel implementation of CBF preconditioning for 3D elasticity ...

MPI parallel implementation of CBF preconditioning for 3D elasticity ...

248 I. Lirkov, S.

248 I. Lirkov, S. Margenov / Mathematics and Computers in Simulation 50 (1999) 247±254as a good preconditioner if it reduces significantly the condition number …M 1 K†, and at the sametime, if the inverse matrix vector product M 1 v can be efficiently computed for a given vector v. A thirdimportant aspect should be added to the above two, namely, the requirement for efficientimplementation of the PCG algorithm on recent parallel computer systems.A new high performance and parallel efficient PCG algorithm for 3D linear elasticity problems,implementing displacement decomposition circulant block factorization (DD CBF), is proposed andstudied in this paper. The message passing interface (MPI) [9,10] standard is used to develop a portableparallel code. The paper is organized as follows. Section 2 is devoted to a brief description of theelasticity equations as well as of the benchmark problem under consideration. In Section 3, we focus onthe construction of the DD CBF preconditioner. The parallel complexity of the algorithm is analyzed inthe Section 4. Parallel numerical tests on SGI Origin 2000, SUN SPARCstation 10 and SUN Enterprise3000 can be found in Section 5. Concluding remarks and some outlook about the parallel performanceof the developed MPI FEM code are given in Section 6.2. Elasticity equations and the benchmark problemLet B be an elastic body occupying a bounded polyhedral domain R 3 , impose Dirichlet/Neumannboundary conditions on D [ N @. We denote the displacement vector by u ˆ‰u 1 ; u 2 ; u 3 Š T , thestress tensor by …u† ˆ‰ ij …u†Š and the strain tensor by …u† ˆ‰ ij …u†Š. Without any restrictions wecould assume that the Dirichlet boundary conditions are homogeneous. n Then the following o variationalformulation of the problem holds: find u 2…H0 1…††3 …H0 1…† ˆ v 2 H1 …† : v jD ˆ 0 is the standardSobolev space), such that:a …u; v† ˆF…v†; 8v 2…H 1 0 …††3 ;whereZa …u; v† " # div u div v ‡ X3 ij …u† ij …v† dx:i;jˆ1The Lame coefficients and depend on the Young's modulus E and on the Poisson ratio . Thebilinear form a (u,v) is symmetric and coercive. Then the related discrete variational problem is: findu h 2 V h …† …H 1 0 …††3 , such that:a …u h ; v h †ˆF…v h †;8v h 2 V h …†:In this study V h () is the FEM space of piecewise trilinear functions. The latter problem is equivalentto the linear system:Kx ˆ f; (1)where x ˆ‰x i Š T is the vector of the nodal unknowns x i ; i ˆ 1; 2; ...; N. The PCG method is used tosolve Eq. (1).In what follows, we restrict our considerations to the case ˆ‰0; x max1 Š‰0; x max2 Š‰0; x max3 Š, wherethe boundary conditions on each of the sides of are of a fixed type. The benchmark problem from [4]

I. Lirkov, S. Margenov / Mathematics and Computers in Simulation 50 (1999) 247±254 249Fig. 1. Benchmark problem.is used in the reported numerical tests. This benchmark represents the model of a single pile in ahomogeneous sandy clay soil layer (see Fig. 1). An uniform grid is used with n 1 , n 2 and n 3 grid pointsalong the coordinate directions. Then the stiffness matrix K can be written in a 33 block form wherethe blocks K ij are sparse block-tridiagonal matrices of a size n 1 n 2 n 3 ˆ N=3.3. DD CBF preconditioningFirst, let us recall that a mm circulant matrix C has the form …C k;j †ˆ…c …jk†mod m †. Each circulantmatrix can be factorized aspC ˆ FF , where is a diagonal matrix of the eigenvalues of C, and F isthe Fourier matrix F ˆ…1= m †fe 2…jk=m†i g 0j;km1 . Here i stands for the imaginary unit.3.1. A displacement decomposition-based preconditionerThere are a lot of works dealing with preconditioning iterative solution methods for the FEMelasticity systems. Axelsson and Gustafson [2] constructed their preconditioners based on the point-ILU factorization of the displacement decoupled block-diagonal part of the original matrix. Thisapproach is known as displacement decomposition (see, e.g., [3]).

Parallelism in Cosmological Simulations Physics, Algorithms ...
A Parallel Preconditioned Conjugate Gradient Solver for the Poisson ...
A Parallel Additive Schwarz Preconditioned Jacobi-Davidson ...
On Implementing Several Krylov Preconditioned Iterative Schemes ...
Domain Decomposition Preconditioning for Parallel PDE Software
Preconditioning for the mixed formulation of linear plane elasticity
Implementing and testing MPI+OpenMP hybrid parallelism ... - EPCC
Parallel DD-MIC(0) Preconditioning of Rotated Trilinear FEM ...
Implementation of a Scalable Preconditioned Eigenvalue ... - MGNet
Approximate Generalized Inverse Preconditioning Methods for Least ...
A Parallel Implementation of Gauss Methods for ODEs
Greville's Method for Preconditioning Least Squares ... - Projects
Parallel Rayleigh Quotient Optimization with FSAI Preconditioning.
a parallel multigrid preconditioned conjugate gradient algorithm for ...
X10 implementation of Parallel Option Pricing with BSDE Method
Preconditioning and Globalizing Conjugate Gradients in ... - cerfacs
Parallel Implementation of 3D Seismic Imaging via Objective ...
3D BEM for general anisotropic elasticity
Parallel Implementation of a Recursive Blocked Algorithm for ...
Parallel implementation of a multiblock method with ... - CiteSeerX
Algorithms for a Parallel Implementation of Hidden ... - HiCOMB
Implementation of Parallel Numerical Algorithms Using ...
Multigrid Preconditioned Solvers for Some Elasto-plastic Problems
Parallel Implementation of Finite Volume Schemes for
Comparative Analysis of High Performance Solvers for 3D Elasticity ...
An Implementation of the MRRR Algorithm on a Data-Parallel ...
Scaling Performance of a Parallel Implementation of a ... - KTH
Efficient Parallel Implementation of Molecular Dynamics with ...