A fast implicit QR eigenvalue algorithm for companion matrices

DOI10.1016/j.laa.2009.08.003zbMath1188.65039OpenAlexW2101150179MaRDI QIDQ848584

Israel Gohberg, Yu.S.Eidel'man, Luca Gemignani, Dario Andrea Bini, Paola Boito

Publication date: 4 March 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: http://eprints.adm.unipi.it/664/1/impqrnew1.pdf

zbMATH Keywords

complexitynumerical experimentscompanion matrixeigenvalue computation\(QR\) iterationquasiseparable structure

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)

Related Items

Fast fixed-time synchronization control analysis for a class of coupled delayed Cohen-Grossberg neural networks, Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil, Efficient polynomial root-refiners: a survey and new record efficiency estimates, Pentadiagonal companion matrices, A unification of unitary similarity transforms to compressed representations, Fast computation of eigenvalues of companion, comrade, and related matrices, Implicit QR for rank-structured matrix pencils, Factoring Block Fiedler Companion Matrices, Implicit QR with compression, New progress in real and complex polynomial root-finding, Implicit double shift \(QR\)-algorithm for companion matrices, Structured eigenvalue condition numbers for parameterized quasiseparable matrices, On the Stability of Some Hierarchical Rank Structured Matrix Algorithms, Data Driven Koopman Spectral Analysis in Vandermonde--Cauchy Form via the DFT: Numerical Method and Theoretical Insights, A CMV-Based Eigensolver for Companion Matrices, The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs, Rank-Structured QR for Chebyshev Rootfinding, Fast and Backward Stable Computation of Roots of Polynomials, On the efficient global dynamics of Newton’s method for complex polynomials

Uses Software

• LAPACK
• JDQR
• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
• The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
• An Efficient QR Algorithm for a Hessenberg Submatrix of a Unitary Matrix
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Principles for Testing Polynomial Zerofinding Programs
• 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
• A practical guide to splines.