The $LZ$-Algorithm to Solve the Generalized Eigenvalue Problem
Linda Kaufman · SIAM Journal on Numerical Analysis · 1974
In this paper, we will present and analyze an algorithm for finding ${\bf x}$ and $\lambda$ such that \[ A{\bf x} = \lambda B{\bf x},\] where A and B are $n \times n$ matrices. The algorithm does not require matrix inversion, and may be used when either or both matrices are singular. Our method is a generalization of Rutishauser’s $LR$-method [20] for the standard eigenvalue problem $A{\bf x} = \lambda {\bf x}$ and closely resembles the $QZ$-algorithm given by Moler and Stewart [13] for the generalized problem given above. Unlike the $QZ$-algorithm, which uses orthogonal transformations, our method, the $LZ$-algorithm, uses elementary transformations. When either A or B is complex, our method should be more efficient.
Cited by 56 works. doi:10.1137/0711078
Authors
References
- The algebraic eigenvalue problem
- The algebraic eigenvalue problem
- Computer Solution of Linear Algebraic Systems
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Handbook for Automatic Computation
- An Algorithm for Generalized Matrix Eigenvalue Problems
- The QR Transformation--Part 2
- $Ax = \lambda Bx$ and the Generalized Eigenproblem
- Reduction of the symmetric eigenproblemAx=λBx and related problems to standard form
- An Algorithm for the Ill-Conditioned Generalized Eigenvalue Problem