Generalized compensation principle in incomplete factorization methods

DOI10.1515/rnam.1997.12.5.399zbMath0888.65034OpenAlexW2069774004MaRDI QIDQ4374970

Konstantin Y. Laevsky, V. P. Il'in

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

numerical experimentspreconditioningsparse matricesincomplete factorization methodsStieltjes matrices

Mathematics Subject Classification ID

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

Related Items (2)

Parallel variable-triangular iterative methods in Krylov subspaces ⋮ Iterative preconditioned methods in Krylov spaces: trends of the 21st century

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