Approximating the large sparse matrix exponential using incomplete orthogonalization and Krylov subspaces of variable dimension.
From MaRDI portal
Publication:5355097
Recommendations
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Efficient computation of the exponential operator for large, sparse, symmetric matrices
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- Error estimates for Krylov subspace approximations of matrix exponentials
Cited in
(11)- Efficient computation of the exponential operator for large, sparse, symmetric matrices
- High-performance computation of the exponential of a large sparse matrix
- ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
- Exponential time differencing for mimetic multilayer Ocean models
- Nonoverlapping localized exponential time differencing methods for diffusion problems
- An efficient second-order linear scheme for the phase field model of corrosive dissolution
- A scalable exponential-DG approach for nonlinear conservation laws: with application to Burger and Euler equations
- A space-time adaptive finite element method with exponential time integrator for the phase field model of pitting corrosion
- Approximating the matrix exponential of an advection-diffusion operator using the incomplete orthogonalization method
- Coarse Grid Corrections in Krylov Subspace Evaluations of the Matrix Exponential
- KIOPS: a fast adaptive Krylov subspace solver for exponential integrators
This page was built for publication: Approximating the large sparse matrix exponential using incomplete orthogonalization and Krylov subspaces of variable dimension.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355097)