On the real convergence rate of the conjugate gradient method
From MaRDI portal
Publication:808614
DOI10.1016/0024-3795(91)90393-BzbMath0732.65021MaRDI QIDQ808614
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
On the convergence rate of the conjugate gradients in presence of rounding errors, Highly accurate verified error bounds for Krylov type linear system solvers, Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations, A numerical study of optimized sparse preconditioners, Estimates in quadratic formulas, Monotone convergence of the extended Krylov subspace method for Laplace-Stieltjes functions of Hermitian positive definite matrices, Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions, The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology, On sensitivity of Gauss-Christoffel quadrature, When does the Lanczos algorithm compute exactly?, Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems, On GMRES for Singular EP and GP Systems, Guaranteed two-sided bounds on all eigenvalues of preconditioned diffusion and elasticity problems solved by the finite element method., The Short-Term Rational Lanczos Method and Applications, A monotonicity result for norms in conjugate gradient algorithms, The behavior of the Gauss-Radau upper bound of the error norm in CG, Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation, Statistical properties of BayesCG under the Krylov prior, A posteriori superlinear convergence bounds for block conjugate gradient, Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations, Predict-and-Recompute Conjugate Gradient Variants, A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues, Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations, Stochastic estimates for the trace of functions of matrices via Hadamard matrices, Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator, On the cost of iterative computations, Iterative solution of linear systems in the 20th century, Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical stability of descent methods for solving linear equations
- On the eigenvalue distribution of a class of preconditioning methods
- On the rate of convergence of the preconditioned conjugate gradient method
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Roundoff-error analysis of a new class of conjugate-gradient algorithms
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Comparison of splittings used with the conjugate gradient algorithm
- Finite Element Solution of Boundary Value Problems
- The Lanczos Algorithm With Partial Reorthogonalization
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Solution of Sparse Indefinite Systems of Linear Equations
- Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method
- Methods of conjugate gradients for solving linear systems
