Convergence of the unitary QR algorithm with a unimodular Wilkinson shift

DOI10.1090/S0025-5718-02-01444-8MaRDI QIDQ4780377zbMATH OpenFDO

Authors Tai-Lin Wang, W. B. Gragg

Publication date 19 November 2002

Published in Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesglobal convergencenumerical experimentsQR algorithmunitary Hessenberg matricesshift strategyunitary Hessenberg matrixWilkinson shift

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
• Stability properties of several variants of the unitary Hessenberg \(QR\) algorithm
• Convergence of the tridiagonal QR algorithm
• On the convergence of the QR algorithm with multishift
• A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence

Cites work

• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices
• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
• Convergence of the tridiagonal QR algorithm
• Global convergence of tridiagonal QR algorithm with origin shifts
• Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
• The QR algorithm for real Hessenberg matrices
• The QR algorithm for unitary Hessenberg matrices

Cited in

(24)

• Unitary rank structured matrices
• Eigenvalue computation for unitary rank structured matrices
• Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle
• Rational QR-iteration without inversion
• A technique to have a convergence for the QR algorithm
• Sensitivity analysis for Szegő polynomials
• The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure
• A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
• Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
• Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
• On the convergence of the QR algorithm with multishift
• On a QR-Like Algorithm for Some Structured Eigenvalue Problems
• Fast and stable unitary QR algorithm
• The QR algorithm for unitary Hessenberg matrices
• A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices
• On tridiagonal matrices unitarily equivalent to normal matrices
• Stability properties of several variants of the unitary Hessenberg \(QR\) algorithm
• Convergence of the Francis shifted QR algorithm on normal matrices
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• A CS decomposition for orthogonal matrices with application to eigenvalue computation
• scientific article; zbMATH DE number 2217312 (Why is no real title available?)
• On the convergence rate of the QL algorithm with Wilkinson's shift
• Structured Eigenvalue Problems
• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices

This page was built for publication: Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift

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