Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems

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.

[1]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[2]  W. Arnoldi.  The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .

[3]  F. L. Bauer.  Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme , 1957 .

[4]  Marc Nerlove,et al.  Mathematical Methods and Theory in Games, Programming, and Economics, Vol. I: Matrix Games, Programming, and Mathematical Economics. Vol. II: The Theory of Infinite Games. Samuel Karlin , 1960 .

[5]  Samuel Karlin,et al.  Mathematical Methods and Theory in Games, Programming, and Economics , 1961 .

[6]  H. E. Wrigley.  Accelerating the Jacobi Method for Solving Simultaneous Equations by Chebyshev Extrapolation When the Eigenvalues of the Iteration Matrix are Complex , 1963, Computer/law journal.

[7]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[8]  E. Dowell.  Nonlinear oscillations of a fluttering plate. II. , 1966 .

[9]  K. Zaman,et al.  Nonlinear oscillations of a fluttering plate. , 1966 .

[10]  Alston S. Householder,et al.  Handbook for Automatic Computation , 1960, Comput. J..

[11]  H. Rutishauser.  Computational aspects of F. L. Bauer's simultaneous iteration method , 1969 .

[12]  Maurice Clint,et al.  The Evaluation of Eigenvalues and Eigenvectors of Real Symmetric Matrices by Simultaneous Iteration , 1970, Comput. J..

[13]  Maurice Clint,et al.  A Simultaneous Iteration Method for the Unsymmetric Eigenvalue Problem , 1971 .

[14]  D. Sattinger.  Bifurcation of periodic solutions of the navier-stokes equations , 1971 .

[15]  K. K. Gupta.  On a combined Sturm sequence and inverse iteration technique for eigenproblem solution of spinning structures , 1973 .

[16]  J. H. Wilkinson,et al.  Handbook for Automatic Computation. Vol II, Linear Algebra , 1973 .

[17]  Michel Géradin,et al.  Finite element analysis of Supersonic panel flutter , 1973 .

[18]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[19]  T. J. Rivlin.  The Chebyshev polynomials , 1974 .

[20]  T. Manteuffel.  An Iterative Method for Solving Nonsymmetric Linear Systems With Dynamic Estimation of Parameters , 1975 .

[21]  A discussion of a paper by K. K. Gupta , 1975 .

[22]  A. Jennings,et al.  Simultaneous Iteration for Partial Eigensolution of Real Matrices , 1975 .

[23]  G. Stewart.  Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices , 1976 .

[24]  Author's reply to a recent discussion , 1976 .

[25]  K. K. Gupta.  On a numerical solution of the supersonic panel flutter eigenproblem , 1976 .

[26]  T. Manteuffel.  The Tchebychev iteration for nonsymmetric linear systems , 1977 .

[27]  T. Manteuffel.  Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration , 1978 .

[28]  G W Stewart,et al.  SRRIT - A FORTRAN Subroutine to Calculate the Dominant Invariant Subspaces of a Real Matrix. , 1978 .

[29]  E. Seneta.  Computing the stationary distribution for infinite Markov chains , 1980, Advances in Applied Probability.

[30]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[31]  Y. Saad.  Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices , 1980 .

[32]  Eugene Seneta,et al.  Computing the stationary distribution for infinite Markov chains , 1980 .

[33]  William J. Stewart,et al.  A Simultaneous Iteration Algorithm for Real Matrices , 1981, TOMS.

[34]  D. Smolarski.  Optimum semi-iterative methods for the solution of any linear algebraic system with a square matrix , 1982 .

[35]  H. Elman.  Iterative methods for large, sparse, nonsymmetric systems of linear equations , 1982 .

[36]  D. Taylor.  Analysis of the Look Ahead Lanczos Algorithm. , 1982 .

[37]  Alan J. Laub,et al.  Schur techniques for riccati differential equations , 1982 .

[38]  A. Laub.  Schur techniques in invariant imbedding methods for solving two-point boundary value problems , 1982, 1982 21st IEEE Conference on Decision and Control.

[39]  Youcef Saad,et al.  Projection methods for solving large sparse eigenvalue problems , 1983 .

[40]  L. Kaufman.  Matrix Methods for Queuing Problems , 1983 .

[41]  Axel Ruhe.  Rational Krylov sequence methods for eigenvalue computation , 1984 .

[42]  Zhishun A. Liu,et al.  A Look Ahead Lanczos Algorithm for Unsymmetric Matrices , 1985 .

[43]  Y. Saad,et al.  A hybrid Chebyshev Krylov subspace algorithm for solving nonsymmetric systems of linear equations , 1986 .