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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. E. ARNOLDI, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math. 9:17–29, (1951).
Å. BJÖRCK, Solving linear least squares problems by Gram-Schmidt orthogonalization, BIT 7,1–21 (1967).
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).
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).
W. KAHAN, B. N. PARLETT and E. JIANG, Residual bounds on approximate eigensystems of nonnormal matrices, SIAM J. Numer. Anal. 19, 470–484(1982).
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).
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).
Y. SAAD, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra and its Applications 34:269–295 (1980).
Y. SAAD, The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems, SIAM J. Numer. Anal. 19, 485–506 (1982).
J. H. WILKINSON, The algebraic eigenvalue problem, Clarendon Press, Oxford (1965).
Editor information
Rights 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