Implicit double shift \(QR\)-algorithm for companion matrices
From MaRDI portal
Publication:993375
DOI10.1007/s00211-010-0302-yzbMath1196.65076MaRDI QIDQ993375
Katrijn Frederix, Raf Vandebril, Paul Van Dooren, Marc Van Barel
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
numerical examples; eigenvalues; implicit algorithm; Hessenberg matrices; comparison matrices; Givens transformations; fellow matrices; implicit (double) shifted \(QR\)-method; rank 1 matrix
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
A Fast Contour-Integral Eigensolver for Non-Hermitian 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, Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle, Efficient polynomial root-refiners: a survey and new record efficiency estimates, A fitting algorithm for real coefficient polynomial rooting, A unification of unitary similarity transforms to compressed representations, Implicit QR with compression, Structured eigenvalue condition numbers for parameterized quasiseparable matrices, An algorithm for computing the eigenvalues of block companion matrices, Semi-analytical solutions for eigenvalue problems of chains and periodic graphs, Fast computation of eigenvalues of companion, comrade, and related matrices, Implicit QR for rank-structured matrix pencils, On the Description and Stability of Orthogonal Transformations of Rank Structured Matrices, The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rank structures preserved by the \(QR\)-algorithm: the singular case
- A parallel QR-factorization/solver of quasiseparable matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- Completing a matrix when certain entries of its inverse are specified
- On a new class of structured matrices
- On the shifted QR iteration applied to companion matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- 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
- A note on the representation and definition of semiseparable matrices
- A QR-Based Solver for Rank Structured Matrices
- Polynomial Roots from Companion Matrix Eigenvalues
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- On computing givens rotations reliably and efficiently
- A bibliography on semiseparable matrices
