Matrix Renumbering ILU: An Effective Algebraic Multilevel ILU Preconditioner for Sparse Matrices
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 20 (4) , 1007-1026
- https://doi.org/10.1137/s0895479897319301
Abstract
In this paper a multilevel-like ILU preconditioner is introduced. The ILU factorization generates its own ordering during the elimination process. Both ordering and dropping depend on the size of the entries. The method can handle structured and unstructured problems. Results are presented for some important classes of matrices and for several well-known test examples. The results illustrate the efficiency of the method and show in several cases near grid independent convergence.Keywords
This publication has 37 references indexed in Scilit:
- Multilevel ILU decompositionNumerische Mathematik, 1999
- How fast the laplace equation was solved in 1995Applied Numerical Mathematics, 1997
- On the Algebraic Multigrid MethodJournal of Computational Physics, 1996
- The convergence behaviour of iterative methods on severely stretched gridsInternational Journal for Numerical Methods in Engineering, 1993
- An incomplete-factorization preconditioning using repeated red-black orderingNumerische Mathematik, 1992
- Towards a cost-effective ILU preconditioner with high level fillBIT Numerical Mathematics, 1992
- The Nested Recursive Two-Level Factorization Method for Nine-Point Difference MatricesSIAM Journal on Scientific and Statistical Computing, 1991
- Parallel multilevel preconditionersMathematics of Computation, 1990
- Existence Criteria for Partial Matrix Factorizations in Iterative MethodsSIAM Journal on Numerical Analysis, 1976
- Direct Methods for Solving Symmetric Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1971