On the Relations between ILUs and Factored Approximate Inverses

Authors:
Matthias Bollhöfer;Yousef Saad
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2002

Citing 0
Cited 6

Preconditioning techniques for large linear systems: a survey

Journal of Computational Physics
On computing of block ILU preconditioner for block tridiagonal systems

Journal of Computational and Applied Mathematics
A bit-compatible parallelization for ILU(k) preconditioning

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Greville's method for preconditioning least squares problems

Advances in Computational Mathematics
Improved Balanced Incomplete Factorization

SIAM Journal on Matrix Analysis and Applications
A complete pivoting strategy for the right-looking Robust Incomplete Factorization preconditioner

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper discusses some relationships between ILU factorization techniques and factored sparse approximate inverse techniques. While ILU factorizations compute approximate LU factors of the coefficient matrix A, approximate inverse techniques aim at building triangular matrices Z and W such that $W^\top AZ$ is approximately diagonal. The paper shows that certain forms of approximate inverse techniques amount to approximately inverting the triangular factors obtained from some variants of ILU factorization of the original matrix. A few useful applications of these relationships will be discussed.