A fast implicit QR eigenvalue algorithm for companion matrices

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

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

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

complexity; numerical experiments; companion matrix; eigenvalue computation; \(QR\) iteration; quasiseparable structure

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

65Y20: Complexity and performance of numerical algorithms

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.