Inexact Inverse Iteration for Generalized Eigenvalue Problems
Authors:
- 1 December 2000
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 40 (4) , 671-684
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: the Lanczos process with inner–outer iterationsLinear Algebra and its Applications, 2000
- The effects of inexact solvers in algorithms for symmetric eigenvalue problemsLinear Algebra and its Applications, 1999
- An inexact inverse iteration for large sparse eigenvalue problemsNumerical Linear Algebra with Applications, 1997
- Robust preconditioning of large, sparse, symmetric eigenvalue problemsJournal of Computational and Applied Mathematics, 1995
- The Davidson MethodSIAM Journal on Scientific Computing, 1994
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue ProblemsSIAM Journal on Scientific Computing, 1993
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1986
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matricesNumerische Mathematik, 1976
- The method of conjugate gradients used in inverse iterationBIT Numerical Mathematics, 1972
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951