A geometric theory forpreconditioned inverse iterationII: Convergence estimates

Linear Algebra and Its Applications

Volumn 322, Issue 1-3, 2001, Pages 87-104

  Neymeyr, Klaus ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

65N25; Inverse iteration; Multigrid; Preconditioning; Primary 65F15; Secondary 65N30; Symmetric eigenvalue problem

Indexed keywords

EID: 0035585865     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(00)00236-6     Document Type: Article

References (6)

1. Bramble J.H., Pasciak J.E., Knyazev A.V. A subspace preconditioning algorithm for eigenvector/eigenvalue computation, Adv. Comput. Math. 6:1996;159-189.
2. D'yakonov E.G., Orekhov M.Y. Minimization of the computational labor in determining the first eigenvalues of differential operators. Math. Notes. 27:1980;382-391.
3. Knyazev A.V. Preconditioned eigensolvers - an oxymoron? Electron. Trans. Numer. Anal. 7:1998;104-123.
4. K. Neymeyr, A geometric theory for preconditioned inverse iteration applied to a subspace, Sonderforschungsbereich 382, Universität Tübingen, Report 131, 1999.
5. K. Neymeyr. A posteriori error estimation for elliptic eigenproblems, Sonderforschungsbereich 382, Universität Tübingen, Report 132, 1999.
6. Saad Y. Numerical Methods for Large Eigenvalue Problems. 1992;Manchester University Press, Manchester.