The shifted QR algorithm for Hermitian matrices

DOI10.1016/0024-3795(71)90035-8zbMath0214.41005OpenAlexW2011136835MaRDI QIDQ2545456

J. F. Traub, T. J. Dekker

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/0024-3795(71)90035-8

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Numerical linear algebra (65F99)

Related Items

Singular value decompositions of complex symmetric matrices, Polynomial root computation by means of the LR algorithm, Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time, Computational methods of linear algebra, Schur parameter pencils for the solution of the unitary eigenproblem, An analysis of the shifted LR algorithm, Presentation geométrique des méthodes de calcul des valeurs propres, Convergence of the tridiagonal \(QR\) algorithm, Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices

Cites Work

• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• Global convergence of tridiagonal QR algorithm with origin shifts
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item