An Algorithm for Generalized Matrix Eigenvalue Problems
C Moler, G. W. Stewart · SIAM Journal on Numerical Analysis · 1973
A new method, called the $QZ$ algorithm, is presented for the solution of the matrix eigenvalue problem $Ax = \lambda Bx$ with general square matrices A and B. Particular attention is paid to the degeneracies which result when B is singular. No inversions of B or its submatrices are used. The algorithm is a generalization of the $QR$ algorithm, and reduces to it when $B = I$. Problems involving higher powers of $\lambda $ are also mentioned.
Cited by 1,096 works. doi:10.1137/0710024
Authors
References
- The algebraic eigenvalue problem
- The Algebraic Eigenvalue Problem
- The algebraic eigenvalue problem
- Unitary Triangularization of a Nonsymmetric Matrix
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The QR Transformation--Part 2
- $Ax = \lambda Bx$ and the Generalized Eigenproblem
- On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
- Similarity reduction of a general matrix to Hessenberg form
- Reduction of the symmetric eigenproblemAx=λBx and related problems to standard form