Abstract
This paper presents a preconditioning method based on combining two-sided permutations with a multilevel approach. The nonsymmetric permutation exploits a greedy strategy to put large entries of the matrix in the diagonal of the upper leading submatrix. The method can be regarded as a complete pivoting version of the incomplete LU factorization. This leads to an effective incomplete factorization preconditioner for general nonsymmetric, irregularly structured, sparse linear systems.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1032-1057 |
| Number of pages | 26 |
| Journal | SIAM Journal on Scientific Computing |
| Volume | 27 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2006 |
Keywords
- Complete pivoting
- ILUT
- Incomplete LU factorization
- Krylov subspace methods
- Multielimination
- Multilevel ILU preconditioner