DynIbex
by Julien Alexandre dit Sandretto, Alexandre Chapoutot and Olivier Mullier
Visit the home page: https://perso.ensta-paris.fr/~chapoutot/dynibex/
Description
DynIbex is a plug-in of Ibex (a library for constraint processing over real numbers). DynIbex offers a set of verified methods based on Runge-Kutta schemes for solving IVPs for ODEs and for DAEs in Hessenberg index 1 form. .
Written in the C++ programming language.
Characteristics
Verification concepts:
- Result Verification
Methods:
- Runge-Kutta Based Schemes With Intervals And Affine Forms
Parameters:
- Arithmetic
- Method
- Abs. Tolerance
- Initial Stepsize
- Min. Stepsize
- Monotonicity
Default settings for this solver:
Setting 1:
- Arithmetic: Interval
- Method: 7
- Abs. Tolerance: 1e-12
- Initial Stepsize: 1e-3
- Min. Stepsize: 1e-5
- Monotonicity: 0
- Arithmetic: Interval
- Method: 7
- Abs. Tolerance: 1e-12
- Initial Stepsize: 1e-3
- Min. Stepsize: 1e-5
- Monotonicity: 1
- Arithmetic: Interval
- Method: 9
- Abs. Tolerance: 1e-12
- Initial Stepsize: 1e-3
- Min. Stepsize: 1e-5
- Monotonicity: 0
The following problems from the VERICOMP database have been
tested with this solver: