Parallel incomplete factorizations with pseudo- overlapped subdomains

摘要

We address the hard question of efficient use on parallel platforms, of incomplete factor- ization 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.