On a modification of the QZ algorithm with fast Givens rotations

DOI10.1007/BF02240099zbMath0613.65033OpenAlexW429641120MaRDI QIDQ1819540

H. P. Märchy

Publication date: 1987

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02240099

zbMATH Keywords

scalingrounding errorQZ algorithmHouseholder reflectionsfast Givens rotationsFQZ algorithmgeneralized unsymmetric algebraic eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)

Related Items

Blocked algorithms for the reduction to Hessenberg-triangular form revisited, Large-scale complex eigenvalue problems

Uses Software

• IMSL Numerical Libraries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast givens rotations for orthogonal similarity transformations
• The Combination Shift $QZ$ Algorithm
• Some Thoughts on the QZ Algorithm for Solving the Generalized Eigenvalue Problem
• Least Squares Computations by Givens Transformations Without Square Roots
• An Algorithm for Generalized Matrix Eigenvalue Problems