Explicit single step methods with optimal order of convergence for partial differential equations

Abstract

We construct explicit single step discretizations of linear, non-homogeneous initial boundary value problems. These methods use polynomial approximations for the time discretization. The order reduction phenomenon, present when a fully discrete Runge–Kutta is used, is avoided and the maximum expected order of convergence is achieved. The results are illustrated numerically.