Rational Krylov sequence methods for eigenvalue computation
- 1 April 1984
- journal article
- Published by Elsevier BV in Linear Algebra and its Applications
- Vol. 58, 391-405
- https://doi.org/10.1016/0024-3795(84)90221-0
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Lanczos versus subspace iteration for solution of eigenvalue problemsInternational Journal for Numerical Methods in Engineering, 1983
- The two-sided arnoldi algorithm for nonsymmetric eigenvalue problemsPublished by Springer Science and Business Media LLC ,1983
- Tracking the Progress of the Lanczos Algorithm for Large Symmetric EigenproblemsIMA Journal of Numerical Analysis, 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
- Use of the Singular Value Decomposition with the Manteuffel Algorithm for Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1980
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iterationNumerische Mathematik, 1978
- An Algorithm for Generalized Matrix Eigenvalue ProblemsSIAM Journal on Numerical Analysis, 1973
- Estimates for some computational techniques in linear algebraMathematics of Computation, 1966
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952