Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- 1 July 1997
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 259, 1-23
- https://doi.org/10.1016/s0024-3795(96)00238-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric EigenproblemsSIAM Journal on Matrix Analysis and Applications, 1995
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matricesBIT Numerical Mathematics, 1994
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II. matrix pairsLinear Algebra and its Applications, 1994
- Implicit Application of Polynomial Filters in a k-Step Arnoldi MethodSIAM Journal on Matrix Analysis and Applications, 1992
- Large-scale complex eigenvalue problemsJournal of Computational Physics, 1989
- Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problemsMathematics of Computation, 1984
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matricesLinear Algebra and its Applications, 1980
- 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