par Magolu, Monga Made ;Van Der Vorst, Henk H.A.
Référence Parallel computing, 27, 8, page (989-1008)
Publication Publié, 2001-07
Article révisé par les pairs
Résumé : We address the hard question of efficient use on parallel platforms, of incomplete factorization preconditioning techniques for solving large and sparse linear systems by Krylov subspace methods. A novel parallelization strategy based on pseudo-overlapped subdomains is explored. This results in efficient parallelizable preconditioners. Numerical results give evidence that high performance can be achieved. © 2001 Elsevier Science B.V.

Documents en relation

DI-fusion