Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems
Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems
The present paper deals with the problem of computing a few of the eigenvalues with <italic>largest (or smallest) real parts</italic>, 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 ā¦