A geometric theory for preconditioned inverse iteration applied to a subspace

Mathematics of Computation

Volumn 71, Issue 237, 2002, Pages 197-216

  Neymeyr, Klaus ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Inverse iteration; Multigrid; Preconditioning; Subspace iteration; Symmetric eigenvalue problem

Indexed keywords

EID: 0036003403     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-01-01357-6     Document Type: Article

References (19)

1. A subspace preconditioning algorithm for eigenvector/eigenvalue computation
2. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
3. Iteration methods in eigenvalue problems
4. Group iterative method for finding lower-order eigenvalues
5. On an iterative method for finding lower eigenvalues
6. Minimization of the computational labor in determining the first eigenvalues of differential operators
7. On the convergence of the modified method of steepest descent in the calculation of eigenvalues
8. A history of inverse iteration
9. Computing an eigenvector with inverse iteration
10. Preconditioned eigensolvers - An oxymoron?
11. A posteriori error estimation for elliptic eigenproblems
12. A geometric theory for preconditioned inverse iteration. I: Extrema of the Rayleigh quotient
13. A geometric theory for preconditioned inverse iteration. II: Convergence estimates
14. On the eigenvalue problem Tu - λSu = 0 with unbounded and non-symmetric operators T and S
15. The steepest descent method for an eigenvalue problem with semi-bounded operators