Explicit two-step peer methods with reused stages

Two-step peer methods for the numerical solution of Initial Value Problems (IVP) combine the advantages of Runge-Kutta (RK) and multistep methods to obtain high stage order and provide in a natural way a dense output. In general, explicit s-stage peer methods require s evaluations of the vector field at each step. Nevertheless, Klinge and coworkers (BIT Numer Math, 2018) have shown that some methods use less function calls se更多