Construction and efficient implementation of implicit preconditioning methods. I

DOI10.1007/BF01098600zbMath0792.65016OpenAlexW4235509855MaRDI QIDQ1325450

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

Publication date: 5 July 1994

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

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

zbMATH Keywords

large sparse matricesimplicit preconditioning methods

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) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Unnamed Item
• Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
• Comparison of splittings used with the conjugate gradient algorithm
• Polynomial Preconditioners for Conjugate Gradient Calculations
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
• On the Convergence of Some Generalized Preconditioned Iterative Methods
• A generalized SSOR method

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