Approximate solutions and eigenvalue bounds from Krylov subspaces

Numerical Linear Algebra with Applications

Volumn 2, Issue 2, 1995, Pages 115-133

  Paige, Chris C ^a   Parlett, Beresford N ^b   van der Vorst, Henk A ^c  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UTRECHT UNIVERSITY   (Netherlands)

Author keywords

conjugate gradients; Krylov subspace; Lanczos process; Lehmann intervals; minimum residual; symmetric matrix

Indexed keywords

EID: 84985350406     PISSN: 10705325     EISSN: 10991506     Source Type: Journal    
DOI: 10.1002/nla.1680020205     Document Type: Article

References (16)

1. A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations
2. Lecture Notes in Mathematics
3. Quasi‐kernel polynomials and their use in non‐Hermitian matrix iterations
4. How far should you go with the Lanczos process?
5. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
6. Optimale Eigenwerteinschließungen
7. Zur Verwendung optimaler Eigenwerteingrenzungen bei der Losung symetrischer Matrizenaufgaben
8. On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
9. Computational variants of the Lanczos method for the eigenproblem
10. Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix
11. Solution of sparse indefinite systems of linear equations
12. The rate of convergence of conjugate gradients