Abstract
Parallel finite element solvers based on ILU preconditionings are
developed, implemented and tested in two and three dimensions Laplace
problem. The computational domain is decomposed into N subdomains for
parallel processing. The structure of the parallel computer system
consists of N satellite processors running a distributed iterative
equation solver.
Two algorithms are developed: a block ILU preconditioner at 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 ordering, mesh sizes and number of satellite processors
are tested.
The efficiency of both block and full matrix ILU preconditioners is
strongly dependent of the node ordering inside each subdomain. The
finite elements in each subdomain must be connected.