Runge–Kutta Theory and Constraint Programming

Abstract : There exist many Runge–Kutta methods (explicit or implicit), more or less adapted to specific problems. Some of them have interesting properties , such as stability for stiff problems or symplectic capability for problems with energy conservation. Defining a new method suitable to a given problem has become a challenge. The size, the complexity and the order do not stop growing. This race to the best method is interesting but an important unsolved problem. Indeed, the coefficients of Runge–Kutta methods are harder and harder to compute, and the result is often expressed in floating-point numbers, which may lead to erroneous integration schemes. Here, we propose to use interval analysis tools to compute Runge–Kutta coefficients. In particular, we use a solver based on guaranteed constraint programming. Moreover, with a global optimization process and a well chosen cost function, we propose a way to define some novel optimal Runge–Kutta methods.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01762191
Contributor : Julien Alexandre Dit Sandretto <>
Submitted on : Thursday, April 12, 2018 - 10:56:00 AM
Last modification on : Wednesday, July 3, 2019 - 10:48:05 AM

Identifiers

  • HAL Id : hal-01762191, version 1

Citation

Julien Alexandre Dit Sandretto. Runge–Kutta Theory and Constraint Programming. Reliable Computing Journal, 2017. ⟨hal-01762191⟩

Share

Metrics

Record views

91

Files downloads

155