Rational \(QR\)-iteration without inversion
From MaRDI portal
Publication:957933
DOI10.1007/s00211-008-0177-3zbMath1154.65020OpenAlexW2058476711MaRDI QIDQ957933
Nicola Mastronardi, Raf Vandebril, Marc Van Barel
Publication date: 1 December 2008
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-008-0177-3
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of algorithms of decomposition type for the eigenvalue problem
- Rational Krylov sequence methods for eigenvalue computation
- On the reduction of a Hamiltonian matrix to Hamiltonian Schur form
- A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
- The QR algorithm for unitary Hessenberg matrices
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- A multishift QR iteration without computation of the shifts
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
- A modification of the Dewilde-van der Veen method for inversion of finite structured matrices
- Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
- On the shifted QR iteration applied to companion matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
- Understanding the $QR$ Algorithm
- Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
- An implicit QR algorithm for symmetric semiseparable matrices
- Rational Krylov matrices and QR steps on Hermitian diagonal‐plus‐semiseparable matrices
- A QR-Based Solver for Rank Structured Matrices
- A Hamiltonian $QR$ Algorithm
- Bidirectional Chasing Algorithms for the Eigenvalue Problem
- Bulge Exchanges in Algorithms of QR Type
- Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Orthogonal Rational Functions and Structured Matrices
This page was built for publication: Rational \(QR\)-iteration without inversion
