Double-shift-invert Arnoldi method for computing the matrix exponential
From MaRDI portal
Publication:1756729
Recommendations
- An extended-rational Arnoldi method for large matrix exponential evaluations
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Computing the action of the matrix exponential, with an application to exponential integrators
- Shift-invert Arnoldi approximation to the Toeplitz matrix exponential
- An inexact shift-and-invert Arnoldi algorithm for Toeplitz matrix exponential.
Cites work
- Approximation of exp(-x) by rational functions with concentrated negative poles
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Numerical ranges and stability estimates
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Parallelization of the rational Arnoldi algorithm
- Preconditioning Lanczos Approximations to the Matrix Exponential
- Rational Krylov sequence methods for eigenvalue computation
- RD-rational approximations of the matrix exponential
- The reaction-diffusion master equation as an asymptotic approximation of diffusion to a small target
- The Scaling and Squaring Method for the Matrix Exponential Revisited
- Uniform approximation of \(\varphi\)-functions in exponential integrators by a rational Krylov subspace method with simple poles
Cited in
(6)- The scaling and modified squaring method for matrix functions related to the exponential
- A shift and invert reorthogonalization Arnoldi algorithm for solving the chemical master equation
- An extended-rational Arnoldi method for large matrix exponential evaluations
- Shift-invert Arnoldi approximation to the Toeplitz matrix exponential
- An inexact shift-and-invert Arnoldi algorithm for Toeplitz matrix exponential.
- Arnoldi algorithms with structured orthogonalization
This page was built for publication: Double-shift-invert Arnoldi method for computing the matrix exponential
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756729)