Parallel incomplete factorizations with pseudo-overlapped subdomains
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.
incomplete factorizations large sparse linear systems preconditioned conjugate gradient multiprocessor computers domain decomposition