Matrix Pencils pp 104-120

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

DOI: 10.1007/BFb0062097

Part of the Lecture Notes in Mathematics book series (LNM, volume 973)
Cite this paper as:
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

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.

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Axel Ruhe

There are no affiliations available

Personalised recommendations