Abstract
We present a class of parallel preconditioning strategies built on a multilevel block incomplete LU (ILU)factorization technique to solve large sparse linear systems on distributed memory parallel computers. The preconditioners are constructed by using the concept of block independent sets. Two algorithms for constructing block independent sets of a distributed sparse matrix are proposed. We compare a few implementations of the parallel multilevel ILU preconditioners with different block independent set algorithms and different coarse level solution strategies. We also use some diagonal thresholding and perturbation strategies to enhance factorization stability. Numerical experiments indicate that our parallel multilevel block ILU preconditioners are robust and efficient.
Original language | English |
---|---|
Title of host publication | Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 |
ISBN (Electronic) | 0769519261, 9780769519265 |
DOIs | |
State | Published - 2003 |
Event | International Parallel and Distributed Processing Symposium, IPDPS 2003 - Nice, France Duration: Apr 22 2003 → Apr 26 2003 |
Publication series
Name | Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 |
---|
Conference
Conference | International Parallel and Distributed Processing Symposium, IPDPS 2003 |
---|---|
Country/Territory | France |
City | Nice |
Period | 4/22/03 → 4/26/03 |
Bibliographical note
Publisher Copyright:© 2003 IEEE.
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Theoretical Computer Science
- Software