Convergence rates for inverse-free rational approximation of matrix functions
From MaRDI portal
Publication:501246
DOI10.1016/j.laa.2016.08.029zbMath1352.65135OpenAlexW2512538700MaRDI QIDQ501246
Raf Vandebril, Thomas Mach, Carl Jagels, Lothar Reichel
Publication date: 29 December 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.08.029
Iterative procedures involving nonlinear operators (47J25) Iterative numerical methods for linear systems (65F10) Matrix exponential and similar functions of matrices (15A16) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items (2)
Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix ⋮ The extended symmetric block Lanczos method for matrix-valued Gauss-type quadrature rules
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An extended Krylov subspace model-order reduction technique to simulate wave propagation in unbounded domains
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- Recursion relations for the extended Krylov subspace method
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- The extended Krylov subspace method and orthogonal Laurent polynomials
- Eigenvalues and pseudo-eigenvalues of Toeplitz matrices
- Numerical approximation of the product of the square root of a matrix with a vector
- On the computation of Gauss quadrature rules for measures with a monomial denominator
- Computing approximate extended Krylov subspaces without explicit inversion
- Efficient algorithms for the matrix cosine and sine
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- Exponential integrators
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Network Properties Revealed through Matrix Functions
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- Implicitly restarted Arnoldi with purification for the shift-invert transformation
- Solution of Large Scale Evolutionary Problems Using Rational Krylov Subspaces with Optimized Shifts
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Expokit
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Functions of Matrices
- Rational Gauss Quadrature
- Lanczos-based exponential filtering for discrete ill-posed problems
This page was built for publication: Convergence rates for inverse-free rational approximation of matrix functions