does boost odeint have a leapfrog algorithm?

Question

I am using boost::odeint and so far I was using the runge_kutta4 stepper. Now I would like to switch to a leapfrog method, e.g. my iteration step should look like:

f(t+dt) = f(t-dt) - p * f(t)

So I need a multistep method, but I am a bit lost with the documentation and would like to get some help.

Answer 1

The leap-frog is currently not implemented. But it should be easy to implement with the help of the Adam-Bashforth method. I have opened a ticket in our issue tracker: https://github.com/headmyshoulder/odeint-v2/issues/119