# Crate fast_ode

Expand description

This crate is (afaik) the fastest implementation of the explicit Runge-Kutta method of order 5(4) with the Dormand-Prince pair of formulas. It is identical to scipy’s implementation. This crate can be used to solve ordinary differential equations.

### Example:

``````struct HarmonicOde {}
impl fast_ode::DifferentialEquation<2> for HarmonicOde {
fn ode_dot_y(&self, _t: f64, y: &fast_ode::Coord<2>) -> (fast_ode::Coord<2>, bool) {
let x = y.0[0];
let v = y.0[1];
(fast_ode::Coord::<2>([v, -x]), true)
}
}
let ode = HarmonicOde {};
let res = fast_ode::solve_ivp(&ode, (0., 10.), fast_ode::Coord([0., 1.]), |_, _| true, 1e-6, 1e-3);
let numerical_sol = match res {
fast_ode::IvpResult::FinalTimeReached(y) => y.0,
_ => panic!(),
};
let theoretical_sol = [10_f64.sin(), 10_f64.cos()];
assert!(numerical_sol[0]-theoretical_sol[0] < 1e-2);
assert!(numerical_sol[1]-theoretical_sol[1] < 1e-2);``````

## Enums

Returned by solve_ivp

## Functions

Solves an initial value problem: