Parallel one-step methods with minimal parallel stages (Q1901535)

Suppose that sufficiently many processors are available, so that embedded methods do not need to be considered. Then, for certain types of method, lower bounds for the number of (parallel) stages, \(s_p\), required to achieve a given order, \(p\), are derived. For the general explicit one step method it is shown that \(s_p \geq p\). Results of this type are obtained for implicit Runge-Kutta methods, (singly) diagonally implicit Runge-Kutta methods, semi-implicit Runge-Kutta methods and Rosenbrock-Wanner methods.