Implicit QR with compression
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5527834 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A fast QR algorithm for companion matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Implicit double shift \(QR\)-algorithm for companion matrices
- Numerical recipes. The art of scientific computing.
- On the shifted QR iteration applied to companion matrices
- The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments
Cited in
(9)- Fast QR iterations for unitary plus low rank matrices
- Implicit QR for rank-structured matrix pencils
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- A CMV-Based Eigensolver for Companion Matrices
- Fast and Backward Stable Computation of Roots of Polynomials
- Implicit QR for companion-like pencils
- Implicit double shift \(QR\)-algorithm for companion matrices
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Matrix structures in queuing models
This page was built for publication: Implicit QR with compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692576)