Examples of PolynomialSplineFunction

org.apache.commons.math.analysis.polynomials.PolynomialSplineFunction
Represents a polynomial spline function.
A polynomial spline function consists of a set of interpolating polynomials and an ascending array of domain knot points, determining the intervals over which the spline function is defined by the constituent polynomials. The polynomials are assumed to have been computed to match the values of another function at the knot points. The value consistency constraints are not currently enforced by PolynomialSplineFunction itself, but are assumed to hold among the polynomials and knot points passed to the constructor.

N.B.: The polynomials in the polynomials property must be centered on the knot points to compute the spline function values. See below.

The domain of the polynomial spline function is [smallest knot, largest knot]. Attempts to evaluate the function at values outside of this range generate IllegalArgumentExceptions.

The value of the polynomial spline function for an argument x is computed as follows:
1. The knot array is searched to find the segment to which x belongs. If x is less than the smallest knot point or greater than the largest one, an IllegalArgumentException is thrown.
2. Let j be the index of the largest knot point that is less than or equal to x. The value returned is
  polynomials[j](x - knot[j])
@version $Revision: 1037327 $ $Date: 2010-11-20 21:57:37 +0100 (sam. 20 nov. 2010) $
org.apache.commons.math3.analysis.polynomials.PolynomialSplineFunction
Represents a polynomial spline function.
A polynomial spline function consists of a set of interpolating polynomials and an ascending array of domain knot points, determining the intervals over which the spline function is defined by the constituent polynomials. The polynomials are assumed to have been computed to match the values of another function at the knot points. The value consistency constraints are not currently enforced by PolynomialSplineFunction itself, but are assumed to hold among the polynomials and knot points passed to the constructor.

N.B.: The polynomials in the polynomials property must be centered on the knot points to compute the spline function values. See below.

The domain of the polynomial spline function is [smallest knot, largest knot]. Attempts to evaluate the function at values outside of this range generate IllegalArgumentExceptions.

The value of the polynomial spline function for an argument x is computed as follows:
1. The knot array is searched to find the segment to which x belongs. If x is less than the smallest knot point or greater than the largest one, an IllegalArgumentException is thrown.
2. Let j be the index of the largest knot point that is less than or equal to x. The value returned is
  polynomials[j](x - knot[j])

Examples of org.apache.commons.math3.analysis.polynomials.PolynomialSplineFunction

     * {@inheritDoc}
     */
    public double value(double x, double y)
        throws OutOfRangeException {
        int index;
        PolynomialSplineFunction spline;
        AkimaSplineInterpolator interpolator = new AkimaSplineInterpolator();
        final int offset = 2;
        final int count = offset + 3;
        final int i = searchIndex(x, xval, offset, count);
        final int j = searchIndex(y, yval, offset, count);


        double xArray[] = new double[count];
        double yArray[] = new double[count];
        double zArray[] = new double[count];
        double interpArray[] = new double[count];


        for (index = 0; index < count; index++) {
            xArray[index] = xval[i + index];
            yArray[index] = yval[j + index];
        }


        for (int zIndex = 0; zIndex < count; zIndex++) {
            for (index = 0; index < count; index++) {
                zArray[index] = fval[i + index][j + zIndex];
            }
            spline = interpolator.interpolate(xArray, zArray);
            interpArray[zIndex] = spline.value(x);
        }


        spline = interpolator.interpolate(yArray, interpArray);


        double returnValue = spline.value(y);


        return returnValue;
    }

View Full Code Here

Examples of org.apache.commons.math3.analysis.polynomials.PolynomialSplineFunction

            coefficients[0] = y[i];
            coefficients[1] = m[i];
            polynomials[i] = new PolynomialFunction(coefficients);
        }


        return new PolynomialSplineFunction(x, polynomials);
    }

View Full Code Here

Examples of org.apache.commons.math3.analysis.polynomials.PolynomialSplineFunction

            coefficients[2] = c[i];
            coefficients[3] = d[i];
            polynomials[i] = new PolynomialFunction(coefficients);
        }


        return new PolynomialSplineFunction(x, polynomials);
    }

View Full Code Here

Examples of org.apache.commons.math3.analysis.polynomials.PolynomialSplineFunction

            coefficients[2] = c[i];
            coefficients[3] = d[i];
            polynomials[i] = new PolynomialFunction(coefficients);
        }


        return new PolynomialSplineFunction(x, polynomials);
    }

View Full Code Here

Examples of org.apache.commons.math3.analysis.polynomials.PolynomialSplineFunction

            coefficients[0] = y[i];
            coefficients[1] = m[i];
            polynomials[i] = new PolynomialFunction(coefficients);
        }


        return new PolynomialSplineFunction(x, polynomials);
    }

View Full Code Here

0 1

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.