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
相关论文
共 50 条
  • [1] Incomplete Sparse Approximate Inverses for Parallel Preconditioning
    Anzt, Hartwig
    Huckle, Thomas K.
    Braeckle, Juergen
    Dongarra, Jack
    PARALLEL COMPUTING, 2018, 71 : 1 - 22
  • [2] A scalable parallel deduplication algorithm
    Santos, Walter
    Teixeira, Thiago
    Machado, Carla
    Meira, Wagner, Jr.
    Da Silva, Altigran S.
    Ferreira, Renato
    Guedes, Dorgival
    19TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 2007, : 79 - +
  • [3] Load Balancing of Parallel Block Overlapped Incomplete Cholesky Preconditioning
    Kaporin, Igor
    Konshin, Igor
    PARALLEL COMPUTING TECHNOLOGIES, PROCEEDINGS, 2009, 5698 : 304 - 315
  • [4] Norm-Coarsened Ordering for Parallel Incomplete Cholesky Preconditioning
    Booth, Joshua Dennis
    2012 SC COMPANION: HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS (SCC), 2012, : 1532 - 1533
  • [5] Scalable parallel preconditioning with the sparse approximate inverse of triangular matrices
    Van Duin, ACN
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1999, 20 (04) : 987 - 1006
  • [6] A Scalable Parallel Algorithm for Balanced Sampling
    Lee, Alexander
    Walzer-Goldfeld, Stefan
    Zablah, Shukry
    Riondato, Matteo
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 12991 - 12992
  • [7] PARALLEL HYBRID PRECONDITIONING: INCOMPLETE FACTORIZATION WITH SELECTIVE SPARSE APPROXIMATE INVERSION
    Raghavan, Padma
    Teranishi, Keita
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2010, 32 (03): : 1323 - 1345
  • [8] Parallel hybrid sparse solvers through flexible incomplete Cholesky preconditioning
    Teranishi, K
    Raghavan, P
    APPLIED PARALLEL COMPUTING: STATE OF THE ART IN SCIENTIFIC COMPUTING, 2006, 3732 : 637 - 643
  • [9] Parallel conjugate gradient preconditioning via incomplete Cholesky of overlapping submatrices
    Kaporin, IE
    Konshin, IN
    PARALLEL COMPUTATIONAL FLUID DYNAMICS: ADVANCED NUMERICAL METHODS SOFTWARE AND APPLICATIONS, 2004, : 81 - 88
  • [10] A scalable parallel algorithm for the extraction of active contours
    Wakatani, A
    INTERNATIONAL CONFERENCE ON PARALLEL COMPUTING IN ELECTRICAL ENGINEERING - PARELEC 2000, PROCEEDINGS, 2000, : 94 - 98
12345