Matrix Pencils pp 104-120
The two-sided arnoldi algorithm for nonsymmetric eigenvalue problems
- First Online:
- 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
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.
Unable to display preview. Download preview PDF.