Construction of Additive Semi-Implicit Runge–Kutta Methods with Low-Storage Requirements
- 5 October 2015
- journal article
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 67 (3) , 1019-1042
- https://doi.org/10.1007/s10915-015-0116-2
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- On some new low storage implementations of time advancing Runge–Kutta methodsJournal of Computational and Applied Mathematics, 2012
- On an accurate third order implicit-explicit Runge–Kutta method for stiff problemsApplied Numerical Mathematics, 2009
- On a Class of Uniformly Accurate IMEX Runge–Kutta Schemes and Applications to Hyperbolic Systems with RelaxationSIAM Journal on Scientific Computing, 2009
- Strong stability of singly-diagonally-implicit Runge–Kutta methodsApplied Numerical Mathematics, 2007
- Error Analysis of IMEX Runge–Kutta Methods Derived from Differential-Algebraic SystemsSIAM Journal on Numerical Analysis, 2007
- Minimum storage Runge-Kutta schemes for computational acousticsComputers & Mathematics with Applications, 2003
- Strong Stability-Preserving High-Order Time Discretization MethodsSIAM Review, 2001
- Total variation diminishing Runge-Kutta schemesMathematics of Computation, 1998
- Implicit-explicit Runge-Kutta methods for time-dependent partial differential equationsApplied Numerical Mathematics, 1997
- Uniformly Accurate Schemes for Hyperbolic Systems with RelaxationSIAM Journal on Numerical Analysis, 1997