Discovering New Runge-Kutta Methods Using Unstructured Numerical Search

arXiv1911.00318MaRDI QIDQ6328354

Author name not available (Why is that?)

Publication date: 30 October 2019

Abstract: Runge-Kutta methods are a popular class of numerical methods for solving ordinary differential equations. Every Runge-Kutta method is characterized by two basic parameters: its order, which measures the accuracy of the solution it produces, and its number of stages, which measures the amount of computational work it requires. The primary goal in constructing Runge-Kutta methods is to maximize order using a minimum number of stages. However, high-order Runge-Kutta methods are difficult to construct because their parameters must satisfy an exponentially large system of polynomial equations. This paper presents the first known 10th-order Runge-Kutta method with only 16 stages, breaking a 40-year standing record for the number of stages required to achieve 10th-order accuracy. It also discusses the tools and techniques that enabled the discovery of this method using a straightforward numerical search.

Has companion code repository: https://github.com/dzhang314/rktk

This page was built for publication: Discovering New Runge-Kutta Methods Using Unstructured Numerical Search

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