On numerical analysis of conjugate gradient method
DOI10.1007/BF03167286zbMATH Open0802.65037OpenAlexW2105041011MaRDI QIDQ1328993FDOQ1328993
Authors: Zbigniew I. Woźnicki 
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
Recommendations
preconditioningerror estimatesconjugate gradient methodsuccessive overrelaxationstopping criterialine SOR method
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- 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
- Title not available (Why is that?)
- Block Preconditioning for the Conjugate Gradient Method
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
Cited In (8)
- Title not available (Why is that?)
- On the discrete dynamic nature of the conjugate gradient method
- On performance of SOR method for solving nonsymmetric linear systems
- Comparison theorems for splittings of monotone matrices
- Title not available (Why is that?)
- Nonnegative splitting theory
- Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations
- A new class of modified line-SOR algorithms
This page was built for publication: On numerical analysis of conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328993)
