On pole-swapping algorithms for the eigenvalue problem
From MaRDI portal
Publication:2218921
Abstract: Pole-swapping algorithms, which are generalizations of the QZ algorithm for the generalized eigenvalue problem, are studied. A new modular (and therefore more flexible) convergence theory that applies to all pole-swapping algorithms is developed. A key component of all such algorithms is a procedure that swaps two adjacent eigenvalues in a triangular pencil. An improved swapping routine is developed, and its superiority over existing methods is demonstrated by a backward error analysis and numerical tests. The modularity of the new convergence theory and the generality of the pole-swapping approach shed new light on bi-directional chasing algorithms, optimally packed shifts, and bulge pencils, and allow the design of novel algorithms.
Recommendations
- Pole-swapping algorithms for alternating and palindromic eigenvalue problems
- On the Schwarz alternating method for eigenvalue problems
- Publication:4489544
- scientific article; zbMATH DE number 3982395
- A stable, polynomial-time algorithm for the eigenpair problem
- scientific article; zbMATH DE number 37916
- An algorithm for solution of large eigenvalue problems
- Eigenvalues and switching algorithms for Quasi-Newton updates
- Polynomial eigenvalue problems: theory, computation, and structure
Cites work
- scientific article; zbMATH DE number 5734462 (Why is no real title available?)
- scientific article; zbMATH DE number 1097561 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Generalized Eigenvalue Approach for Solving Riccati Equations
- A Hamiltonian $QR$ Algorithm
- A novel parallel QR algorithm for hybrid distributed memory HPC systems
- A rational QZ method
- Accuracy and Stability of Numerical Algorithms
- An Algorithm for Generalized Matrix Eigenvalue Problems
- An extension of the \(QZ\) algorithm beyond the Hessenberg-upper triangular pencil
- Bulge Exchanges in Algorithms of QR Type
- Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
- Core-Chasing Algorithms for the Eigenvalue Problem
- Fast and Backward Stable Computation of Roots of Polynomials
- Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- Forward Stability and Transmission of Shifts in the $QR$ Algorithm
- Francis’s Algorithm
- Generalized Rational Krylov Decompositions with an Application to Rational Approximation
- Implicit QR algorithms for palindromic and even eigenvalue problems
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
- On swapping diagonal blocks in real Schur form
- Optimally packed chains of bulges in multishift QR algorithms
- The Matrix Eigenvalue Problem
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The multishift QR algorithm. I: Maintaining well-focused shifts and level 3 performance
- The multishift QR algorithm. II: Aggressive early deflation
- The transmission of shifts and shift blurring in the QR algorithm
- Using Level 3 BLAS in Rotation-Based Algorithms
Cited in
(4)- A multishift, multipole rational QZ method with aggressive early deflation
- Changing poles in the rational Lanczos method for the Hermitian eigenvalue problem
- Pole-swapping algorithms for alternating and palindromic eigenvalue problems
- Generation of orthogonal rational functions by procedures for structured matrices
This page was built for publication: On pole-swapping algorithms for the eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218921)
