On parallel solution of linear elasticity problems: Part I: theory

✍ Scribed by Ivar Gustafsson; Gunhild Lindskog

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 111 KB
• Volume: 5
• Category: Article
• ISSN: 1070-5325
• DOI: 10.1002/(sici)1099-1506(199803/04)5:2<123::aid-nla130>3.0.co;2-d

✦ Synopsis

The discretized linear elasticity problem is solved by the preconditioned conjugate gradient (pcg) method. Mainly we consider the linear isotropic case but we also comment on the more general linear orthotropic problem. The preconditioner is based on the separate displacement component (sdc) part of the equations of elasticity. The preconditioning system consists of two or three subsystems (in two or three dimensions) also called inner systems, each of which is solved by the incomplete factorization pcg-method, i.e., we perform inner iterations. A finite element discretization and node numbering giving a high degree of partial parallelism with equal processor load for the solution of these systems by the MIC(0) pcg method is presented. In general, the incomplete factorization requires an M-matrix. This property is studied for the elasticity problem. The rate of convergence of the pcg-method is analysed for different preconditionings based on the sdc-part of the elasticity equations. In the following two parts of this trilogy we will focus more on parallelism and implementation aspects.