Author
Listed:
- Zacharias A. Anastassi
(Institute of Artificial Intelligence, School of Computer Science and Informatics, De Montfort University, Leicester LE1 9BH, UK)
Abstract
We propose a new strategy for constructing Runge–Kutta (RK) methods using evolutionary computation techniques, with the goal of directly minimising global error rather than relying on traditional local properties. This approach is general and applicable to a wide range of differential equations. To highlight its effectiveness, we apply it to two benchmark problems with oscillatory behaviour: the (2+1)-dimensional nonlinear Schrödinger equation and the N -Body problem (the latter over a long interval), which are central in quantum physics and astronomy, respectively. The method optimises four free coefficients of a sixth-order, eight-stage parametric RK scheme using a novel objective function that compares global error against a benchmark method over a range of step lengths. It overcomes challenges such as local minima in the free coefficient search space and the absence of derivative information of the objective function. Notably, the optimisation relaxes standard RK node bounds ( c i ∈ [ 0 , 1 ] ), leading to improved local stability, lower truncation error, and superior global accuracy. The results also reveal structural patterns in coefficient values when targeting high eccentricity and non-sinusoidal problems, offering insight for future RK method design.
Suggested Citation
Zacharias A. Anastassi, 2025.
"Evolutionary Optimisation of Runge–Kutta Methods for Oscillatory Problems,"
Mathematics, MDPI, vol. 13(17), pages 1-23, August.
Handle:
RePEc:gam:jmathe:v:13:y:2025:i:17:p:2796-:d:1738499
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:17:p:2796-:d:1738499. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.