.png){kind=icon}
.png){kind=icon}
Return
FACTORIZED APPROXIMATE INVERSES WITH ADAPTIVE DROPPING
.png){kind=icon}
PRE
AI
DOI：10.1137/15M1030315.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new approach to constructing factorized approximate inverses for a symmetric and positive definite matrix A. The proposed strategy is based on adaptive dropping that reflects the quality of preserving the relation UZ = I between the direct factor U and the inverse factor Z satisfying A = (UU)-U-T and A(-1) = ZZ(T). An important part of the approach is column pivoting, used to minimize the growth of the condition number of leading principal submatrices of U that occurs explicitly in the dropping criterion. Numerical experiments demonstrate that the resulting approximate inverse factorization is robust as a preconditioner for solving large and sparse systems of linear equations.
Keywords:
approximate inverses
incomplete factorization
Gram-Schmidt orthogonalization
preconditioned iterative methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W