The two-sided arnoldi algorithm for nonsymmetric eigenvalue problems
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.
- 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