| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
| SimpleRealPointChecker.java | 27 * Convergence is considered to have been reached if either the relative
|
| SimpleVectorialPointChecker.java | 27 * Convergence is considered to have been reached if either the relative
|
| SimpleVectorialValueChecker.java | 27 * Convergence is considered to have been reached if either the relative
|
| package.html | 22 provided in sub-packages. The main interfaces defines optimizers and convergence
|
| /external/ceres-solver/include/ceres/ |
| types.h | 219 // Broyden, C.G., "The Convergence of a Class of Double-rank Minimization
311 // Minimizer terminated because one of the convergence criterion set
319 CONVERGENCE,
322 // of time specified by the user, but none of the convergence
|
| /external/ceres-solver/internal/ceres/ |
| conjugate_gradients_solver.h | 49 // convergence rate. Modern references for Conjugate Gradients are the
|
| trust_region_minimizer.cc | 230 summary->termination_type = CONVERGENCE;
457 // Convergence based on parameter_tolerance.
467 summary->termination_type = CONVERGENCE;
481 summary->termination_type = CONVERGENCE;
606 summary->termination_type = CONVERGENCE;
671 summary->termination_type = CONVERGENCE;
|
| line_search_minimizer.cc | 153 summary->termination_type = CONVERGENCE;
386 summary->termination_type = CONVERGENCE;
400 summary->termination_type = CONVERGENCE;
|
| /external/eigen/unsupported/doc/examples/ |
| PolynomialSolver1.cpp | 26 cout << "Illustration of the convergence problem with the QR algorithm: " << endl;
|
| /external/webrtc/webrtc/modules/audio_processing/aecm/ |
| aecm_defines.h | 29 #define CONV_LEN 512 /* Convergence length used at startup. */
|
| /frameworks/base/libs/common_time/ |
| clock_recovery.h | 70 // output smoother, but slow convergence.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/distribution/ |
| AbstractContinuousDistribution.java | 84 * computed due to convergence or other numerical errors.
133 // Failed bracket convergence was not because of corner solution
|
| BinomialDistributionImpl.java | 163 * due to convergence or other numerical errors.
208 * computed due to convergence or other numerical errors.
|
| ChiSquaredDistributionImpl.java | 140 * computed due to convergence or other numerical errors.
155 * computed due to convergence or other numerical errors.
|
| ExponentialDistributionImpl.java | 141 * computed due to convergence or other numerical errors.
162 * computed due to convergence or other numerical errors.
|
| PascalDistributionImpl.java | 156 * due to convergence or other numerical errors
197 * computed due to convergence or other numerical errors.
|
| TDistributionImpl.java | 127 * computed due to convergence or other numerical errors.
159 * computed due to convergence or other numerical errors.
|
| FDistributionImpl.java | 113 * computed due to convergence or other numerical errors.
139 * computed due to convergence or other numerical errors.
|
| GammaDistributionImpl.java | 92 * computed due to convergence or other numerical errors.
115 * computed due to convergence or other numerical errors.
|
| /external/llvm/tools/bugpoint/ |
| ListReducer.h | 98 // distribution (improving the speed of convergence).
173 // improve the convergence speed.
|
| /toolchain/binutils/binutils-2.25/gold/ |
| icf.cc | 40 // done repeatedly until convergence is obtained. Here is an example for
52 // assigning identical functions to the same group, until convergence is
60 // for convergence. We can stop at any point and correctness will be
63 // convergence. Here is an example with mutually recursive functions :
75 // convergence, cannot detect that they are identical. It should be noted
82 // the checksumming until convergence. This can detect the above case
84 // However, the caveat is that it has to be run to convergence. It cannot
89 // iterations are more than enough to achieve convergence. Algorithm I can
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| GraggBulirschStoerIntegrator.java | 347 final double convergence,
349 super.addEventHandler(function, maxCheckInterval, convergence, maxIterationCount);
724 // check convergence
732 // convergence have been reached just before targetIter
735 // estimate if there is a chance convergence will
759 // convergence has been reached exactly at targetIter
762 // estimate if there is a chance convergence will
[all...] |
| /external/webrtc/webrtc/modules/audio_processing/aec/ |
| system_delay_unittest.cc | 89 // Requirement for a stable device convergence time in ms. Should converge in
93 // Maximum convergence time in ms. This means that we should leave the startup
158 // Verify convergence time.
289 // Verify convergence time.
351 // Verify convergence time.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| DirectSearchOptimizer.java | 73 * <p>Convergence is checked by providing the <em>worst</em> points of
74 * previous and current simplex to the convergence checker, not the best ones.</p>
97 /** Convergence checker. */
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| UnivariateRealSolverImpl.java | 151 * or the solver detects convergence problems otherwise.
175 * or the solver detects convergence problems otherwise.
|
