Implicit QR with compression
From MaRDI portal
Publication:692576
DOI10.1016/J.INDAG.2012.05.006zbMATH Open1266.65059OpenAlexW1992856421MaRDI QIDQ692576FDOQ692576
Authors: Paola Boito, L. Gemignani, I. Gohberg, Y. Eidelman 
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
Recommendations
algorithmnumerical experimentscompanion matrixpolynomial rootsquasiseparable matricesbackward stabilityeigenvalue computationQR methodHessenberg matrices
Cites Work
- Numerical recipes. The art of scientific computing.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Implicit double shift \(QR\)-algorithm for companion matrices
- On the shifted QR iteration applied to companion matrices
- A fast QR algorithm for companion matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments
Cited In (9)
- Implicit QR for companion-like pencils
- Fast QR iterations for unitary plus low rank matrices
- Implicit double shift \(QR\)-algorithm for companion matrices
- Matrix structures in queuing models
- A CMV-Based Eigensolver for Companion Matrices
- Implicit QR for rank-structured matrix pencils
- Fast and Backward Stable Computation of Roots of Polynomials
- Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil
- Fast computation of eigenvalues of companion, comrade, and related matrices
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)
