Reaching the superlinear convergence phase of the CG method
From MaRDI portal
Publication:2511201
DOI10.1016/j.cam.2013.10.001zbMath1293.65045OpenAlexW2032254332MaRDI QIDQ2511201
Publication date: 5 August 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.10.001
Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items (2)
Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems ⋮ Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Superlinearly convergent CG methods via equivalent preconditioning for nonsymmetric elliptic operators
- Equivalent operator preconditioning for elliptic problems
- On the eigenvalue distribution of a class of preconditioning methods
- The rate of convergence of conjugate gradients
- A class of iterative methods for finite element equations
- Comparison of splittings used with the conjugate gradient algorithm
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- Finite Element Solution of Boundary Value Problems
- ON THE RATE OF CONVERGENCE OF THE CONJUGATE GRADIENT METHOD FOR LINEAR OPERATORS IN HILBERT SPACE
- Mesh Independent Superlinear PCG Rates Via Compact-Equivalent Operators
- Some Superlinear Convergence Results for the Conjugate Gradient Method
- Iterative Solution Methods
- New convergence results and preconditioning strategies for the conjugate gradient method
- Methods of conjugate gradients for solving linear systems
- On the sublinear and superlinear rate of convergence of conjugate gradient methods
This page was built for publication: Reaching the superlinear convergence phase of the CG method