public class NevilleInterpolator extends Object implements UnivariateInterpolator, Serializable
The actual code of Neville's algorithm is in PolynomialFunctionLagrangeForm, this class provides an easy-to-use interface to it.
| Constructor and Description |
|---|
NevilleInterpolator() |
| Modifier and Type | Method and Description |
|---|---|
PolynomialFunctionLagrangeForm |
interpolate(double[] x,
double[] y)
Computes an interpolating function for the data set.
|
public PolynomialFunctionLagrangeForm interpolate(double[] x, double[] y) throws DimensionMismatchException, NumberIsTooSmallException, NonMonotonicSequenceException
interpolate in interface UnivariateInterpolatorx - Interpolating points.y - Interpolating values.DimensionMismatchException - if the array lengths are different.NumberIsTooSmallException - if the number of points is less than 2.NonMonotonicSequenceException - if two abscissae have the same
value.Copyright © 2003–2016 The Apache Software Foundation. All rights reserved.