A fast implicit QR eigenvalue algorithm for companion matrices
From MaRDI portal
Recommendations
- A fast QR algorithm for companion matrices
- Implicit double shift \(QR\)-algorithm for companion matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Fast computation of eigenvalues of companion, comrade, and related matrices
- On the shifted QR iteration applied to companion matrices
- \(QR\)-like algorithms for eigenvalue problems
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- An implicit QR algorithm for symmetric semiseparable matrices
- The restarted QR-algorithm for eigenvalue computation of structured matrices
- QR -like algorithms for the nonsymmetric eigenvalue problem
Cites work
- scientific article; zbMATH DE number 1805736 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A fast QR algorithm for companion matrices
- A practical guide to splines.
- An Efficient QR Algorithm for a Hessenberg Submatrix of a Unitary Matrix
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- 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
- Numerical recipes. The art of scientific computing.
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
- Principles for Testing Polynomial Zerofinding Programs
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- The unitary completion and QR iterations for a class of structured matrices
Cited in
(27)- Implicit QR for rank-structured matrix pencils
- On the stability of some hierarchical rank structured matrix algorithms
- A fast QR algorithm for companion matrices
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
- A real QZ algorithm for structured companion pencils
- Data driven Koopman spectral analysis in Vandermonde-Cauchy form via the DFT: numerical method and theoretical insights
- An algorithm for computing the eigenvalues of block companion matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Pentadiagonal companion matrices
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- Fast fixed-time synchronization control analysis for a class of coupled delayed Cohen-Grossberg neural networks
- On an oblique projection method for solving the eigenvalue problem of the companion matrix
- Rank-Structured QR for Chebyshev Rootfinding
- New progress in real and complex polynomial root-finding
- Structured eigenvalue condition numbers for parameterized quasiseparable 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
- Factoring block Fiedler companion matrices
- Implicit QR for companion-like pencils
- On the efficient global dynamics of Newton’s method for complex polynomials
- Implicit double shift \(QR\)-algorithm for companion matrices
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Implicit QR with compression
- The QR Algorithm Revisited
This page was built for publication: A fast implicit QR eigenvalue algorithm for companion matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848584)
