Convergence rates for inverse-free rational approximation of matrix functions
From MaRDI portal
Publication:501246
DOI10.1016/J.LAA.2016.08.029zbMATH Open1352.65135OpenAlexW2512538700MaRDI QIDQ501246FDOQ501246
Authors: Carl Jagels, Thomas Mach, Raf Vandebril, 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
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
Iterative numerical methods for linear systems (65F10) Matrix exponential and similar functions of matrices (15A16) Iterative procedures involving nonlinear operators (47J25) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Expokit
- Functions of Matrices
- Network properties revealed through matrix functions
- Title not available (Why is that?)
- Exponential integrators
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- The extended Krylov subspace method and orthogonal Laurent polynomials
- Recursion relations for the extended Krylov subspace method
- Title not available (Why is that?)
- Solution of large scale evolutionary problems using rational Krylov subspaces with optimized shifts
- Eigenvalues and pseudo-eigenvalues of Toeplitz matrices
- Efficient algorithms for the matrix cosine and sine
- An extended Krylov subspace model-order reduction technique to simulate wave propagation in unbounded domains
- Numerical approximation of the product of the square root of a matrix with a vector
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- Implicitly restarted Arnoldi with purification for the shift-invert transformation
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- On the computation of Gauss quadrature rules for measures with a monomial denominator
- Computing approximate extended Krylov subspaces without explicit inversion
- Rational Gauss Quadrature
- Lanczos-based exponential filtering for discrete ill-posed problems
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 \(\phi\)-function by rational approximation
- The extended symmetric block Lanczos method for matrix-valued Gauss-type quadrature rules
- Computing function of large matrices by a preconditioned rational Krylov method
- Efficient mixed rational and polynomial approximation of matrix functions
Uses Software
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)
