HomeSort by relevance Sort by last modified time
    Searched refs:simplex (Results 1 - 4 of 4) sorted by null

  /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/
MultiDirectional.java 70 final RealPointValuePair[] original = simplex;
77 // compute the expanded simplex
78 final RealPointValuePair[] reflectedSimplex = simplex;
81 // accept the reflected simplex
82 simplex = reflectedSimplex;
89 // compute the contracted simplex
92 // accept the contracted simplex
99 for (int i = 0; i < simplex.length; ++i) {
100 converged &= checker.converged(iter, original[i], simplex[i]);
110 /** Compute and evaluate a new simplex
    [all...]
DirectSearchOptimizer.java 37 * This class implements simplex-based direct search optimization
52 * <p>Simplex-based direct search methods are based on comparison of
53 * the objective function values at the vertices of a simplex (which is a
57 * <p>The initial configuration of the simplex can be set using either
74 * previous and current simplex to the convergence checker, not the best ones.</p>
76 * <p>This class is the base class performing the boilerplate simplex
77 * initialization and handling. The simplex update by itself is
91 /** Simplex. */
92 protected RealPointValuePair[] simplex; field in class:DirectSearchOptimizer
112 /** Start simplex configuration. *
    [all...]
NelderMead.java 79 // the simplex has n+1 point if dimension is n
80 final int n = simplex.length - 1;
83 final RealPointValuePair best = simplex[0];
84 final RealPointValuePair secondBest = simplex[n-1];
85 final RealPointValuePair worst = simplex[n];
92 final double[] x = simplex[i].getPointRef();
167 final double[] xSmallest = simplex[0].getPointRef();
168 for (int i = 1; i < simplex.length; ++i) {
169 final double[] x = simplex[i].getPoint();
173 simplex[i] = new RealPointValuePair(x, Double.NaN, false)
    [all...]
  /external/mesa3d/src/mesa/program/
prog_noise.c 34 * \brief C implementation of Perlin Simplex Noise over 1, 2, 3 and 4 dims.
38 * This implementation is "Simplex Noise" as presented by
140 * (The simplex noise functions as such also have different scaling.)
187 * A lookup table to traverse the simplex around a given point in 4D.
191 static const unsigned char simplex[64][4] = { variable
211 /** 1D simplex noise */
237 /** 2D simplex noise */
246 /* Skew the input space to determine which simplex cell we're in */
263 /* For the 2D case, the simplex shape is an equilateral triangle. */
264 /* Determine which simplex we are in. *
    [all...]

Completed in 300 milliseconds