Towards understanding CG and GMRES through examples

DOI10.1016/J.LAA.2024.04.003MaRDI QIDQ6496390

Zdeněk Strakoš, Jörg Liesen, Erin Claire Carson

Publication date: 3 May 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

convergence analysis iterative methods Krylov subspace methods GMRES method method of moments rounding error analysis CG method polynomial approximation problems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Preconditioners for iterative methods (65F08)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
On prescribing the convergence behavior of the conjugate gradient algorithm
On the real convergence rate of the conjugate gradient method
Model reduction using the Vorobyev moment problem
The rate of convergence of conjugate gradients
Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
QMR: A quasi-minimal residual method for non-Hermitian linear systems
Eigenvalues and pseudo-eigenvalues of Toeplitz matrices
Matrix interpretations and applications of the continued fraction algorithm
Comparison of splittings used with the conjugate gradient algorithm
Krylov sequences of maximal length and convergence of GMRES
Iterative solution of large sparse systems of equations. Transl. from the German
On the convergence rate of the conjugate gradients in presence of rounding errors
Estimates in quadratic formulas
The probability that a random real Gaussian matrix has \(k\) real eigenvalues, related distributions, and the circular law
Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
Bounds for the least squares distance using scaled total least squares
On error estimation in the conjugate gradient method and why it works in finite precision computations
Preconditioning techniques for large linear systems: A survey
Numerical stability of GMRES
The methods of Vorobyev and Lanczos
Elimination of ringing artifacts by finite-element projection in FFT-based homogenization
Numerical approximation of the spectrum of self-adjoint operators in operator preconditioning
Accurate error estimation in CG
Decomposition into subspaces preconditioning: abstract framework
On investigating GMRES convergence using unitary matrices
Rounding error analysis of the classical Gram-Schmidt orthogonalization process
Error estimation in preconditioned conjugate gradients
Max-min and min-max approximation problems for normal matrices revisited
On the theory of equivalent operators and application to the numerical solution of uniformly elliptic partial differential equations
Guaranteed two-sided bounds on all eigenvalues of preconditioned diffusion and elasticity problems solved by the finite element method.
An optimal preconditioned FFT-accelerated finite element solver for homogenization
Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers
Which Eigenvalues Are Found by the Lanczos Method?
Residual and Backward Error Bounds in Minimum Residual Krylov Subspace Methods
Approximating Spectral Densities of Large Matrices
Finite Elements and Fast Iterative Solvers
GMRES vs. Ideal GMRES
A Taxonomy for Conjugate Gradient Methods
The Lanczos and conjugate gradient algorithms in finite precision arithmetic
Preconditioning by inverting the Laplacian: an analysis of the eigenvalues
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
Solution of Sparse Indefinite Systems of Linear Equations
Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method
Max-Min Properties of Matrix Factor Norms
GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
The Tortoise and the Hare Restart GMRES
A Note on Preconditioning for Indefinite Linear Systems
The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology
Convergence analysis of Krylov subspace methods
Minimal Residual Method Stronger than Polynomial Preconditioning
Convergence of Adaptive Finite Element Methods
Iterative Krylov Methods for Large Linear Systems
Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
Any Nonincreasing Convergence Curve is Possible for GMRES
Krylov Methods for Nonsymmetric Linear Systems
On the cost of iterative computations
Computing Spectral Measures of Self-Adjoint Operators
Two‐sided guaranteed bounds to individual eigenvalues of preconditioned finite element and finite difference problems
IFISS: A Computational Laboratory for Investigating Incompressible Flow Problems
Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator
Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs
Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method
Properties of Worst-Case GMRES
Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
The Lanczos and Conjugate Gradient Algorithms
Calculation of Gauss Quadrature Rules
Error Bounds in Equilibrium Statistical Mechanics
On the Compatibility of a Given Solution With the Data of a Linear System
Use of Fast Direct Methods for the Efficient Numerical Solution of Nonseparable Elliptic Equations
GMRES Convergence Analysis for a Convection-Diffusion Model Problem
The principle of minimized iterations in the solution of the matrix eigenvalue problem
Convergence of a Method of Solving Linear Problems
Methods of conjugate gradients for solving linear systems
Solving linear algebraic equations can be interesting

This page was built for publication: Towards understanding CG and GMRES through examples