Performance of the QZ Algorithm in the Presence of Infinite Eigenvalues
From MaRDI portal
Publication:2706262
DOI10.1137/S0895479899360376zbMath0969.65029MaRDI QIDQ2706262
Publication date: 19 March 2001
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
numerical experimentsmatrix pencilQR algorithminfinite eigenvalueseigenvalue computationQZ algorithmeneralized eigenvalue problem
Related Items (8)
An Algorithm for the Complete Solution of the Quartic Eigenvalue Problem ⋮ Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil ⋮ A Householder-Based Algorithm for Hessenberg-Triangular Reduction ⋮ A one-dimensional full-range two-phase model to efficiently compute bifurcation diagrams in sub-cooled boiling flows in vertical heated tube ⋮ Trimmed linearizations for structured matrix polynomials ⋮ A Rational QZ Method ⋮ Algorithms for Hessenberg-Triangular Reduction of Fiedler Linearization of Matrix Polynomials ⋮ Numerical solution and perturbation theory for generalized Lyapunov equations
Uses Software
This page was built for publication: Performance of the QZ Algorithm in the Presence of Infinite Eigenvalues
