On the shifted QR iteration applied to companion matrices
From MaRDI portal
Publication:1772057
zbMath1066.65039MaRDI QIDQ1772057
Francesco Daddi, Luca Gemignani, Dario Andrea Bini
Publication date: 15 April 2005
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/124864
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)
Related Items
Rank structures preserved by the \(QR\)-algorithm: the singular case ⋮ A method for computing the number of iterations in data dependent loops ⋮ On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms ⋮ An algorithm for computing the eigenvalues of block companion matrices ⋮ Efficient polynomial root-refiners: a survey and new record efficiency estimates ⋮ Pentadiagonal companion matrices ⋮ Block tridiagonal reduction of perturbed normal and rank structured matrices ⋮ Neville elimination for rank-structured matrices ⋮ Rational \(QR\)-iteration without inversion ⋮ Implicit QR with compression ⋮ Unitary rank structured matrices ⋮ The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order ⋮ The unitary completion and QR iterations for a class of structured matrices ⋮ Transformations to rank structures by unitary similarity ⋮ Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations ⋮ Implicit double shift \(QR\)-algorithm for companion matrices ⋮ Fast QR iterations for unitary plus low rank matrices ⋮ A multiple shift \(QR\)-step for structured rank matrices ⋮ A CMV-Based Eigensolver for Companion Matrices ⋮ Rank-Structured QR for Chebyshev Rootfinding ⋮ Structures preserved by the QR-algorithm ⋮ Fast and Backward Stable Computation of Roots of Polynomials
