Efficient parallel computation of ILU(k) preconditioners
David Hysom, Alex Pothen · 1999
We report the development of a parallel algorithm for computing ILU preconditioners. The algorithm attains a high degree of parallelism through employmentofatwo-level ordering strategy, coupled with a subdomain graph constraint that regulates the location of nonzeros in the Schur complement. Experimental results include timings on four parallel platforms, for problems with up to 20 million unknowns running on up to 216 processors. The results support our theoretic analysis that the algorithm is highly scalable, for both preconditioner computation #factorization# and application #triangular solve# stages.