An explicit 16-stage Runge-Kutta method of order 10 discovered by numerical search

DOI10.1007/S11075-024-01783-2MaRDI QIDQ6559449

David Kai Zhang

Publication date: 21 June 2024

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

Runge-Kutta methodshigh-order methodspolynomial systemsnumerical optimizationexplicit methodsnumerical root-finding10th-order methods

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The non-existence of ten stage eighth order explicit Runge-Kutta methods
• High order embedded Runge-Kutta formulae
• Numerical methods for ordinary differential equations in the 20th century
• A floating-point technique for extending the available precision
• Julia: A Fresh Approach to Numerical Computing
• Algorithm 921
• Solving Ordinary Differential Equations I
• Runge–Kutta Methods for Ordinary Differential Equations
• Evaluating Derivatives
• Constant Time Generation of Rooted Trees
• Generating Binary Trees Lexicographically
• Ideals, Varieties, and Algorithms
• On the Attainable Order of Runge-Kutta Methods
• Coefficients for the study of Runge-Kutta integration processes
• On Runge-Kutta processes of high order
• Numerical Methods for Ordinary Differential Equations
• Computing with B-series

This page was built for publication: An explicit 16-stage Runge-Kutta method of order 10 discovered by numerical search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559449)