T
- the type of the field elementspublic class EulerFieldIntegrator<T extends RealFieldElement<T>> extends RungeKuttaFieldIntegrator<T>
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.
Constructor and Description |
---|
EulerFieldIntegrator(Field<T> field,
T step)
Simple constructor.
|
Modifier and Type | Method and Description |
---|---|
T[][] |
getA()
Get the internal weights from Butcher array (without the first empty row).
|
T[] |
getB()
Get the external weights for the high order method from Butcher array.
|
T[] |
getC()
Get the time steps from Butcher array (without the first zero).
|
integrate, singleStep
addEventHandler, addEventHandler, addStepHandler, clearEventHandlers, clearStepHandlers, computeDerivatives, getCurrentSignedStepsize, getCurrentStepStart, getEvaluations, getEventHandlers, getField, getMaxEvaluations, getName, getStepHandlers, setMaxEvaluations
public T[] getC()
public T[][] getA()
public T[] getB()
Jas4pp 1.5 © Java Analysis Studio for Particle Physics