Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems

Research output: Contribution to journalArticlepeer-review

165 Scopus citations


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 Arnoldis 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 Arnold Chebyshev approach.

Original languageEnglish (US)
Pages (from-to)567-588
Number of pages22
JournalMathematics of Computation
Issue number166
StatePublished - Apr 1984


Dive into the research topics of 'Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems'. Together they form a unique fingerprint.

Cite this