We design a grid-based multilevel incomplete LU preconditioner (GILUM) for solving general sparse matrices. This preconditioner combines a high accuracy ILU factorization with an algebraic multilevel recursive reduction. The GILUM preconditioner is a compliment to the domain-based multilevel block ILUT preconditioner. A major difference between these two preconditioners is the way that the coarse level nodes are chosen. The approach of GILUM is analogous to that of algebraic multigrid method. The GILUM approach avoids some controversial issues in algebraic multigrid method such as how to construct the interlevel transfer operators and how to compute the coarse level operator. Numerical experiments are conducted to compare GILUM with other ILU preconditioners.
|Number of pages||21|
|Journal||Applied Mathematics and Computation|
|State||Published - Nov 10 2001|
Bibliographical noteFunding Information:
This work was supported by the US National Science Foundation under grants CCR-9902022 and CCR-9988165, and in part by the University of Kentucky Center for Computational Sciences.
- Algebraic multigrid method
- Incomplete LU factorization
- Multilevel ILU preconditioner
- Sparse matrices
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics