Biorthogonal rational Krylov subspace methods
From MaRDI portal
Publication:5218402
DOI10.1553/etna_vol51s451zbMath1433.65058arXiv1809.07660OpenAlexW2992699564WikidataQ126628148 ScholiaQ126628148MaRDI QIDQ5218402
Niel Van Buggenhout, Marc Van Barel, Raf Vandebril
Publication date: 3 March 2020
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.07660
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix pencils (15A22) Numerical aspects of recurrence relations (65Q30)
Related Items
Computation of generalized matrix functions with rational Krylov methods, Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix, The Short-Term Rational Lanczos Method and Applications, Generation of orthogonal rational functions by procedures for structured matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices
- Recursion relations for the extended Krylov subspace method
- Rational Krylov sequence methods for eigenvalue computation
- A generalized isometric Arnoldi algorithm
- Schur parameter pencils for the solution of the unitary eigenproblem
- Stationary and almost stationary iterative (k,l)-step methods for linear and nonlinear systems of equations
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- Error bounds in the isometric Arnoldi process
- An implicit filter for rational Krylov using core transformations
- Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
- A rational Lanczos algorithm for model reduction
- Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices
- Revisiting \((k,\ell)\)-step methods
- CMV matrices: Five years after
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm
- Some Perspectives on the Eigenvalue Problem
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Core-Chasing Algorithms for the Eigenvalue Problem
- Iterative Krylov Methods for Large Linear Systems
- Generalized Rational Krylov Decompositions with an Application to Rational Approximation
- The RKFIT Algorithm for Nonlinear Rational Approximation
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
