HomeSort by relevance Sort by last modified time
    Searched defs:yLen (Results 1 - 7 of 7) sorted by null

  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/
BicubicSplineInterpolator.java 52 final int yLen = yval.length;
58 final double[][] fX = new double[yLen][xLen];
60 if (fval[i].length != yLen) {
61 throw new DimensionMismatchException(fval[i].length, yLen);
64 for (int j = 0; j < yLen; j++) {
71 // For each line y[j] (0 <= j < yLen), construct a 1D spline with
73 final PolynomialSplineFunction[] ySplineX = new PolynomialSplineFunction[yLen];
74 for (int j = 0; j < yLen; j++) {
86 final double[][] dFdX = new double[xLen][yLen];
87 for (int j = 0; j < yLen; j++)
    [all...]
SmoothingPolynomialBicubicSplineInterpolator.java 86 final int yLen = yval.length;
89 if (fval[i].length != yLen) {
90 throw new DimensionMismatchException(fval[i].length, yLen);
97 // For each line y[j] (0 <= j < yLen), construct a polynomial, with
99 final PolynomialFunction[] yPolyX = new PolynomialFunction[yLen];
100 for (int j = 0; j < yLen; j++) {
111 final double[][] fval_1 = new double[xLen][yLen];
112 for (int j = 0; j < yLen; j++) {
124 for (int j = 0; j < yLen; j++) {
133 final double[][] fval_2 = new double[xLen][yLen];
    [all...]
SmoothingBicubicSplineInterpolator.java 65 final int yLen = yval.length;
71 final double[][] zX = new double[yLen][xLen];
73 if (zval[i].length != yLen) {
74 throw new DimensionMismatchException(zval[i].length, yLen);
77 for (int j = 0; j < yLen; j++) {
84 // For each line y[j] (0 <= j < yLen), construct a 1D spline with
86 final PolynomialSplineFunction[] ySplineX = new PolynomialSplineFunction[yLen];
87 for (int j = 0; j < yLen; j++) {
93 final double[][] zY_1 = new double[xLen][yLen];
94 for (int j = 0; j < yLen; j++)
    [all...]
TricubicSplineInterpolator.java 52 final int yLen = yval.length;
58 final double[][][] fvalXY = new double[zLen][xLen][yLen];
59 final double[][][] fvalZX = new double[yLen][zLen][xLen];
61 if (fval[i].length != yLen) {
62 throw new DimensionMismatchException(fval[i].length, yLen);
65 for (int j = 0; j < yLen; j++) {
87 // For each line y[j] (0 <= j < yLen), construct a 2D spline in z and x
89 = new BicubicSplineInterpolatingFunction[yLen];
90 for (int j = 0; j < yLen; j++) {
102 final double[][][] dFdX = new double[xLen][yLen][zLen]
    [all...]
BicubicSplineInterpolatingFunction.java 100 final int yLen = y.length;
102 if (xLen == 0 || yLen == 0 || f.length == 0 || f[0].length == 0) {
125 final int lastJ = yLen - 1;
129 if (f[i].length != yLen) {
130 throw new DimensionMismatchException(f[i].length, yLen);
132 if (dFdX[i].length != yLen) {
133 throw new DimensionMismatchException(dFdX[i].length, yLen);
135 if (dFdY[i].length != yLen) {
136 throw new DimensionMismatchException(dFdY[i].length, yLen);
138 if (d2FdXdY[i].length != yLen) {
    [all...]
TricubicSplineInterpolatingFunction.java 157 final int yLen = y.length;
160 if (xLen == 0 || yLen == 0 || z.length == 0 || f.length == 0 || f[0].length == 0) {
197 final int lastJ = yLen - 1;
202 if (f[i].length != yLen) {
203 throw new DimensionMismatchException(f[i].length, yLen);
205 if (dFdX[i].length != yLen) {
206 throw new DimensionMismatchException(dFdX[i].length, yLen);
208 if (dFdY[i].length != yLen) {
209 throw new DimensionMismatchException(dFdY[i].length, yLen);
211 if (dFdZ[i].length != yLen) {
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
HeuristicSolver.h 312 yLen = yxeCosts->getRows(),
315 Matrix delta(yLen, zLen);
317 for (unsigned i = 0; i < yLen; ++i) {

Completed in 1316 milliseconds