Implicit double shift QR-algorithm for companion matrices
DOI10.1007/S00211-010-0302-YzbMATH Open1196.65076OpenAlexW2133549820MaRDI QIDQ993375FDOQ993375
Authors: Raf Vandebril, Katrijn Frederix, Marc van Barel, Paul van Dooren 
Publication date: 10 September 2010
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-010-0302-y
Recommendations
eigenvaluesnumerical examplesimplicit algorithmHessenberg matricescomparison matricesGivens transformationsfellow matricesimplicit (double) shifted \(QR\)-methodrank 1 matrix
Cites Work
- Title not available (Why is that?)
- An algorithm for computing the eigenvalues of block companion matrices
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- An implicit QR algorithm for symmetric semiseparable matrices
- Title not available (Why is that?)
- Polynomial Roots from Companion Matrix Eigenvalues
- On a new class of structured matrices
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Rank structures preserved by the \(QR\)-algorithm: the singular case
- On computing givens rotations reliably and efficiently
- Completing a matrix when certain entries of its inverse are specified
- On the shifted QR iteration applied to companion matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- A fast QR algorithm for companion matrices
- A bibliography on semiseparable matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- A note on the representation and definition of semiseparable matrices
- A parallel QR-factorization/solver of quasiseparable matrices
- A QR-Based Solver for Rank Structured Matrices
Cited In (20)
- A unification of unitary similarity transforms to compressed representations
- Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle
- Implicit QR with compression
- A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Title not available (Why is that?)
- A fitting algorithm for real coefficient polynomial rooting
- A fast implicit QR eigenvalue algorithm for companion matrices
- Semi-analytical solutions for eigenvalue problems of chains and periodic graphs
- On the shifted QR iteration applied to companion matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
- An algorithm for computing the eigenvalues of block companion matrices
- A CMV-Based Eigensolver for Companion Matrices
- Implicit QR for rank-structured matrix pencils
- SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices
- On the description and stability of orthogonal transformations of rank structured matrices
- Fast and Backward Stable Computation of Roots of Polynomials
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices
This page was built for publication: Implicit double shift \(QR\)-algorithm for companion matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993375)
