This is the authors' abstract. We don't add key points for this paper.
A new method, called the $QZ$ algorithm, is presented for the solution of the matrix eigenvalue problem Ax = λ 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 λ are also mentioned.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Moler et al. (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: