Biorthogonal rational Krylov subspace methods
From MaRDI portal
Abstract: A general framework for oblique projections of nonhermitian matrices onto rational Krylov subspaces is developed. To obtain this framework we revisit the classical rational Krylov subspace algorithm and prove that the projected matrix can be written efficiently as a structured pencil, where the structure can take several forms, such as Hessenberg or inverse Hessenberg. One specific instance of the structures appearing in this framework for oblique projections is a tridiagonal pencil. This is a direct generalization of the classical biorthogonal Krylov subspace method where the projection becomes a single nonhermitian tridiagonal matrix and of the Hessenberg pencil representation for rational Krylov subspaces. Based on the compact storage of this tridiagonal pencil in the biorthogonal setting, we can develop short recurrences. Numerical experiments confirm the validity of the approach.
Recommendations
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- scientific article; zbMATH DE number 663838
- Krylov subspace methods, biorthogonal polynomials and Padé-type approximants
Cites work
- A generalized isometric Arnoldi algorithm
- A rational Lanczos algorithm for model reduction
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- An implicit filter for rational Krylov using core transformations
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Chasing bulges or rotations? A metamorphosis of the QR-algorithm
- CMV matrices: Five years after
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- Core-Chasing Algorithms for the Eigenvalue Problem
- Error bounds in the isometric Arnoldi process
- Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
- Generalized Rational Krylov Decompositions with an Application to Rational Approximation
- scientific article; zbMATH DE number 1069613 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices
- Iterative Krylov Methods for Large Linear Systems
- Krylov subspace methods. Principles and analysis.
- Numerical methods for large eigenvalue problems
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- Rational Krylov sequence methods for eigenvalue computation
- Recursion relations for the extended Krylov subspace method
- Revisiting \((k,\ell)\)-step methods
- Schur parameter pencils for the solution of the unitary eigenproblem
- Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices
- Some Perspectives on the Eigenvalue Problem
- Stationary and almost stationary iterative (k,l)-step methods for linear and nonlinear systems of equations
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The RKFIT algorithm for nonlinear rational approximation
Cited in
(9)- Generation of orthogonal rational functions by procedures for structured matrices
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix
- Biconjugate direction methods in Krylov subspaces
- Computation of generalized matrix functions with rational Krylov methods
- The short-term rational Lanczos method and applications
- A short-term rational Krylov method for linear inverse problems
- Krylov and core transformation algorithms for an inverse eigenvalue problem to compute recurrences of multiple orthogonal polynomials
- Fast computation of orthonormal basis for RBF spaces through Krylov space methods
This page was built for publication: Biorthogonal rational Krylov subspace methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218402)
