Factorized Sparse Approximate Inverse Preconditionings I. Theory
- 1 January 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 14 (1), 45-58
- https://doi.org/10.1137/0614004
Abstract
This paper considers construction and properties of factorized sparse approximate inverse preconditionings well suited for implementation on modern parallel computers. In the symmetric case such preconditionings have the form $A \to G_L AG_L^T $, where $G_L $ is a sparse approximation based on minimizing the Frobenius form $\| I - G_L L_A \|_F $ to the inverse of the lower triangular Cholesky factor $L_A $ of A, which is not assumed to be known explicitly. These preconditionings preserve symmetry and/or positive definiteness of the original matrix and, in the case of M-, H-, or block H-matrices, lead to convergent splittings.
Keywords
This publication has 7 references indexed in Scilit:
- Approximative Inversion of Positive Matrices with Applications to ModellingPublished by Springer Nature ,1987
- On a family of two-level preconditionings of the incomplete block factorization typeRussian Journal of Numerical Analysis and Mathematical Modelling, 1986
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972
- Condition numbers and equilibration of matricesNumerische Mathematik, 1969
- Blocs-H-matrices et convergence des methodes iteratives classiques par blocsLinear Algebra and its Applications, 1969
- On best conditioned matricesProceedings of the American Mathematical Society, 1955
- ber die determinanten mit berwiegender HauptdiagonaleCommentarii Mathematici Helvetici, 1937