Construction and efficient implementation of implicit preconditioning methods. II

DOI10.1007/BF01098761zbMath0793.65013OpenAlexW2077511060MaRDI QIDQ1325303

V. E. Ryabtsev, A. S. Trigub, I. N. Molchanov

Publication date: 12 July 1994

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01098761

zbMATH Keywords

sparse matriceslarge systemscomparative analysispreconditioning methodsmulti-processor computers

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) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
• Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
• Sparse matrices

This page was built for publication: Construction and efficient implementation of implicit preconditioning methods. II