public class NevilleInterpolator extends java.lang.Object implements UnivariateInterpolator, java.io.Serializable
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 |
---|---|
(package private) static long |
serialVersionUID
serializable version identifier
|
Constructor and Description |
---|
NevilleInterpolator() |
Modifier and Type | Method and Description |
---|---|
PolynomialFunctionLagrangeForm |
interpolate(double[] x,
double[] y)
Computes an interpolating function for the data set.
|
static final long serialVersionUID
public PolynomialFunctionLagrangeForm interpolate(double[] x, double[] y) throws DimensionMismatchException, NumberIsTooSmallException, NonMonotonicSequenceException
interpolate
in interface UnivariateInterpolator
x
- 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 (c) 2003-2013 Apache Software Foundation