Convergence rates for inverse-free rational approximation of matrix functions
From MaRDI portal
Publication:501246
Recommendations
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
- Computing function of large matrices by a preconditioned rational Krylov method
Cites work
- scientific article; zbMATH DE number 3989703 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- An extended Krylov subspace model-order reduction technique to simulate wave propagation in unbounded domains
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- Computing approximate extended Krylov subspaces without explicit inversion
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Efficient algorithms for the matrix cosine and sine
- Eigenvalues and pseudo-eigenvalues of Toeplitz matrices
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Expokit
- Exponential integrators
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Functions of Matrices
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- Implicitly restarted Arnoldi with purification for the shift-invert transformation
- Lanczos-based exponential filtering for discrete ill-posed problems
- Network properties revealed through matrix functions
- Numerical approximation of the product of the square root of a matrix with a vector
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- On the computation of Gauss quadrature rules for measures with a monomial denominator
- Rational Gauss Quadrature
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Recursion relations for the extended Krylov subspace method
- Solution of large scale evolutionary problems using rational Krylov subspaces with optimized shifts
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- The extended Krylov subspace method and orthogonal Laurent polynomials
Cited in
(13)- Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix
- Acceleration of contour integration techniques by rational Krylov subspace methods
- Inexact rational Krylov Subspace methods for approximating the action of functions of matrices
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- Functions of rational Krylov space matrices and their decay properties
- Computation of generalized matrix functions with rational Krylov methods
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- Computing the reciprocal of a -function by rational approximation
- The extended symmetric block Lanczos method for matrix-valued Gauss-type quadrature rules
- Efficient mixed rational and polynomial approximation of matrix functions
- Computing function of large matrices by a preconditioned rational Krylov method
This page was built for publication: Convergence rates for inverse-free rational approximation of matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501246)
