|Maintainer||David Sorokin <email@example.com>|
Tested with: GHC 7.6.3
This module defines memo functions. The memoization creates such
computations, which values are cached in the integration time points. Then
these values are interpolated in all other time points.
Memoize and order the computation in the integration time points using the interpolation that knows of the Runge-Kutta method.
Memoize and order the computation in the integration time points using
discreteDynamics interpolation. It consumes less memory than the
function but it is not aware of the Runge-Kutta method. There is a subtle
difference when we request for values in the intermediate time points
that are used by this method to integrate. In general case you should
memo0Dynamics function above