Advertisement

Matrix Pencils pp 104-120 | Cite as

The two-sided arnoldi algorithm for nonsymmetric eigenvalue problems

  • Axel Ruhe
Section A.3 Of General (A-λB)-Pencils Algorithms For Large Sparse (A-λI)-Problems
Part of the Lecture Notes in Mathematics book series (LNM, volume 973)

Abstract

Algorithms for computing a few eigenvalues of a large nonsymmetric matrix are described. An algorithm which computes both left and right eigenvector approximations, by applying the Arnoldi algorithm both to the matrix and its transpose is described. Numerical tests are reported.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    W. E. ARNOLDI, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math. 9:17–29, (1951).MathSciNetzbMATHGoogle Scholar
  2. 2.
    Å. BJÖRCK, Solving linear least squares problems by Gram-Schmidt orthogonalization, BIT 7,1–21 (1967).MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    A. K. CLINE, C. B. MOLER, G. W. STEWART and J. H. WILKINSON, An estimate for the condition number of a matrix, SIAM J. Numer. Anal. 16,368–375 (1979).MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    T. ERICSSON and A. RUHE, The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems, Math Comp. 35, 1251–1268 (1980).MathSciNetzbMATHGoogle Scholar
  5. 5.
    W. KAHAN, B. N. PARLETT and E. JIANG, Residual bounds on approximate eigensystems of nonnormal matrices, SIAM J. Numer. Anal. 19, 470–484(1982).MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. of Standards 45:255–282 (1950).MathSciNetCrossRefGoogle Scholar
  7. 7.
    B. N. PPARPLETT and D. TAYLOR, A look ahead Lanczos algorithm for unsymmetric matrices, Technical Report PAM-43, Center for Pure and Applied Mathematics, Berkeley (1981).Google Scholar
  8. 8.
    Y. SAAD, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra and its Applications 34:269–295 (1980).MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Y. SAAD, The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems, SIAM J. Numer. Anal. 19, 485–506 (1982).MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    J. H. WILKINSON, The algebraic eigenvalue problem, Clarendon Press, Oxford (1965).zbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Axel Ruhe

There are no affiliations available

Personalised recommendations