A Rational QZ Method
From MaRDI portal
Publication:5232124
DOI10.1137/18M1170480zbMath1420.65044arXiv1802.04094OpenAlexW2963009163WikidataQ127394544 ScholiaQ127394544MaRDI QIDQ5232124
Daan Camps, Karl Meerbergen, Raf Vandebril
Publication date: 29 August 2019
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.04094
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (9)
An implicit filter for rational Krylov using core transformations ⋮ Rational QZ steps with perfect shifts ⋮ On pole-swapping algorithms for the eigenvalue problem ⋮ Swapping \(2 \times 2\) blocks in the Schur and generalized Schur form ⋮ Unnamed Item ⋮ Pole-swapping algorithms for alternating and palindromic eigenvalue problems ⋮ Generation of orthogonal rational functions by procedures for structured matrices ⋮ A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation ⋮ Accurate Computation of Generalized Eigenvalues of Regular SR-BP Pairs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- Nonlinear eigenvalue problems and contour integrals
- Rational Krylov sequence methods for eigenvalue computation
- Using implicitly filtered RKS for generalised eigenvalue problems
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- The implicit application of a rational filter in the RKS method
- A projection method for generalized eigenvalue problems using numerical integration.
- Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
- An extension of the \(QZ\) algorithm beyond the Hessenberg-upper triangular pencil
- Numerical methods for general and structured eigenvalue problems.
- Performance of the QZ Algorithm in the Presence of Infinite Eigenvalues
- Francis’s Algorithm
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Algorithm 866
- A Generalized Eigenvalue Approach for Solving Riccati Equations
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- The Combination Shift $QZ$ Algorithm
- Some Thoughts on the QZ Algorithm for Solving the Generalized Eigenvalue Problem
- Bulge Exchanges in Algorithms of QR Type
- Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- A Generalization of the Multishift QR Algorithm
- IFISS: A Computational Laboratory for Investigating Incompressible Flow Problems
- Generalized Rational Krylov Decompositions with an Application to Rational Approximation
- The Matrix Eigenvalue Problem
- Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: A Rational QZ Method