Block embedded explicit Runge-Kutta methods (Q1067368)

This paper considers block explicit Runge-Kutta methods given by the formulae: \[ y_{n+i}=y_ n+h\sum^{m}_{j=1}\quad b_{ij}k_ j(i=1,...\quad s),\quad k_ j=f(y_ n+h\sum^{j-1}_{i=1}a_{ji}k_ i) \] that advance the integration by s steps using a total of m function evaluations. Furthermore an embedded formula of the same type is used for the purpose of error estimation. In particular the author derives some low order pairs and a 5(4) pair with \(s=2\) called BERK. A code based on BERK formulae is compared with the Runge-Kutta-Merson of the NAG library and the RKF45 of \textit{L. F. Shampine} and \textit{H. A. Watts} [Computer methods for mathematical computations (1977)]. He concludes that BERK is generally more efficient and reliable than either of the above mentioned codes. Finally the author points out that BERK formulae may be particularly attractive for problems where output is requested at many ''off step'' points because the solution at these points may be computed with relatively little additional computational effort.