Kolotilina, L. Yu.; Eremin, A. Yu. Factorized sparse approximate inverse preconditionings. I: Theory. (English) Zbl 0767.65037 SIAM J. Matrix Anal. Appl. 14, No. 1, 45-58 (1993). The present paper is the first in a series of three papers devoted to the construction of factorized, sparse, approximate inverse preconditioners and their applications to finite element schemes in the \(3D\) elasticity. In the first part, the authors present the construction techniques and investigate the properties of the preconditioners.In particular, the preconditioners proposed preserve symmetry and/or positive definiteness of the matrix they are derived from. In case of \(M\)-, \(H\)-, or block \(H\)-matrices, the factorization method leads to convergent splittings. The authors state that this preconditioning technique is well suited for the implementation on massively parallel computers. Reviewer: U.Langer (Chemnitz) Cited in 1 ReviewCited in 111 Documents MSC: 65F35 Numerical computation of matrix norms, conditioning, scaling 65F10 Iterative numerical methods for linear systems 65F50 Computational methods for sparse matrices 65Y05 Parallel numerical computation 74S05 Finite element methods applied to problems in solid mechanics 65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs 35J25 Boundary value problems for second-order elliptic equations Keywords:sparse approximate inverse; \(M\)-, \(H\)-, block \(H\)-matrices; convergent splittings; incomplete factorizations; iterative methods; parallel computation; inverse preconditioners; finite element PDFBibTeX XMLCite \textit{L. Yu. Kolotilina} and \textit{A. Yu. Eremin}, SIAM J. Matrix Anal. Appl. 14, No. 1, 45--58 (1993; Zbl 0767.65037) Full Text: DOI