Generalized compensation principle in incomplete factorization methods

DOI10.1515/RNAM.1997.12.5.399MaRDI QIDQ4374970zbMATH OpenOpenAlexFDO

Authors V. P. Il'in, K. Laevsky

Publication date 16 February 1998

Published in Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/rnam.1997.12.5.399

zbMATH Keywords

incomplete factorization methodsnumerical experimentspreconditioningsparse matricesStieltjes matrices

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)

Recommendations

• scientific article; zbMATH DE number 1286374
• scientific article; zbMATH DE number 1001408
• scientific article; zbMATH DE number 1985700
• scientific article; zbMATH DE number 766250
• A general incomplete block-matrix factorization method

Cited in

(4)

• Parallel variable-triangular iterative methods in Krylov subspaces
• Iterative preconditioned methods in Krylov spaces: trends of the 21st century
• scientific article; zbMATH DE number 1286374 (Why is no real title available?)
• scientific article; zbMATH DE number 2119858 (Why is no real title available?)

This page was built for publication: Generalized compensation principle in incomplete factorization methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4374970)