On the generation of mono-implicit Runge-Kutta-Nyström methods by mono-implicit Runge-Kutta methods (Q1379027)

The concept of mono-implicit Runge-Kutta methods has been introduced by \textit{W. M. G. van Bokhoven} [BIT 20, 34-43 (1980; Zbl 0448.65047)], where they are called implicit endpoint quadrature rules. A typical property of these methods is that the order of an \(s\)-stage mono-implicit Runge-Kutta method is at most \(s+1\). P-stable methods for second-order ordinary differential equations of the form \(y''= f(t,y)\) often are constructed by using implicit Runge-Kutta-Nyström methods [\textit{E. Hairer}, \textit{S. P. Nørsett} and \textit{G. Wanner}, Solving ordinary differential equations. I: Nonstiff problems (1987; Zbl 0638.65058)]. In the present paper, the authors study a special class of four-stage fourth-order P-stable mono-implicit Runge-Kutta-Nyström methods which are characterized by stages evaluated at abscissas having integer values in the range 0-3. The authors investigate conditions to be fulfilled by mono-implicit Runge-Kutta methods in order to generate P-stable mono-implicit Runge-Kutta-Nyström methods. One of these results is that mono-implicit Runge-Kutta methods cannot generate mono-implicit Runge-Kutta-Nyström methods of order greater than four. A complete classification of methods of order at most four can be done with the help of symbolic computing packages. The authors consider certain families of mono-implicit Runge-Kutta methods in standard form and generate from them mono-implicit Runge-Kutta-Nyström methods in standard form.