Explicit and implicit error inhibiting schemes with post-processing

Efficient high order numerical methods for evolving the solution of an ordinary differential equation are widely used. The popular Runge–Kutta methods, linear multi-step methods, and more broadly general linear methods, all have a global error that is completely determined by analysis of the local truncation error. In prior work we investigated the interplay between the local truncation error and the global error to construct error inhibiting schemesthat control the accumulation of the local truncation error over time, resulting in a global error that is one order higher than expected from the local truncation error. In this work we extend our error inhibiting framework introduced in [6] to include a broader class of time-discretization methods that allows an exact computation of the leading error term, which can then be post-processed to obtain a solution that is two orders higher than expected from truncation error analysis. We define sufficient conditions that result in a desired form of the error and describe the construction of the post-processor. A number of new explicit and implicit methods that have this property are given and tested on a variety of ordinary and partial differential equations. We show that these methods provide a solution that is two orders higher than expected from truncation error analysis alone.