Implicit QR with compression

DOI10.1016/j.indag.2012.05.006zbMath1266.65059OpenAlexW1992856421MaRDI QIDQ692576

Luca Gemignani, Israel Gohberg, Paola Boito, Yu.S.Eidel'man

Publication date: 6 December 2012

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.indag.2012.05.006

zbMATH Keywords

algorithmnumerical experimentscompanion matrixQR methodpolynomial rootsquasiseparable matricesbackward stabilityeigenvalue computationHessenberg matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (7)

Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil ⋮ Matrix Structures in Queuing Models ⋮ Fast computation of eigenvalues of companion, comrade, and related matrices ⋮ Implicit QR for rank-structured matrix pencils ⋮ Fast QR iterations for unitary plus low rank matrices ⋮ A CMV-Based Eigensolver for Companion Matrices ⋮ Fast and Backward Stable Computation of Roots of Polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast implicit QR eigenvalue algorithm for companion matrices
• Implicit double shift \(QR\)-algorithm for companion matrices
• On the shifted QR iteration applied to companion matrices
• Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
• The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments

This page was built for publication: Implicit QR with compression