Low Stage High Order Explicit Runge--Kutta Methods via Q- and D-Conditions: General Theory and Efficient Recursive Construction

Constructing explicit Runge--Kutta (ERK) methods with as few stages as possible for a given order is a classical problem in numerical analysis. In this work, we introduce a $Q$/$D$-space framework of sufficient order conditions for ERK methods. This framework generalizes Butcher's classical simplifying assumptions by reformulating them in terms of simplified $Q$- and $D$-spaces defined through their residual vectors. It yields sufficient conditions which, together with $B(p)$, ensure order $p$. It also leads to a recursive construction procedure for ERK methods of arbitrary even order, in which the Butcher coefficients are obtained from two structured linear systems. For every even order $p\ge 4$, the construction produces ERK methods with stage number $s(p)=(p^2-2p+8)/4$. This stage count has the same leading term as that of the classical Gragg families, while improving the linear term. The free parameters retained by the construction further provide a systematic framework for designing methods with enhanced stability and short-time accuracy.