{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T17:58:19Z","timestamp":1769104699259,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s11075-024-01783-2","type":"journal-article","created":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T06:02:31Z","timestamp":1709272951000},"page":"1243-1267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An explicit 16-stage Runge\u2013Kutta method of order 10 discovered by numerical search"],"prefix":"10.1007","volume":"96","author":[{"given":"David Kai","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"1783_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9781119121534","author":"JC Butcher","year":"2016","unstructured":"Butcher, J.C.: Numerical methods for ordinary differential equations. Wiley, Hoboken, NJ. (2016). https:\/\/doi.org\/10.1002\/9781119121534","journal-title":"Wiley, Hoboken, NJ."},{"issue":"2","key":"1783_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/s1446788700023387","volume":"4","author":"JC Butcher","year":"1964","unstructured":"Butcher, J.C.: On Runge-Kutta processes of high order. J. Aust. Math. Soc. 4(2), 179\u2013194 (1964). https:\/\/doi.org\/10.1017\/s1446788700023387","journal-title":"J. Aust. Math. Soc."},{"issue":"91","key":"1783_CR3","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1090\/s0025-5718-1965-0179943-x","volume":"19","author":"JC Butcher","year":"1965","unstructured":"Butcher, J.C.: On the attainable order of Runge-Kutta methods. Math. Comput. 19(91), 408\u2013417 (1965). https:\/\/doi.org\/10.1090\/s0025-5718-1965-0179943-x","journal-title":"Math. Comput."},{"issue":"3","key":"1783_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/bf01935372","volume":"25","author":"JC Butcher","year":"1985","unstructured":"Butcher, J.C.: The non-existence of ten stage eighth order explicit Runge-Kutta methods. BIT 25(3), 521\u2013540 (1985). https:\/\/doi.org\/10.1007\/bf01935372","journal-title":"BIT"},{"key":"1783_CR5","doi-asserted-by":"publisher","unstructured":"Butcher, J.C.: Numerical methods for ordinary differential equations in the 20th century. J Comput Appl Math. 125(1), 1\u201329 (2000). https:\/\/doi.org\/10.1016\/S0377-0427(00)00455-6","DOI":"10.1016\/S0377-0427(00)00455-6"},{"key":"1783_CR6","doi-asserted-by":"publisher","unstructured":"Butcher JC (2015) Runge\u2013Kutta methods for ordinary differential equations. In: Al-Baali M, Grandinetti L, Purnama A. (eds.) Numerical Analysis and Optimization, pp. 37\u201358. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-17689-5_2","DOI":"10.1007\/978-3-319-17689-5_2"},{"key":"1783_CR7","doi-asserted-by":"publisher","unstructured":"Hairer E (1978) A Runge-Kutta method of order 10. IMA J Appl Math. 21(1), 47\u201359. https:\/\/doi.org\/10.1093\/imamat\/21.1.47","DOI":"10.1093\/imamat\/21.1.47"},{"key":"1783_CR8","unstructured":"Feagin T (2023) High-order explicit Runge\u2013Kutta methods. https:\/\/sce.uhcl.edu\/rungekutta\/. Accessed: 2023-08-29"},{"key":"1783_CR9","doi-asserted-by":"publisher","unstructured":"Hairer E, N\u00f8rsett SP, Wanner G (1993) Solving ordinary differential equations I: nonstiff problems. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-78862-1_2","DOI":"10.1007\/978-3-540-78862-1_2"},{"issue":"1","key":"1783_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017). https:\/\/doi.org\/10.1137\/141000671","journal-title":"SIAM Rev."},{"key":"1783_CR11","unstructured":"Zhang DK (2019) RungeKuttaToolKit.jl: tools for constructing and analyzing Runge\u2013Kutta methods. https:\/\/github.com\/dzhang314\/RungeKuttaToolKit.jl"},{"key":"1783_CR12","unstructured":"Zhang DK (2019) Discovering new Runge\u2013Kutta methods using unstructured numerical search. Vanderbilt University Undergraduate Thesis. https:\/\/doi.org\/10.48550\/arXiv.1911.00318"},{"issue":"2","key":"1783_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1017\/S1446788700027932","volume":"3","author":"JC Butcher","year":"1963","unstructured":"Butcher, J.C.: Coefficients for the study of Runge-Kutta integration processes. J. Aust. Math. Soc. 3(2), 185\u2013201 (1963). https:\/\/doi.org\/10.1017\/S1446788700027932","journal-title":"J. Aust. Math. Soc."},{"key":"1783_CR14","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4hcj","volume-title":"Nonlinear optimization","author":"A Ruszczynski","year":"2011","unstructured":"Ruszczynski, A.: Nonlinear optimization. Princeton University Press, Princeton, NJ (2011)"},{"issue":"4","key":"1783_CR15","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1137\/0206055","volume":"6","author":"F Ruskey","year":"1977","unstructured":"Ruskey, F., Hu, T.C.: Generating binary trees lexicographically. SIAM J. Comput. 6(4), 745\u2013758 (1977). https:\/\/doi.org\/10.1137\/0206055","journal-title":"SIAM J. Comput."},{"key":"1783_CR16","doi-asserted-by":"crossref","unstructured":"Beyer T, Hedetniemi SM (1980) Constant time generation of rooted trees. SIAM Journal on Computing 9(4):706\u2013712. DOIurlhttps:\/\/doi.org\/10.1137\/0209055","DOI":"10.1137\/0209055"},{"key":"1783_CR17","unstructured":"Keiper JB, Sofroniou M (2007) Differential equation analysis package guide. https:\/\/reference.wolfram.com\/language\/NumericalDifferentialEquationAnalysis\/guide\/NumericalDifferentialEquationAnalysisPackage.html"},{"key":"1783_CR18","doi-asserted-by":"publisher","unstructured":"Ketcheson DI, Ranocha H, Parsani M, Waheed UB, Hadjimichael Y (2020) NodePy: a package for the analysis of numerical ODE solvers. J Open Source Softw 5(55):2515. https:\/\/doi.org\/10.21105\/joss.02515","DOI":"10.21105\/joss.02515"},{"key":"1783_CR19","doi-asserted-by":"publisher","unstructured":"Butcher JC (2021) B-series and algebraic analysis, pp. 99\u2013149. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-70956-3_3","DOI":"10.1007\/978-3-030-70956-3_3"},{"key":"1783_CR20","unstructured":"Ranocha H (2019) contributors: RootedTrees.jl: a collection of functionality around rooted trees to generate order conditions for Runge-Kutta methods in Julia for differential equations and scientific machine learning (SciML). https:\/\/github.com\/SciML\/RootedTrees.jl"},{"key":"1783_CR21","doi-asserted-by":"publisher","unstructured":"Ketcheson DI, Ranocha H (2023) Computing with B-series. ACM Trans Math Softw 49(2). https:\/\/doi.org\/10.1145\/35733842111.11680","DOI":"10.1145\/35733842111.11680"},{"key":"1783_CR22","doi-asserted-by":"publisher","unstructured":"Griewank A, Walther A (2008) Evaluating derivatives, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia, PA. https:\/\/doi.org\/10.1137\/1.9780898717761","DOI":"10.1137\/1.9780898717761"},{"key":"1783_CR23","unstructured":"Zhang DK (2019) MultiFloats.jl: fast, SIMD-accelerated extended-precision arithmetic for Julia. https:\/\/github.com\/dzhang314\/MultiFloat"},{"key":"1783_CR24","doi-asserted-by":"publisher","unstructured":"Dekker, T.J.: A floating-point technique for extending the available precision. Numer Math 18(3), 224\u2013242 (1971). https:\/\/doi.org\/10.1007\/bf01397083","DOI":"10.1007\/bf01397083"},{"key":"1783_CR25","unstructured":"Khashin S (2009) A symbolic-numeric approach to the solution of the Butcher equations. Canadian Applied Mathematics Quarterly 17(3)"},{"key":"1783_CR26","doi-asserted-by":"publisher","unstructured":"Prince PJ, Dormand JR (1981) High order embedded Runge-Kutta formulae. J Comput Appl Math 7(1), 67\u201375. https:\/\/doi.org\/10.1016\/0771-050X(81)90010-3","DOI":"10.1016\/0771-050X(81)90010-3"},{"key":"1783_CR27","doi-asserted-by":"publisher","unstructured":"Cox DA, Little J, O\u2019Shea D (2015) Geometry, algebra, and algorithms, pp. 1\u201347. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-16721-3_1","DOI":"10.1007\/978-3-319-16721-3_1"},{"key":"1783_CR28","doi-asserted-by":"publisher","unstructured":"Brown CW, Davenport JH (2007) The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation. ISSAC\u201907, pp. 54\u201360. Association for Computing Machinery, New York, USA. https:\/\/doi.org\/10.1145\/1277548.1277557","DOI":"10.1145\/1277548.1277557"},{"key":"1783_CR29","doi-asserted-by":"publisher","unstructured":"Hauenstein JD, Sottile F (2012) Algorithm 921: AlphaCertified: certifying solutions to polynomial systems. ACM Trans Math Softw. 38(4). https:\/\/doi.org\/10.1145\/2331130.2331136","DOI":"10.1145\/2331130.2331136"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01783-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01783-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01783-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T08:24:40Z","timestamp":1717662280000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01783-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,1]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1783"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01783-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,1]]},"assertion":[{"value":"16 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable; this is a purely abstract study in mathematics that involves no living participants or organic materials.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The author declares no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}