Implicit double shift QR-algorithm for companion matrices

DOI10.1007/S00211-010-0302-YMaRDI QIDQ993375zbMATHOpenAlexFDO

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

zbMATH Keywords

eigenvaluesnumerical examplesimplicit algorithmHessenberg matricescomparison matricesGivens transformationsfellow matricesimplicit (double) shifted \(QR\)-methodrank 1 matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• A fast implicit QR eigenvalue algorithm for companion matrices
• Fast computation of eigenvalues of companion, comrade, and related matrices
• Implicit QR with compression
• A fast QR algorithm for companion matrices
• Implicit QR for companion-like pencils

Cites work

• scientific article; zbMATH DE number 5527834 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A QR-Based Solver for Rank Structured Matrices
• A bibliography on semiseparable matrices
• A fast QR algorithm for companion 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
• An algorithm for computing the eigenvalues of block companion matrices
• An implicit QR algorithm for symmetric semiseparable matrices
• Completing a matrix when certain entries of its inverse are specified
• Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• On a new class of structured matrices
• On computing givens rotations reliably and efficiently
• On the shifted QR iteration applied to companion matrices
• Polynomial Roots from Companion Matrix Eigenvalues
• Rank structures preserved by the \(QR\)-algorithm: the singular case
• The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order

Cited in

(21)

• Implicit QR for rank-structured matrix pencils
• SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
• The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
• On the shifted QR iteration applied to companion matrices
• An algorithm for computing the eigenvalues of block companion matrices
• A fitting algorithm for real coefficient polynomial rooting
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• A fast implicit QR eigenvalue algorithm for companion matrices
• Structured eigenvalue condition numbers for parameterized quasiseparable matrices
• scientific article; zbMATH DE number 4001318 (Why is no real title available?)
• A fast contour-integral eigensolver for non-Hermitian matrices
• A CMV-Based Eigensolver for Companion Matrices
• Fast and Backward Stable Computation of Roots of Polynomials
• A unification of unitary similarity transforms to compressed representations
• Chasing bulges or rotations? A metamorphosis of the QR-algorithm
• On the description and stability of orthogonal transformations of rank structured matrices
• Fast computation of eigenvalues of companion, comrade, and related matrices
• Implicit QR with compression
• Semi-analytical solutions for eigenvalue problems of chains and periodic graphs
• Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle

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)