𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Block and full matrix ILU preconditioners for parallel finite element solvers

✍ Scribed by S.Ø. Wille; Ø. Staff; A.F.D. Loula

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
460 KB
Volume
191
Category
Article
ISSN
0045-7825

No coin nor oath required. For personal study only.

✦ Synopsis

Parallel ®nite element solvers based on ILU preconditionings are developed, implemented and tested in two-and three-dimensional Laplace problems. The computational domain is decomposed into N subdomains for parallel processing. The structure of the parallel computer system consists of the main processor and N satellite processors. Two algorithms are developed: a block ILU preconditioner at the subdomain level, without communication between the satellite processors, and a full matrix ILU preconditioner coupling the subdomain degrees of freedom and requiring communication between the satellite processors. Different node orderings, mesh sizes and number of satellite processors are tested. The ef®ciency of both block and full matrix ILU preconditioners is strongly dependent on the node ordering inside each subdomain. The ®nite elements in each subdomain must be connected.

📜 SIMILAR VOLUMES

Block-diagonal and indefinite symmetric
Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
✍ I. Perugia; V. Simoncini 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 1 views

We are interested in the numerical solution of large structured indefinite symmetric linear systems arising in mixed finite element approximations of the magnetostatic problem; in particular, we analyse definite block-diagonal and indefinite symmetric preconditioners. Relating the algebraic characte

Parallel multilevel preconditioners for
Parallel multilevel preconditioners for thin smooth shell finite element analysis
✍ Michael Thess 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 604 KB

In recent years multilevel preconditioners like BPX have become more and more popular for solving secondorder elliptic finite element discretizations by iterative methods. P. Oswald has adapted these methods for discretizations of the fourth order biharmonic problem by rectangular conforming Bogner-

Parallel multigrid solvers for 3D-unstru
Parallel multigrid solvers for 3D-unstructured large deformation elasticity and plasticity finite element problems
✍ Mark Adams; R.L Taylor 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 892 KB

Multigrid is a popular solution method for the set of linear algebraic equations that arise from PDEs discretized with the "nite element method. We discuss a method, that uses many of the same techniques as the "nite element method itself, to apply standard multigrid algorithms to unstructured "nite

Parallel multigrid solvers for 3D unstru
Parallel multigrid solvers for 3D unstructured finite element problems in large deformation elasticity and plasticity
✍ Mark F. Adams 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 769 KB

Multigrid is a popular solution method for the set of linear algebraic equations that arise from PDEs discretized with the ÿnite element method. The application of multigrid to unstructured grid problems, however, is not well developed. We discuss a method, that uses many of the same techniques as t