A CMV-Based Eigensolver for Companion Matrices
From MaRDI portal
Publication:5502142
DOI10.1137/140978065zbMath1321.65076arXiv1406.2820OpenAlexW1569795718MaRDI QIDQ5502142
Gianna M. Del Corso, Roberto Bevilacqua, Luca Gemignani
Publication date: 17 August 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.2820
complexityaccuracycompanion matrixnumerical experimentmatrix methodCMV matrixrank structurepolynomial rootfindingQR eigenvalue algorithmblock upper Hessenberg
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of roots of polynomial equations (65H04)
Related Items (8)
Eigenvalue condition numbers and pseudospectra of Fiedler matrices ⋮ Pentadiagonal companion matrices ⋮ Factoring Block Fiedler Companion Matrices ⋮ Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form ⋮ Sampling the eigenvalues of random orthogonal and unitary matrices ⋮ On the stability of computing polynomial roots via confederate linearizations ⋮ Fast and Backward Stable Computation of Roots of Polynomials ⋮ Fast Hessenberg Reduction of Some Rank Structured Matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method
- Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
- Implicit QR with compression
- Rank structures preserved by the \(QR\)-algorithm: the singular case
- A fast implicit QR eigenvalue algorithm for companion matrices
- Numerical methods for roots of polynomials. Part I
- Implicit double shift \(QR\)-algorithm for companion matrices
- Completing a matrix when certain entries of its inverse are specified
- The QR algorithm for unitary Hessenberg matrices
- Schur parameter pencils for the solution of the unitary eigenproblem
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Effective fast algorithms for polynomial spectral factorization
- On the shifted QR iteration applied to companion matrices
- Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
- An algorithm for computing the eigenvalues of block companion matrices
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- Minimal representations of unitary operators and orthogonal polynomials on the unit circle
- Backward stability of polynomial root-finding using Fiedler companion matrices
- Implicit QR for companion-like pencils
- An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices
- Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm
- The uniqueness in the inverse problem for transmission eigenvalues for the spherically symmetric variable-speed wave equation
- Staircase Matrices and Systems
- Principles for Testing Polynomial Zerofinding Programs
- On Smooth Decompositions of Matrices
- Solving a Polynomial Equation: Some History and Recent Progress
- Matrix shapes invariant under the symmetric QR algorithm
- Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix
- Differential qd Algorithm with Shifts for Rank-Structured Matrices
- CMV: The unitary analogue of Jacobi matrices
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- The unitary completion and QR iterations for a class of structured matrices
This page was built for publication: A CMV-Based Eigensolver for Companion Matrices
