A fast QR algorithm for companion matrices
From MaRDI portal
Recommendations
- A fast implicit QR eigenvalue algorithm for companion matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- A real QZ algorithm for structured companion pencils
- Fast and Backward Stable Computation of Roots of Polynomials
- On the shifted QR iteration applied to companion matrices
Cited in
(33)- Orthogonal Laurent polynomials on the unit circle and snake-shaped matrix factorizations
- On the shifted QR iteration applied to companion matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- On a modification of the QZ algorithm with fast Givens rotations
- An algorithm for computing the eigenvalues of block companion matrices
- Orthogonal iterations on companion-like pencils
- Fast QR iterations for unitary plus low rank matrices
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Computations with quasiseparable polynomials and matrices
- Trigonometric orthogonal systems and quadrature formulae
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Implicit QR for rank-structured matrix pencils
- Neville elimination for rank-structured matrices
- Unitary rank structured matrices
- Implicit QR for companion-like pencils
- On the description and stability of orthogonal transformations of rank structured matrices
- Chasing bulges or rotations? A metamorphosis of the QR-algorithm
- QR-Like Algorithms for Symmetric Arrow Matrices
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- A fast contour-integral eigensolver for non-Hermitian matrices
- Differential qd algorithm with shifts for rank-structured matrices
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Fast and Backward Stable Computation of Roots of Polynomials
- A CMV-Based Eigensolver for Companion Matrices
- A unification of unitary similarity transforms to compressed representations
- Implicit QR with compression
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- Pentadiagonal companion matrices
- On structure-oriented hybrid two-stage iteration methods for the large and sparse blocked system of linear equations
- Implicit double shift \(QR\)-algorithm for companion matrices
This page was built for publication: A fast QR algorithm for companion matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448146)
