Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- 1 April 1984
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 42 (166) , 567-588
- https://doi.org/10.2307/2007602
Abstract
The present paper deals with the problem of computing a few of the eigenvalues with largest (or smallest) real parts, of a large sparse nonsymmetric matrix. We present a general acceleration technique based on Chebyshev polynomials and discuss its practical application to Arnoldi’s method and the subspace iteration method. The resulting algorithms are compared with the classical ones in a few experiments which exhibit a sharp superiority of the Arnoldi-Chebyshev approach.Keywords
This publication has 19 references indexed in Scilit:
- Schur techniques for riccati differential equationsPublished by Springer Nature ,2005
- Matrix Methods for Queuing ProblemsSIAM Journal on Scientific and Statistical Computing, 1983
- A Simultaneous Iteration Algorithm for Real MatricesACM Transactions on Mathematical Software, 1981
- Applied Iterative MethodsPublished by Elsevier ,1981
- The Tchebychev iteration for nonsymmetric linear systemsNumerische Mathematik, 1977
- Simultaneous Iteration for Partial Eigensolution of Real MatricesIMA Journal of Applied Mathematics, 1975
- A Simultaneous Iteration Method for the Unsymmetric Eigenvalue ProblemIMA Journal of Applied Mathematics, 1971
- Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer EigenwertproblemeZeitschrift für angewandte Mathematik und Physik, 1957
- 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