本文整理汇总了Java中org.apache.commons.math3.analysis.polynomials.PolynomialFunctionNewtonForm类的典型用法代码示例。如果您正苦于以下问题：Java PolynomialFunctionNewtonForm类的具体用法？Java PolynomialFunctionNewtonForm怎么用？Java PolynomialFunctionNewtonForm使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
PolynomialFunctionNewtonForm类属于org.apache.commons.math3.analysis.polynomials包，在下文中一共展示了PolynomialFunctionNewtonForm类的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: interpolate
import org.apache.commons.math3.analysis.polynomials.PolynomialFunctionNewtonForm; //导入依赖的package包/类
/**
* Compute an interpolating function for the dataset.
*
* @param x Interpolating points array.
* @param y Interpolating values array.
* @return a function which interpolates the dataset.
* @throws DimensionMismatchException if the array lengths are different.
* @throws NumberIsTooSmallException if the number of points is less than 2.
* @throws NonMonotonicSequenceException if {@code x} is not sorted in
* strictly increasing order.
*/
public PolynomialFunctionNewtonForm interpolate(double x[], double y[])
throws DimensionMismatchException,
NumberIsTooSmallException,
NonMonotonicSequenceException {
/**
* a[] and c[] are defined in the general formula of Newton form:
* p(x) = a[0] + a[1](x-c[0]) + a[2](x-c[0])(x-c[1]) + ... +
* a[n](x-c[0])(x-c[1])...(x-c[n-1])
*/
PolynomialFunctionLagrangeForm.verifyInterpolationArray(x, y, true);
/**
* When used for interpolation, the Newton form formula becomes
* p(x) = f[x0] + f[x0,x1](x-x0) + f[x0,x1,x2](x-x0)(x-x1) + ... +
* f[x0,x1,...,x[n-1]](x-x0)(x-x1)...(x-x[n-2])
* Therefore, a[k] = f[x0,x1,...,xk], c[k] = x[k].
* <p>
* Note x[], y[], a[] have the same length but c[]'s size is one less.</p>
*/
final double[] c = new double[x.length-1];
System.arraycopy(x, 0, c, 0, c.length);
final double[] a = computeDividedDifference(x, y);
return new PolynomialFunctionNewtonForm(a, c);
}