The actual code of Neville's evaluation is in PolynomialFunctionLagrangeForm, this class provides an easy-to-use interface to it.
| Modifier and Type | Field and Description |
|---|---|
| private static final long | serialVersionUID
serializable version identifier |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| protected static double[] | Returns: a fresh copy of the divided difference array.Interpolating points array. x, final double[] Interpolating values array. y)Return a copy of the divided difference array. |
| public PolynomialFunctionNewtonForm | Returns: a function which interpolates the dataset.Interpolating points array. x, double[] Interpolating values array. y)Implements org. Compute an interpolating function for the dataset. |
| serialVersionUID | back to summary |
|---|---|
| private static final long serialVersionUID serializable version identifier | |
| DividedDifferenceInterpolator | back to summary |
|---|---|
| public DividedDifferenceInterpolator() | |
| computeDividedDifference | back to summary |
|---|---|
| protected static double[] computeDividedDifference(final double[] x, final double[] y) throws DimensionMismatchException, NumberIsTooSmallException, NonMonotonicSequenceException Return a copy of the divided difference array. The divided difference array is defined recursively by f[x0] = f(x0) f[x0,x1,...,xk] = (f[x1,...,xk] - f[x0,...,x[k-1]]) / (xk - x0)
The computational complexity is \(O(n^2)\) where \(n\) is the common
length of
| |
| interpolate | back to summary |
|---|---|
| public PolynomialFunctionNewtonForm interpolate(double[] x, double[] y) throws DimensionMismatchException, NumberIsTooSmallException, NonMonotonicSequenceException Implements org. Compute an interpolating function for the dataset.
| |