The Combination Shift $QZ$ Algorithm

DOI10.1137/0712062zbMath0342.65022OpenAlexW75732186MaRDI QIDQ4110536

Robert C. Ward

Publication date: 1975

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0712062

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (15)

Generalized subspace iteration method for solving matrix pair eigenproblem ⋮ Pattern formation in generalized Turing systems. I: Steady-state patterns in systems with mixed boundary conditions ⋮ The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\) ⋮ The computation of the Kronecker canonical form of an arbitrary symmetric pencil ⋮ Where is the nearest non-regular pencil? ⋮ Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil ⋮ Distributed One-Stage Hessenberg-Triangular Reduction with Wavefront Scheduling ⋮ Spline-based differential quadrature for fourth order differential equations and its application to Kirchhoff plates ⋮ LINEAR STABILITY ANALYSIS GENERALIZED TO A THERMALLY-DRIVEN FLOW ⋮ Calculation of transmission zeros using QZ techniques ⋮ Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations ⋮ The computation of Kronecker's canonical form of a singular pencil ⋮ On a modification of the QZ algorithm with fast Givens rotations ⋮ A Rational QZ Method ⋮ The eigenstructure of an arbitrary polynomial matrix: Computational aspects

This page was built for publication: The Combination Shift $QZ$ Algorithm