GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
A stability analysis of incomplete LU factorizations
Mathematics of Computation
Factorized sparse approximate inverse preconditionings I: theory
SIAM Journal on Matrix Analysis and Applications
A framework for block ILU factorizations using block-size reduction
Mathematics of Computation
Iterative solution methods
Parallel Preconditioning with Sparse Approximate Inverses
SIAM Journal on Scientific Computing
Approximate Inverse Preconditioners via Sparse-Sparse Iterations
SIAM Journal on Scientific Computing
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
| Hi-index | 0.00 |
ILUS factorization has many desirable properties such as its amenability to the skyline format, the ease with which stability may be monitored, and the possibility of constructing a preconditioner with symmetric structure. In this paper we introduce a new preconditioning technique for general sparse linear systems based on the ILUS factorization strategy. The resulting preconditioner has the same properties as the ILUS preconditioner. Some theoretical properties of the new preconditioner are discussed and numerical experiments on test matrices from the Harwell-Boeing collection are tested. Our results indicate that the new preconditioner is cheaper to construct than the ILUS preconditioner.