Multilevel Preconditioners Constructed From Inverse-Based ILUs
Authors:
- Matthias BollhöferMBMatthias Bollhöfer
- Yousef SaadYSYousef Saad
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 27 (5) , 1627-1650
Abstract
This paper analyzes dropping strategies in a multilevel incomplete LU decomposition context and presents a few strategies for obtaining related ILUs with enhanced robustness. The analysis shows that the incomplete LU factorization resulting from dropping small entries in Gaussian elimination produces a good preconditioner when the inverses of these factors have norms that are not too large. As a consequence a few strategies are developed whose goal is to achieve this feature. A number of "templates" for enabling implementations of these factorizations are presented. Numerical experiments show that the resulting ILUs offer a good compromise between robustness and efficiency.Keywords
This publication has 16 references indexed in Scilit:
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal methodACM Transactions on Mathematical Software, 2004
- A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular FactorsSIAM Journal on Scientific Computing, 2003
- Crout Versions of ILU for General Sparse MatricesSIAM Journal on Scientific Computing, 2003
- Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse MatricesSIAM Journal on Matrix Analysis and Applications, 2002
- On the Relations between ILUs and Factored Approximate InversesSIAM Journal on Matrix Analysis and Applications, 2002
- Preconditioning Highly Indefinite and Nonsymmetric MatricesSIAM Journal on Scientific Computing, 2000
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse MatricesSIAM Journal on Matrix Analysis and Applications, 1999
- Node Selection Strategies for Bottom-Up Sparse Matrix OrderingSIAM Journal on Matrix Analysis and Applications, 1998
- An Approximate Minimum Degree Ordering AlgorithmSIAM Journal on Matrix Analysis and Applications, 1996
- An Estimate for the Condition Number of a MatrixSIAM Journal on Numerical Analysis, 1979