On numerical analysis of conjugate gradient method
From MaRDI portal
Publication:1328993
DOI10.1007/BF03167286zbMath0802.65037OpenAlexW2105041011MaRDI QIDQ1328993
Publication date: 11 December 1994
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03167286
error estimatesstopping criteriapreconditioningconjugate gradient methodsuccessive overrelaxationline SOR method
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (4)
Nonnegative splitting theory ⋮ Comparison theorems for splittings of monotone matrices ⋮ A new class of modified line-SOR algorithms ⋮ On performance of SOR method for solving nonsymmetric linear systems
Cites Work
- Unnamed Item
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Block Preconditioning for the Conjugate Gradient Method
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Methods of conjugate gradients for solving linear systems
This page was built for publication: On numerical analysis of conjugate gradient method