KIT | KIT-Bibliothek | Impressum | Datenschutz

ParILUT---A New Parallel Threshold ILU Factorization

Anzt, Hartwig; Chow, Edmond; Dongarra, Jack

Abstract (englisch):
We propose a parallel algorithm for computing a threshold incomplete LU (ILU) factorization. The main idea is to interleave a parallel fixed-point iteration that approximates an
incomplete factorization for a given sparsity pattern with a procedure that adjusts the pattern. We describe and test a strategy for identifying nonzeros to be added and nonzeros to be removed from the sparsity pattern. The resulting pattern may be different and more effective than that of existing threshold ILU algorithms. Also in contrast to other parallel threshold ILU algorithms, much of the new algorithm has fine-grained parallelism.


Zugehörige Institution(en) am KIT Steinbuch Centre for Computing (SCC)
Publikationstyp Zeitschriftenaufsatz
Jahr 2018
Sprache Englisch
Identifikator ISSN: 1064-8275, 1095-7197
KITopen ID: 1000084715
Erschienen in SIAM journal on scientific computing
Band 40
Heft 4
Seiten C503–C519
Projektinformation FiNE (HGF, HGF IVF, VH-NG-1241)
Vorab online veröffentlicht am 12.07.2018
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft KITopen Landing Page