A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- 1 December 1993
- journal article
- research article
- Published by Springer Nature in Numerische Mathematik
- Vol. 64 (1) , 181-193
- https://doi.org/10.1007/bf01388686
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Large-scale complex eigenvalue problemsJournal of Computational Physics, 1989
- Tchebychev acceleration technique for large scale nonsymmetric matricesNumerische Mathematik, 1989
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problemsMathematics of Computation, 1984
- A Simultaneous Iteration Algorithm for Real MatricesACM Transactions on Mathematical Software, 1981
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matricesLinear Algebra and its Applications, 1980
- The Tchebychev iteration for nonsymmetric linear systemsNumerische Mathematik, 1977
- Computational aspects of F. L. Bauer's simultaneous iteration methodNumerische Mathematik, 1969
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951