Preconditioning techniques for large linear systems: a survey
Journal of Computational Physics
Journal of Computational Physics
A new stabilization strategy for incomplete LU preconditioning of indefinite matrices
Applied Mathematics and Computation
Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Computations
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Distributed block independent set algorithms and parallel multilevel ILU preconditioners
Journal of Parallel and Distributed Computing
Parallel FEM Software for CFD Problems
Informatica
Stabilized approximate inverse preconditioners for indefinite matrices
Proceedings of the 46th Annual Southeast Regional Conference on XX
A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
Computers & Mathematics with Applications
Hi-index | 0.01 |
A dual reordering strategy based on both threshold and graph reorderings is introduced to construct robust incomplete LU (ILU) factorization of indefinite matrices. The ILU matrix is constructed as a preconditioner for the original matrix to be used in a preconditioned iterative scheme. The matrix is first divided into two parts according to a threshold parameter to control diagonal dominance. The first part with large diagonal dominance is reordered using a graph-based strategy, followed by an ILU factorization. A partial ILU factorization is applied to the second part to yield an approximate Schur complement matrix. The whole process is repeated on the Schur complement matrix and continues for a few times to yield a multilevel ILU factorization. Analyses are conducted to show how the Schur complement approach removes small diagonal elements of indefinite matrices and how the stability of the LU factor affects the quality of the preconditioner. Numerical results are used to compare the new preconditioning strategy with two popular ILU preconditioning techniques and a multilevel block ILU threshold preconditioner.