Projection methods for solving large sparse eigenvalue problems
- 1 January 1983
- book chapter
- Published by Springer Nature
- p. 121-144
- https://doi.org/10.1007/bfb0062098
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Residual Bounds on Approximate Eigensystems of Nonnormal MatricesSIAM Journal on Numerical Analysis, 1982
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric SystemsSIAM Journal on Numerical Analysis, 1982
- Krylov subspace methods for solving large unsymmetric linear systemsMathematics of Computation, 1981
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matricesLinear Algebra and its Applications, 1980
- On the Rates of Convergence of the Lanczos and the Block-Lanczos MethodsSIAM Journal on Numerical Analysis, 1980
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matricesNumerische Mathematik, 1976
- A Geometric Theory for the $QR$, $LU$ and Power IterationsSIAM Journal on Numerical Analysis, 1973
- A Simultaneous Iteration Method for the Unsymmetric Eigenvalue ProblemIMA Journal of Applied Mathematics, 1971
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951
- An iteration method for the solution of the eigenvalue problem of linear differential and integral operatorsJournal of Research of the National Bureau of Standards, 1950