The shifted QR algorithm for Hermitian matrices
From MaRDI portal
Cites work
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
- Global convergence of tridiagonal QR algorithm with origin shifts
- scientific article; zbMATH DE number 3251042 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
Cited in
(11)- Singular value decompositions of complex symmetric matrices
- Computational methods of linear algebra
- Schur parameter pencils for the solution of the unitary eigenproblem
- Polynomial root computation by means of the LR algorithm
- Convergence of the tridiagonal QR algorithm
- An analysis of the shifted LR algorithm
- Presentation geométrique des méthodes de calcul des valeurs propres
- Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- Global convergence of Hessenberg shifted QR. I: Exact arithmetic
- Deterministic complexity analysis of Hermitian eigenproblems
This page was built for publication: The shifted QR algorithm for Hermitian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545456)