public class EulerIntegrator extends RungeKuttaIntegrator
The Euler algorithm is the simplest one that can be used to integrate ordinary differential equations. It is a simple
inversion of the forward difference expression : f'=(f(t+h)-f(t))/h which leads to
f(t+h)=f(t)+hf'. The interpolation scheme used for dense output is the linear scheme already used for
integration.
This algorithm looks cheap because it needs only one function evaluation per step. However, as it uses linear estimates, it needs very small steps to achieve high accuracy, and small steps lead to numerical errors and instabilities.
This algorithm is almost never used and has been included in this package only as a comparison reference for more useful integrators.
MidpointIntegrator,
ClassicalRungeKuttaIntegrator,
GillIntegrator,
ThreeEighthesIntegratorisLastStep, lastStepHandle, resetOccurred, stepHandlers, stepSize, stepStart| Constructor and Description |
|---|
EulerIntegrator(double step)
Simple constructor.
|
integrateacceptStep, addEventHandler, addEventHandler, addStepHandler, clearEventHandlers, clearStepHandlers, computeDerivatives, getCurrentSignedStepsize, getCurrentStepStart, getEvaluations, getEventHandlers, getMaxEvaluations, getName, getStepHandlers, handleLastStep, initIntegration, integrate, removeEventState, sanityChecks, setEquations, setMaxEvaluations, setStateInitializedaddObserver, clearChanged, countObservers, deleteObserver, deleteObservers, hasChanged, notifyObservers, notifyObservers, setChangedCopyright © 2019 CNES. All rights reserved.