The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 Performance

DOI10.1137/S0895479801384573zbMath1017.65031MaRDI QIDQ2784389

Roy Mathias, Ralph Byers, Karen Braman

Publication date: 23 April 2002

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

BLASbasic linear algebra subprogramsimplicit shiftsmultishift QR algorithmnon Hermitian eigenvalue problems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Packaged methods for numerical algorithms (65Y15)

Related Items (27)

Hessenberg eigenvalue--eigenmatrix relations ⋮ Algorithm 1019: A Task-based Multi-shift QR/QZ Algorithm with Aggressive Early Deflation ⋮ An extended Hamiltonian QR algorithm ⋮ Iterative refinement of Schur decompositions ⋮ Iterative optimal solutions of linear matrix equations for hyperspectral and multispectral image fusing ⋮ Probabilistic Rounding Error Analysis of Householder QR Factorization ⋮ Deflating invariant subspaces for rank structured pencils ⋮ A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence ⋮ Computer simulation of electron energy state spin-splitting in nanoscale LnAs/GaAs semiconductor quantum rings ⋮ Ralph Byers 1955--2007 ⋮ On pole-swapping algorithms for the eigenvalue problem ⋮ Algorithm 953 ⋮ Optimization of the Multishift QR Algorithm with Coprocessors for Non-Hermitian Eigenvalue Problems ⋮ Unnamed Item ⋮ Blocked algorithms for the reduction to Hessenberg-triangular form revisited ⋮ Linear algebra software for large-scale accelerated multicore computing ⋮ Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance ⋮ Perturbation in eigenvalues of a symmetric tridiagonal matrix ⋮ Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures ⋮ A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Structured Eigenvalue Problems ⋮ Implicit QR algorithms for palindromic and even eigenvalue problems ⋮ A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation ⋮ Optimally packed chains of bulges in multishift QR algorithms ⋮ Rank-Structured QR for Chebyshev Rootfinding ⋮ \(QR\)-like algorithms for eigenvalue problems

This page was built for publication: The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 Performance