| /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/vulkan-validation-layers/libs/glm/gtc/ |
| noise.hpp | 36 /// Following Stefan Gustavson's paper "Simplex noise demystified":
70 /// Simplex noise.
73 GLM_FUNC_DECL T simplex(
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
| b2Distance.cpp | 120 // Compute the new simplex metric, if it is substantially different than
121 // old metric then flush the simplex.
128 // Reset the simplex.
456 // Initialize the simplex.
457 b2Simplex simplex; local
458 simplex.ReadCache(cache, proxyA, transformA, proxyB, transformB);
460 // Get simplex vertices as an array.
461 b2SimplexVertex* vertices = &simplex.m_v1;
464 // These store the vertices of the last simplex so that we
476 // Copy simplex so we can identify duplicates
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/ |
| btGjkEpa2.cpp | 200 /* Initialize simplex */
234 {/* Return old simplex */
246 {/* Return old simplex */
250 /* Reduce simplex */
289 {/* Return old simplex */
377 void removevertice(sSimplex& simplex)
379 m_free[m_nfree++]=simplex.c[--simplex.rank];
381 void appendvertice(sSimplex& simplex,const btVector3& v)
383 simplex.p[simplex.rank]=0
596 GJK::sSimplex& simplex=*gjk.m_simplex; local
[all...] |
| btGjkEpa3.h | 203 /* Initialize simplex */
237 {/* Return old simplex */
249 {/* Return old simplex */
253 /* Reduce simplex */
292 {/* Return old simplex */
380 void removevertice(sSimplex& simplex)
382 m_free[m_nfree++]=simplex.c[--simplex.rank];
384 void appendvertice(sSimplex& simplex,const btVector3& v)
386 simplex.p[simplex.rank]=0
606 typename GJK<btConvexTemplate>::sSimplex& simplex=*gjk.m_simplex; local
[all...] |
| /external/opencv3/modules/core/src/ |
| downhill_simplex.cpp | 55 Downhill Simplex method in OpenCV dev 3.0.0 getting this error:
132 ****Suggesttion for imporving Simplex implentation***************************************************************************************
134 Currently the downhilll simplex method outputs the function value that is minimized. It should also return the coordinate points where the
189 Mat x = x_.getMat(), simplex; local
191 createInitialSimplex(x, simplex, _step);
193 double res = innerDownhillSimplex(simplex,_termcrit.epsilon, _termcrit.epsilon,
199 Mat simplex_0m(x.rows, x.cols, CV_64F, simplex.ptr<double>());
205 simplex.row(0).convertTo(x_, x_type);
235 inline void createInitialSimplex( const Mat& x0, Mat& simplex, Mat& step )
245 simplex.create(ndim + 1, ndim, CV_64F)
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/ |
| Distance.java | 105 private class Simplex {
131 // Compute the new simplex metric, if it is substantially different than
132 // old metric then flush the simplex.
137 // Reset the simplex.
602 private Simplex simplex = new Simplex(); field in class:Distance
612 * PolygonShape. The simplex cache is input/output. On the first call set SimplexCache.count to
629 // Initialize the simplex.
630 simplex.readCache(cache, proxyA, transformA, proxyB, transformB)
[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 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...] |
