An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
Jocelyne Erhel, Frédéric Guyomarc'h · SIAM Journal on Matrix Analysis and Applications · 2000
Many scientific applications require one to solve successively linear systems Ax=b with different right-hand sides b and a symmetric positive definite matrix A. The conjugate gradient method applied to the first system generates a Krylov subspace which can be efficiently recycled thanks to orthogonal projections in subsequent systems. A modified conjugate gradient method is then applied with a specific initial guess and initial descent direction and a modified descent direction during the iterations. This paper gives new theoretical results for this method and proposes a new version. Numerical experiments show the efficacy of our method even for quite different right-hand sides.
Cited by 72 works. doi:10.1137/s0895479897330194
Authors
References
- Iterative Methods for Sparse Linear Systems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- The rate of convergence of Conjugate Gradients
- The block conjugate gradient algorithm and related methods
- A Restarted GMRES Method Augmented with Eigenvectors
- An iterative solution method for solving f(A)x = b, using Krylov subspace information obtained for the symmetric positive definite matrix A
- On the Lánczos method for solving symmetric linear systems with several right-hand sides
- Deflation of Conjugate Gradients with Applications to Boundary Value Problems
- Restarted GMRES preconditioned by deflation
- Deflated and Augmented Krylov Subspace Techniques