On pole-swapping algorithms for the eigenvalue problem

DOI10.1553/etna_vol52s480zbMath1456.65025arXiv1906.08672OpenAlexW3134096121MaRDI QIDQ2218921

Thomas Mach, Raf Vandebril, Daan Camps, David S. Watkins

Publication date: 18 January 2021

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.08672

zbMATH Keywords

convergence analysisgeneralized eigenvalue problempole swapping algorithms

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Generation of orthogonal rational functions by procedures for structured matrices ⋮ A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implicit QR algorithms for palindromic and even eigenvalue problems
• On swapping diagonal blocks in real Schur form
• Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
• The transmission of shifts and shift blurring in the QR algorithm
• An extension of the \(QZ\) algorithm beyond the Hessenberg-upper triangular pencil
• The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 Performance
• The Multishift QR Algorithm. Part II: Aggressive Early Deflation
• A Novel Parallel QR Algorithm for Hybrid Distributed Memory HPC Systems
• Francis’s Algorithm
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• A Hamiltonian $QR$ Algorithm
• A Generalized Eigenvalue Approach for Solving Riccati Equations
• Bulge Exchanges in Algorithms of QR Type
• LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
• Using Level 3 BLAS in Rotation-Based Algorithms
• Core-Chasing Algorithms for the Eigenvalue Problem
• Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil
• Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
• Accuracy and Stability of Numerical Algorithms
• Forward Stability and Transmission of Shifts in the $QR$ Algorithm
• A Rational QZ Method
• Generalized Rational Krylov Decompositions with an Application to Rational Approximation
• Fast and Backward Stable Computation of Roots of Polynomials
• The Matrix Eigenvalue Problem
• Optimally packed chains of bulges in multishift QR algorithms
• An Algorithm for Generalized Matrix Eigenvalue Problems