| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | IterationController.h | 125 bool converged() const { return m_res <= m_rhsn * m_resmax; } in converged() function
126 bool converged(double nr) in converged() function
131 return converged(); in converged()
133 template<typename VectorType> bool converged(const VectorType &v) in converged() function
134 { return converged(v.squaredNorm()); } in converged()
141 converged(nr); in finished()
144 return (m_nit >= m_maxiter || converged(nr)); in finished()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| D | MultiDirectional.java | 98 boolean converged = true; in iterateSimplex()
100 converged &= checker.converged(iter, original[i], simplex[i]); in iterateSimplex()
102 if (converged) { in iterateSimplex()
|
| D | DirectSearchOptimizer.java | 293 boolean converged = true; in optimize()
295 converged &= checker.converged(iterations, previous[i], simplex[i]); in optimize()
297 if (converged) { in optimize()
|
| D | PowellOptimizer.java | 132 if (getConvergenceChecker().converged(getIterations(), previous, current)) { in doOptimize()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| D | GaussNewtonOptimizer.java | 69 for (boolean converged = false; !converged;) { in doOptimize()
125 converged = checker.converged(getIterations(), previous, current); in doOptimize()
|
| D | NonLinearConjugateGradientOptimizer.java | 149 if (checker.converged(getIterations(), previous, current)) { in doOptimize()
|
| D | LevenbergMarquardtOptimizer.java | 437 if (checker.converged(getIterations(), previous, current)) { in doOptimize()
|
| /external/skia/src/core/ |
| D | SkCubicClipper.cpp | 41 bool converged; in ChopMonoAtY() local
53 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe in ChopMonoAtY()
55 } while (!converged && (iters < maxiters)); in ChopMonoAtY()
62 return converged; in ChopMonoAtY()
|
| /external/opencv/cv/src/ |
| D | cvsnakes.cpp | 89 int converged = 0; in icvSnake8uC1R() local
167 while( !converged ) in icvSnake8uC1R()
172 converged = 0; in icvSnake8uC1R()
387 converged = (moved == 0); in icvSnake8uC1R()
389 converged = 1; in icvSnake8uC1R()
391 converged = 1; in icvSnake8uC1R()
|
| D | cvposit.cpp | 117 int count = 0, converged = 0; in icvPOSIT() local
146 while( !converged ) in icvPOSIT()
233 converged = ((criteria.type & CV_TERMCRIT_EPS) && (diff < criteria.epsilon)); in icvPOSIT()
234 converged |= ((criteria.type & CV_TERMCRIT_ITER) && (count == criteria.max_iter)); in icvPOSIT()
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| D | simplex_downhill.h | 109 bool converged = true; variable
112 converged = false;
115 if (converged) break;
|
| D | kmeans_index.h | 289 , converged(_converged) in KMeansDistanceComputer()
318 converged = false; in operator()
334 bool& converged; variable
776 bool converged = false; in computeClustering() local
778 while (!converged && iteration<iterations_) { in computeClustering()
779 converged = true; in computeClustering()
803 …ce_, dataset_, branching, indices, dcenters, veclen_, count, belongs_to, radiuses, converged, mtx); in computeClustering()
826 converged = false; in computeClustering()
|
| /external/opencv3/modules/calib3d/src/ |
| D | posit.cpp | 118 int count = 0, converged = 0; in icvPOSIT() local
147 while( !converged ) in icvPOSIT()
236 converged = ((criteria.type & CV_TERMCRIT_EPS) && (diff < criteria.epsilon)); in icvPOSIT()
237 converged |= ((criteria.type & CV_TERMCRIT_ITER) && (count == criteria.max_iter)); in icvPOSIT()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
| D | VectorialConvergenceChecker.java | 53 …boolean converged(int iteration, VectorialPointValuePair previous, VectorialPointValuePair current… in converged() method
|
| D | RealConvergenceChecker.java | 53 boolean converged(int iteration, RealPointValuePair previous, RealPointValuePair current); in converged() method
|
| D | SimpleScalarValueChecker.java | 72 public boolean converged(final int iteration, in converged() method in SimpleScalarValueChecker
|
| D | SimpleRealPointChecker.java | 72 public boolean converged(final int iteration, in converged() method in SimpleRealPointChecker
|
| D | SimpleVectorialValueChecker.java | 72 public boolean converged(final int iteration, in converged() method in SimpleVectorialValueChecker
|
| D | SimpleVectorialPointChecker.java | 72 public boolean converged(final int iteration, in converged() method in SimpleVectorialPointChecker
|
| /external/opencv3/doc/py_tutorials/py_ml/py_kmeans/py_kmeans_understanding/ |
| D | py_kmeans_understanding.markdown | 61 Now **Step - 2** and **Step - 3** are iterated until both centroids are converged to fixed points.
|
| /external/ceres-solver/docs/source/ |
| D | version_history.rst | 96 gradient tolerance. i.e., The solver converged when
|
| D | solving.rst | 1885 converged by meeting one of the convergence tolerances or because
1886 the user indicated that it had converged or it ran to the maximum
|
| /external/clang/docs/ |
| D | InternalsManual.rst | 1540 After trying several different approaches, we've finally converged on a design
|