The actual code of Neville's algorithm is in PolynomialFunctionLagrangeForm, this class provides an easy-to-use interface to it.
| Modifier and Type | Field and Description |
|---|---|
| pack-priv static final long | serialVersionUID
serializable version identifier |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public PolynomialFunctionLagrangeForm | Returns: a function which interpolates the data setInterpolating points. x, double[] Interpolating values. y)Implements org. Computes an interpolating function for the data set. |
| serialVersionUID | back to summary |
|---|---|
| pack-priv static final long serialVersionUID serializable version identifier | |
| NevilleInterpolator | back to summary |
|---|---|
| public NevilleInterpolator() | |
| interpolate | back to summary |
|---|---|
| public PolynomialFunctionLagrangeForm interpolate(double[] x, double[] y) throws DimensionMismatchException, NumberIsTooSmallException, NonMonotonicSequenceException Implements org. Computes an interpolating function for the data set.
| |