Parallel and Distributed Processing Symposium, International (2001)
San Francisco, California, USA
Apr. 23, 2001 to Apr. 27, 2001
We present a parallel algebraic preconditioner for the Schur complement system. This preconditioner aims to be a robust black box solver for commercial Finite Element packages. The preconditioner is based in a strongly dropped factorization of the Aii matrices. Two levels of parllelism are exploited using PVM and openMP. The preconditioner is tested with an scalar convection-diffusion equation, and a set of industrial test cases arising from the finite element package PERMAS and the Davis collection. The experimental results shown the robustness of it preconditioner, and it has a high scalability. We obtain quasi-linear spped-up until 32 processors.
G. Larrazabal and J. M. Cela, "A Parallel Algebraic Preconditioner for the Schur Complement System," Parallel and Distributed Processing Symposium, International(IPDPS), San Francisco, California, USA, 2001, pp. 30119a.