Lines Matching defs:polynomials
17 package org.apache.commons.math.analysis.polynomials;
31 * <i>interpolating polynomials</i> and an ascending array of domain
33 * is defined by the constituent polynomials. The polynomials are assumed to
37 * the polynomials and knot points passed to the constructor.</p>
39 * N.B.: The polynomials in the <code>polynomials</code> property must be
57 * <code>polynomials[j](x - knot[j])</code></li></ol></p>
74 private final PolynomialFunction polynomials[];
77 * Number of spline segments = number of polynomials
85 * and interpolating polynomials.
88 * and polynomials properties, respectively.</p>
91 * @param polynomials polynomial functions that make up the spline
94 * <code>polynomials.length != knots.length - 1 </code>, or the knots array
98 public PolynomialSplineFunction(double knots[], PolynomialFunction polynomials[]) {
104 if (knots.length - 1 != polynomials.length) {
107 polynomials.length, knots.length);
117 this.polynomials = new PolynomialFunction[n];
118 System.arraycopy(polynomials, 0, this.polynomials, 0, n);
141 //There are only n-1 polynomials, so if v is the last knot
143 if ( i >= polynomials.length ) {
146 return polynomials[i].value(v - knots[i]);
165 derivativePolynomials[i] = polynomials[i].polynomialDerivative();
171 * Returns the number of spline segments = the number of polynomials
181 * Returns a copy of the interpolating polynomials array.
184 * not affect the polynomials property.</p>
186 * @return the interpolating polynomials
190 System.arraycopy(polynomials, 0, p, 0, n);
