Parallel threshold-based ILU factorization

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

Factorization algorithms based on threshold incomplete LU factorization have been found to be quite effective in preconditioning iterative system solvers. However, because these factorizations allow the fill elements to be created dynamically, they have been considered to be unsuitable for distributedmemory parallel computers. We present a highly parallel formulation of the ILUT(m, t) threshold-based incomplete factorization algorithm. ILUT employs a dual dropping strategy that is able to control the computational requirements during the factorization as well as during the application of the preconditioner. Our parallel ILUT algorithm utilizes parallel multilevel k-way partitioning and parallel independent set computation algorithms to effectively parallelize both the factorization as well as the application of the preconditioner.

Original languageEnglish (US)
Title of host publicationProceedings of the 1997 ACM/IEEE Conference on Supercomputing, SC 1997
PublisherAssociation for Computing Machinery
ISBN (Print)0897919858, 9780897919852
DOIs
StatePublished - Jan 1 1997
Event1997 ACM/IEEE Conference on Supercomputing, SC 1997 - San Jose, CA, United States
Duration: Nov 15 1997Nov 21 1997

Publication series

NameProceedings of the International Conference on Supercomputing

Other

Other1997 ACM/IEEE Conference on Supercomputing, SC 1997
Country/TerritoryUnited States
CitySan Jose, CA
Period11/15/9711/21/97

Fingerprint

Dive into the research topics of 'Parallel threshold-based ILU factorization'. Together they form a unique fingerprint.

Cite this