Explicit Time Stepping Methods with High Stage Order and Monotonicity Properties

Authors:
Emil Constantinescu;Adrian Sandu
Affiliations:
Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, USA IL 60439;Department of Computer Science, Virginia Tech, Blacksburg, USA VA 24061
Venue:
ICCS 2009 Proceedings of the 9th International Conference on Computational Science
Year:
2009

Citing 9
Cited 0

Convergence and order reduction of Runge-Kutta schemes applied to evolutionary problems in partial differential equations

Numerische Mathematik
Efficient implementation of essentially non-oscillatory shock-capturing schemes

Journal of Computational Physics
Stability and convergence at the PDE/stiff ODE interface

Applied Numerical Mathematics - Recent Theoretical Results in Numerical Ordinary Differential Equations
The theoretical accuracy of Runge-Kutta time discretizations for the initial boundary value problem: a study of the boundary error

SIAM Journal on Scientific Computing
Strong Stability-Preserving High-Order Time Discretization Methods

SIAM Review
On Strong Stability Preserving Time Discretization Methods

Journal of Scientific Computing
High-order linear multistep methods with general monotonicity and boundedness properties

Journal of Computational Physics
On High Order Strong Stability Preserving Runge---Kutta and Multi Step Time Discretizations

Journal of Scientific Computing
General linear methods for ordinary differential equations

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a three and a four order explicit time stepping method. These methods have high stage order and favorable monotonicity properties. The proposed methods are based on multistage-multistep (MM) schemes that belong to the broader class of general linear methods, which are generalizations of both Runge-Kutta and linear multistep methods. Methods with high stage order alleviate the order reduction occurring in explicit multistage methods due to non-homogeneous boundary/source terms. Furthermore, the MM schemes presented in this paper can be expressed as convex combinations of Euler steps. Consequently, they have the same monotonicity properties as the forward Euler method. This property makes these schemes well suited for problems with discontinuous solutions.