Performance of the QZ algorithm in the presence of infinite eigenvalues
The paper is inspired by the fact that the generalized eigenvalue problem can have infinite eigenvalues and that they can be dealt with by the QZ (i.e., generalized QR) algorithm [cf. \textit{C. B. Moler} and \textit{G. W. Stewart}, SIAM J. Numer. Anal. 10, 214-256 (1973; Zbl 0225.65046)]. An explanation of the latter ``paradox is provided and found in the mechanism of the transmission of implicit shifts which pushes the infinite eigenvalues towards the top of the pencil. The same explanation applies also to the preliminary Hessenberg + triangular reduction of the pencil and is in fact a next-step development of the author's older results, viz., papers concerning the regular QR algorithm [J. Linear Algebra Appl. 241-243, 877-896 (1996; Zbl 0871.65027); SIAM J. Matrix Anal. Appl. 19, No. 4, 1074-1096 (1998; Zbl 0916.65034)]. As long as the key theorems are just presented in the absence of roundoff errors, an inseparable part of the argument lies in the numerical experiments performed using MATLAB in double precision arithmetics. In particular, two tables illustrate the necessity of avoiding the theoretical zerodivide, i.e., the obligatory deflation of the infinite eigenvalues once they get at the top of the pencil.
- Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
- A parallel QZ algorithm for distributed memory HPC systems
- Removal of infinite eigenvalues in the generalized matrix eigenvalue problem
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- A rational QZ method
- Numerical solution and perturbation theory for generalized Lyapunov equations
- A one-dimensional full-range two-phase model to efficiently compute bifurcation diagrams in sub-cooled boiling flows in vertical heated tube
- On the infinite-dimensional QR algorithm
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- A Householder-Based Algorithm for Hessenberg-Triangular Reduction
- An Algorithm for the Complete Solution of the Quartic Eigenvalue Problem
- On QZ steps with perfect shifts and computing the index of a differential-algebraic equation
- A rational QZ method
- Algorithms for Hessenberg-triangular reduction of Fiedler linearization of matrix polynomials
- Removal of infinite eigenvalues in the generalized matrix eigenvalue problem
- Generalized pseudospectral shattering and inverse-free matrix pencil diagonalization
- Trimmed linearizations for structured matrix polynomials
This page was built for publication: Performance of the QZ algorithm in the presence of infinite eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706262)
