Approximating the large sparse matrix exponential using incomplete orthogonalization and Krylov subspaces of variable dimension.
DOI10.1002/NLA.2090zbMATH Open1424.65063OpenAlexW2592657418WikidataQ115612313 ScholiaQ115612313MaRDI QIDQ5355097FDOQ5355097
Authors: H. D. Vo, Roger B. Sidje 
Publication date: 6 September 2017
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.2090
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
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cited In (11)
- 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
- Efficient computation of the exponential operator for large, sparse, symmetric matrices
Uses Software
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)
