An iterative solution method for solving f(A)x = b, using Krylov subspace information obtained for the symmetric positive definite matrix A
Henk A. van der Vorst · Journal of Computational and Applied Mathematics · 1987
Cited by 167 works. doi:10.1016/0377-0427(87)90020-3 Open-access PDF
Authors
References
- Methods of conjugate gradients for solving linear systems
- Computational Variants of the Lanczos Method for the Eigenproblem
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- The Lanczos Algorithm with Selective Orthogonalization
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- The rate of convergence of Conjugate Gradients
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- On the Lánczos method for solving symmetric linear systems with several right-hand sides
- Numerical aspects of gram-schmidt orthogonalization of vectors