A scalable parallel algorithm for incomplete factor preconditioning

被引：83

作者：

Hysom, D ^{[1
]}

Pothen, A

机构：

[1] Old Dominion Univ, Norfolk, VA 23529 USA

[2] NASA, ICASE, Langley Res Ctr, Hampton, VA 23681 USA

来源：

SIAM JOURNAL ON SCIENTIFIC COMPUTING | 2001年 / 22卷 / 06期

关键词：

incomplete factorization; ILU; preconditioning; parallel preconditioning;

D O I：

10.1137/S1064827500376193

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We describe a parallel algorithm for computing incomplete factor (ILU) preconditioners. The algorithm attains a high degree of parallelism through graph partitioning and a two-level ordering strategy. Both the subdomains and the nodes within each subdomain are ordered to preserve concurrency. We show through an algorithmic analysis and through computational results that this algorithm is scalable. Experimental results include timings on three parallel platforms for problems with up to 20 million unknowns running on up to 216 processors. The resulting preconditioned Krylov solvers have the desirable property that the number of iterations required for convergence is insensitive to the number of processors.

引用

页码：2194 / 2215

页数：22

共 37 条

[1]

Axelsson O., 1994, ITERATIVE SOLUTION M

[2]

BALAY S, 1999, PETSC HOME PAGE

[3] PARALLELIZATION OF ROBUST MULTIGRID METHODS - ILU FACTORIZATION AND FREQUENCY DECOMPOSITION METHOD [J].