The restarted QR-algorithm for eigenvalue computation of structured matrices

DOI10.1016/S0377-0427(02)00486-7MaRDI QIDQ1860504zbMATH OpenFDO

Authors Sun-Mi Kim, Daniela Calvetti, Lothar Reichel

Publication date 23 February 2003

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesHessenberg matrixstructured matricesperformance of algorithmrestarted QR-algorithm

Mathematics Subject Classification ID

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

Recommendations

• The periodic QR algorithm is a disguised QR algorithm
• Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
• Eigenvalue computation for unitary rank structured matrices
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order

Cites work

• scientific article; zbMATH DE number 3988038 (Why is no real title available?)
• scientific article; zbMATH DE number 1329131 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A divide and conquer method for unitary and orthogonal eigenproblems
• An implementation of a divide and conquer algorithm for the unitary eigen problem
• Continuation methods for the computation of zeros of Szegő polynomials
• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
• Notes on TQR algorithms
• On a class of Gauss-like quadrature rules
• Polynomial zerofinders based on Szegő polynomials
• Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
• The QR algorithm for unitary Hessenberg matrices

Cited in

(8)

• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• A Truncated RQ Iteration for Large Scale Eigenvalue Calculations
• A fast implicit QR eigenvalue algorithm for companion matrices
• \(QR\)-like algorithms for eigenvalue problems
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• The unitary completion and QR iterations for a class of structured matrices
• An extended QR-solver for large profiled matrices
• The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order

Describes a project that uses

Uses Software

• GAUSSIAN
• UDC

This page was built for publication: The restarted QR-algorithm for eigenvalue computation of structured matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860504)