Most of the popular algorithms for numerically solving the generalized eigenvalue problem are briefly analyzed with special emphasis placed on the QZ algorithm and the combination shift QZ algorithm. The emergence of infinite eigenvalues under exact arithmetic is discussed in detail for both these algorithms. This leads to the presentation of an improved version of the combination shift QZ algorithm. The reduction of eigenvalue problems involving higher powers of A to a generalized eigenvalue problem is also discussed.
展开▼
