Copyright | Copyright (c) 2009-2013, David Sorokin <david.sorokin@gmail.com> |
---|---|
License | BSD3 |
Maintainer | David Sorokin <david.sorokin@gmail.com> |
Stability | experimental |
Safe Haskell | Safe-Inferred |
Language | Haskell98 |
Tested with: GHC 7.6.3
This module defines memo functions. The memoization creates such Dynamics
computations, which values are cached in the integration time points. Then
these values are interpolated in all other time points.
- memoDynamics :: Dynamics e -> Simulation (Dynamics e)
- memo0Dynamics :: Dynamics e -> Simulation (Dynamics e)
- iterateDynamics :: Dynamics () -> Simulation (Dynamics ())
Documentation
memoDynamics :: Dynamics e -> Simulation (Dynamics e) Source
Memoize and order the computation in the integration time points using the interpolation that knows of the Runge-Kutta method.
memo0Dynamics :: Dynamics e -> Simulation (Dynamics e) Source
Memoize and order the computation in the integration time points using
the discreteDynamics
interpolation. It consumes less memory than the memoDynamics
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
prefer the memo0Dynamics
function above memoDynamics
.
iterateDynamics :: Dynamics () -> Simulation (Dynamics ()) Source
Iterate sequentially the dynamic process with side effects in
the integration time points. It is equivalent to a call of the
memo0Dynamics
function but significantly more efficient, for the array
is not created.