Skip to main content
SpringerLink
Log in

The two-sided arnoldi algorithm for nonsymmetric eigenvalue problems

  • Section A.3 Of General (A-λB)-Pencils
  • Conference paper
  • First Online:
Book cover Matrix Pencils

Part of the book series: Lecture Notes in Mathematics ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. E. ARNOLDI, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math. 9:17–29, (1951).

    MathSciNet  MATH  Google Scholar 

  2. Å. BJÖRCK, Solving linear least squares problems by Gram-Schmidt orthogonalization, BIT 7,1–21 (1967).

    Article  MathSciNet  MATH  Google Scholar 

  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).

    Article  MathSciNet  MATH  Google Scholar 

  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).

    MathSciNet  MATH  Google Scholar 

  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).

    Article  MathSciNet  MATH  Google Scholar 

  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).

    Article  MathSciNet  Google Scholar 

  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. Y. SAAD, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra and its Applications 34:269–295 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  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).

    Article  MathSciNet  MATH  Google Scholar 

  10. J. H. WILKINSON, The algebraic eigenvalue problem, Clarendon Press, Oxford (1965).

    MATH  Google Scholar 

Download references

Authors
  1. Axel Ruhe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bo Kågström Axel Ruhe

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Ruhe, A. (1983). The two-sided arnoldi algorithm for nonsymmetric eigenvalue problems. In: Kågström, B., Ruhe, A. (eds) Matrix Pencils. Lecture Notes in Mathematics, vol 973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062097

Download citation

  • DOI: https://doi.org/10.1007/BFb0062097

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11983-8

  • Online ISBN: 978-3-540-39447-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation