A family of parallel Runge-Kutta pairs

Increasing availability of parallel computers has recently spurred a substantial amount of research concerned with designing explicit Runge-Kutta methods to be implemented on such computers. Here, we discuss a family of methods that require fewer processors than methods presently available do, still achieving a similar speed-up. In particular, (5,6) and (6,7) pairs are derived, that require a minimum number of function evaluations on two and three processors, respectively.