The Combination Shift $QZ$ Algorithm
暂无分享,去创建一个
An extension of the $QZ$ algorithm, called the combination shift $QZ$ algorithm, is presented for solving the generalized matrix eigenvalue problem $Ax = \lambda Bx$ with real square matrices A and B. Features and properties of the various $QR$-type algorithms which were not practical or possible to implement in the $QZ$ algorithm are generalized and implemented in this new algorithm. The emergence of infinite eigenvalues under exact arithmetic is discussed in detail. Results of numerous test cases are presented to give practical application tests and comparisons for the algorithm.
[1] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .
[2] G. Peters,et al. $Ax = \lambda Bx$ and the Generalized Eigenproblem , 1970 .
[3] G. Stewart,et al. An Algorithm for Generalized Matrix Eigenvalue Problems. , 1973 .
[4] Robert C. Ward. A numerical solution to the generalized eigenvalue problem , 1973 .
[5] Charles Francis Van Loan. Generalized singular values with algorithms and applications. , 1973 .