The multishift QR algorithm. II: Aggressive early deflation
[For part I see ibid. 23, No. 4, 929-947 (2002; reviewed above).]NEWLINENEWLINENEWLINEfIn this second part, the authors enhance the performance of the multishift \(QR\) algorithm by adopting an aggressive early deflation, which takes advantage of matrix perturbations outside the subdiagonal entries of the Hessenberg \(QR\) iterates. It identifies and deflates the converged eigenvalues long before the classical small-subdiagonal strategy would and is particularly effective in combination with the small bulge multishift \(QR\) algorithm. This maintains a high rate of execution of floating point operations while significantly reducing the number of operations required.
- The Effect of Aggressive Early Deflation on the Convergence of the QR Algorithm
- Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
- A multishift QR iteration without computation of the shifts
- Forward Stability and Transmission of Shifts in the QR Algorithm
- Algorithm 953: Parallel library software for the multishift QR algorithm with aggressive early deflation
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Deflation in Krylov subspace methods and distance to uncontrollability
- An extended Hamiltonian QR algorithm
- Perturbation in eigenvalues of a symmetric tridiagonal matrix
- On pole-swapping algorithms for the eigenvalue problem
- Hessenberg eigenvalue--eigenmatrix relations
- Iterative refinement of Schur decompositions
- Algorithm 953: Parallel library software for the multishift QR algorithm with aggressive early deflation
- On deflations in extended QR algorithms
- Structured Eigenvalue Problems
- The Effect of Aggressive Early Deflation on the Convergence of the QR Algorithm
- scientific article; zbMATH DE number 741158 (Why is no real title available?)
- A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
- A Householder-Based Algorithm for Hessenberg-Triangular Reduction
- Computer simulation of electron energy state spin-splitting in nanoscale LnAs/GaAs semiconductor quantum rings
- Communication lower bounds and optimal algorithms for numerical linear algebra
- A multishift, multipole rational QZ method with aggressive early deflation
- Rank-Structured QR for Chebyshev Rootfinding
- scientific article; zbMATH DE number 7640509 (Why is no real title available?)
- Algorithm 1019: A Task-based Multi-shift QR/QZ Algorithm with Aggressive Early Deflation
- A symmetric structure-preserving {\(\Gamma\)}QR algorithm for linear response eigenvalue problems
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
- Optimally packed chains of bulges in multishift QR algorithms
- Linear algebra software for large-scale accelerated multicore computing
- Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
- Iterative optimal solutions of linear matrix equations for hyperspectral and multispectral image fusing
- Probabilistic Rounding Error Analysis of Householder QR Factorization
- Accelerating Computation of Eigenvectors in the Dense Nonsymmetric Eigenvalue Problem
- Eigenvalue perturbation bounds for Hermitian block tridiagonal matrices
- Global convergence of Hessenberg shifted QR. I: Exact arithmetic
- Global convergence of Hessenberg shifted QR. II: Finite arithmetic
- An iterative method for single and vertically stacked semiconductor quantum dots simulation
- Ralph Byers 1955--2007
This page was built for publication: The multishift QR algorithm. II: Aggressive early deflation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784390)
