The Combination Shift QZ Algorithm
From MaRDI portal
The Combination Shift $QZ$ Algorithm
Cited in
(18)- 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?
- Calculation of transmission zeros using QZ techniques
- Pattern formation in generalized Turing systems. I: Steady-state patterns in systems with mixed boundary conditions
- Spline-based differential quadrature for fourth order differential equations and its application to Kirchhoff plates
- On a modification of the QZ algorithm with fast Givens rotations
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- Distributed One-Stage Hessenberg-Triangular Reduction with Wavefront Scheduling
- LINEAR STABILITY ANALYSIS GENERALIZED TO A THERMALLY-DRIVEN FLOW
- Generalized subspace iteration method for solving matrix pair eigenproblem
- A rational QZ method
- Data-driven robust linear quadratic regulator: a minimax design using reinforcement learning
- A rank-updating technique for the Kronecker canonical form of singular pencils
- Generalized pseudospectral shattering and inverse-free matrix pencil diagonalization
- The computation of Kronecker's canonical form of a singular pencil
This page was built for publication: The Combination Shift $QZ$ Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4110536)
