A General Matrix Eigenvalue Algorithm
Charles F. Van Loan · SIAM Journal on Numerical Analysis · 1975
A general $QR$-type process called the $VZ$ algorithm is presented for the solution of the general matrix eigenvalue problem $ACx = \lambda BDx$. The matrices involved may be rectangular. For appropriate choices of A , B, C and D, we have some of the more familiar types of eigenproblems, and this is reflected in the fact that the $QR$, $QZ$ and $SVD$ algorithms are all special cases of the $VZ$ algorithm. The main emphasis is upon the algorithm’s generality as well as its bearing upon the generalized singular value problem $A^T Ax = \mu ^2 B^T Bx$.
Cited by 48 works. doi:10.1137/0712061
Authors
References
- The algebraic eigenvalue problem
- The Algebraic Eigenvalue Problem
- Singular value decomposition and least squares solutions
- Computer Solution of Linear Algebraic Systems
- Unitary Triangularization of a Nonsymmetric Matrix
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- An Algorithm for Generalized Matrix Eigenvalue Problems
- The QR Transformation--Part 2
- On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$