1 October 2004 in Journal of Scientific Computing
1 January 2005 in SIAM Journal on Numerical Analysis
Over the last few years a great effort has been made to develop monotone high order explicit Runge--Kutta methods by means of their Shu--Osher representations. In this context, the stepsize restriction to obtain numerical monotonicity is normally computed using the optimal representation. In this paper we extend the Shu--Osher representations for any Runge--Kutta method giving sufficient conditions for monotonicity. We show how optimal Shu--Osher representations can be constructed from the Butcher tableau of a Runge--Kutta method. The optimum stepsize restriction for monotonicity is given by the radius of absolute monotonicity of the Runge--Kutta method [L. Ferracina and M. N. Spijker, SIAM J. Numer. Anal., 42 (2004), pp. 1073--1093], and hence if this radius is zero, the method is not monotone. In the Shu--Osher representation, methods with zero radius require negative coefficients, and to deal with them, an extra associate problem is considered. In this paper we interpret these schemes as representation...
1 January 2006 in SIAM Journal on Numerical Analysis
Space discretization of some time‐dependent partial differential equations gives rise to ordinary differential equations containing additive terms with different stiffness properties. In these situations, additive Runge–Kutta (ARK) methods are used. The aim of this paper is to study monotonicity properties (also known as strong stability) for ARK methods. A new definition of absolute monotonicity for ARK methods is given and some of its properties are investigated. With this concept, monotonicity for ARK schemes under certain stepsize restrictions can be ensured. Some ARK methods from the literature are analyzed. As expected, monotonicity for each Runge–Kutte (RK) method does not ensure monotonicity for the ARK scheme. Some numerical examples show the applicability of these results.
1 May 2012 in Journal of Computational Physics
1 December 2014 in Journal of Computational and Applied Mathematics
1 July 2005 in Journal of Scientific Computing