![]() |
ETNA - Electronic Transactions on Numerical Analysis
|
![]() |
Verlag der Österreichischen Akademie der Wissenschaften Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400 https://verlag.oeaw.ac.at, e-mail: verlag@oeaw.ac.at |
|
||||||||||||||||||||
|
DATUM, UNTERSCHRIFT / DATE, SIGNATURE
BANK AUSTRIA CREDITANSTALT, WIEN (IBAN AT04 1100 0006 2280 0100, BIC BKAUATWW), DEUTSCHE BANK MÜNCHEN (IBAN DE16 7007 0024 0238 8270 00, BIC DEUTDEDBMUC)
|

ETNA - Electronic Transactions on Numerical Analysis, pp. 609-626, 2025/12/19
An explicit $s$-stage Runge–Kutta method of order 10 is determined by $s (s + 1) / 2$ parameters that must satisfy a non-linear algebraic system of $1205$ equations. In the literature, solutions for the cases $s = 18$ [A. R. Curtis, J. Inst. Math. Appl., 16 (1975), pp. 35–55] and $s = 17$ [E. Hairer, J. Inst. Math. Appl., 21 (1978), pp. 47–59] were analytically derived, while that for $s=16$ [D. K. Zhang, Numer. Algorithms, 96 (2024), pp. 1243–1267] was found by numerical search. In the present paper, a family of methods with $s = 15$ is derived.
Keywords: minimal number of stages, explicit Runge–Kutta methods