A CMV-Based Eigensolver for Companion Matrices
From MaRDI portal
(Redirected from Publication:5502142)
Abstract: In this paper we present a novel matrix method for polynomial rootfinding. By exploiting the properties of the QR eigenvalue algorithm applied to a suitable CMV-like form of a companion matrix we design a fast and computationally simple structured QR iteration.
Recommendations
- Fast computation of eigenvalues of companion, comrade, and related matrices
- On an oblique projection method for solving the eigenvalue problem of the companion matrix
- An algorithm for computing the eigenvalues of block companion matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- scientific article; zbMATH DE number 5864487
- On an enumerative algorithm for solving eigenvalue complementarity problems
- Companion matrices and joint eigenvectors of commuting families of matrices for polynomial zero finding
- Numerical solution of eigenvalue problems using the compound matrix method
- Compatible discretizations for eigenvalue problems
- Compound matrix method for eigenvalue problems in multiple connected domains
Cites work
- A fast implicit QR eigenvalue algorithm for companion matrices
- A fast QR algorithm for companion matrices
- An algorithm for computing the eigenvalues of block companion matrices
- An implicit multishift QR-algorithm for Hermitian plus low rank matrices
- Backward stability of polynomial root-finding using Fiedler companion matrices
- Chasing bulges or rotations? A metamorphosis of the QR-algorithm
- CMV: The unitary analogue of Jacobi matrices
- Completing a matrix when certain entries of its inverse are specified
- Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
- Differential qd algorithm with shifts for rank-structured matrices
- Effective fast algorithms for polynomial spectral factorization
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Fast computation of the zeros of a polynomial via factorization of the companion matrix
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Implicit double shift \(QR\)-algorithm for companion matrices
- Implicit QR for companion-like pencils
- Implicit QR with compression
- Matrix computations and semiseparable matrices. Vol. 1: Linear systems.
- Matrix shapes invariant under the symmetric QR algorithm
- Minimal representations of unitary operators and orthogonal polynomials on the unit circle
- Numerical methods for roots of polynomials. Part I
- On Smooth Decompositions of Matrices
- On the shifted QR iteration applied to companion matrices
- Principles for Testing Polynomial Zerofinding Programs
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Rank structures preserved by the QR-algorithm: the singular case
- Schur parameter pencils for the solution of the unitary eigenproblem
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- Solving a Polynomial Equation: Some History and Recent Progress
- Staircase Matrices and Systems
- The QR algorithm for unitary Hessenberg matrices
- The uniqueness in the inverse problem for transmission eigenvalues for the spherically symmetric variable-speed wave equation
- The unitary completion and QR iterations for a class of structured matrices
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method
Cited in
(14)- A real QZ algorithm for structured companion pencils
- On the shifted QR iteration applied to companion matrices
- An algorithm for computing the eigenvalues of block companion matrices
- Sampling the eigenvalues of random orthogonal and unitary matrices
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices
- On the stability of computing polynomial roots via confederate linearizations
- Factoring block Fiedler companion matrices
- Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
- An iterative method for diagonalization of the Frobenius companion matrix
- Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
- Fast and Backward Stable Computation of Roots of Polynomials
- Fast Hessenberg reduction of some rank structured matrices
- A factorization of the inverse of the shifted companion matrix
- Pentadiagonal companion matrices
This page was built for publication: A CMV-Based Eigensolver for Companion Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502142)
