| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/ |
| D | EventState.java | 52 private final double convergence; field in EventState
96 final double convergence, final int maxIterationCount) { in EventState() argument
99 this.convergence = FastMath.abs(convergence); in EventState()
132 return convergence; in getConvergence()
205 if (FastMath.abs(t1 - t0) < convergence) { in evaluateStep()
209 final double start = forward ? (t0 + convergence) : t0 - convergence; in evaluateStep()
242 final BrentSolver solver = new BrentSolver(convergence); in evaluateStep()
252 final double epsilon = (forward ? 0.25 : -0.25) * convergence; in evaluateStep()
277 (FastMath.abs(root - ta) <= convergence) && in evaluateStep()
278 (FastMath.abs(root - previousEventTime) <= convergence)) { in evaluateStep()
[all …]
|
| D | CombinedEventsManager.java | 71 final double convergence, final int maxIterationCount) { in addEventHandler() argument
73 convergence, maxIterationCount)); in addEventHandler()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
| D | GaussNewtonEstimator.java | 60 private double convergence; field in GaussNewtonEstimator
72 this.convergence = DEFAULT_CONVERGENCE; in GaussNewtonEstimator()
106 public GaussNewtonEstimator(final int maxCostEval, final double convergence, in GaussNewtonEstimator() argument
110 this.convergence = convergence; in GaussNewtonEstimator()
118 public void setConvergence(final double convergence) { in setConvergence() argument
119 this.convergence = convergence; in setConvergence()
227 (FastMath.abs(cost) > convergence))); in estimate()
|
| /external/linux-tools-perf/src/tools/perf/bench/ |
| D | numa.c | 888 static void calc_convergence(double runtime_ns_max, double *convergence) in calc_convergence() argument
980 if (!*convergence) { in calc_convergence()
981 *convergence = runtime_ns_max; in calc_convergence()
982 tprintf(" (%6.1fs converged)\n", *convergence/1e9); in calc_convergence()
989 if (*convergence) { in calc_convergence()
991 *convergence = 0; in calc_convergence()
997 static void show_summary(double runtime_ns_max, int l, double *convergence) in show_summary() argument
1002 calc_convergence(runtime_ns_max, convergence); in show_summary()
1018 double convergence = 0; in worker_thread() local
1172 show_summary(runtime_ns_max, l, &convergence); in worker_thread()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
| D | ODEIntegrator.java | 77 double convergence, int maxIterationCount); in addEventHandler() argument
|
| D | AbstractIntegrator.java | 124 final double convergence, in addEventHandler() argument
126 eventsStates.add(new EventState(handler, maxCheckInterval, convergence, maxIterationCount)); in addEventHandler()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/jacobians/ |
| D | FirstOrderIntegratorWithJacobians.java | 156 double convergence, in addEventHandler() argument
161 maxCheckInterval, convergence, maxIterationCount); in addEventHandler()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| D | GraggBulirschStoerIntegrator.java | 347 final double convergence, in addEventHandler() argument
349 super.addEventHandler(function, maxCheckInterval, convergence, maxIterationCount); in addEventHandler()
|
| /external/llvm/test/CodeGen/X86/ |
| D | avx-vzeroupper.ll | 53 ;; Test the pass convergence and also that vzeroupper is only issued when necessary,
|
| /external/ceres-solver/docs/source/ |
| D | faqs.rst | 46 convergence behaviour.
164 When diagnosing Ceres performance issues - runtime and convergence,
|
| D | bibliography.rst | 52 **Levenberg–Marquardt methods with strong local convergence
|
| D | tutorial.rst | 151 discuss these issues in greater detail when we talk about convergence
162 small and declared convergence. Ceres only prints out the display at
164 convergence, which is why you only see two iterations here and not
232 expensive, prone to numeric errors, and leads to slower convergence.**
|
| D | solving.rst | 206 sequence :math:`\eta_k \leq \eta_0 < 1` and the rate of convergence
295 Wedin present a simpler algorithm with comparable convergence
323 complexity, but also displays better convergence behavior per
346 preserving its convergence properties.
665 The convergence rate of Conjugate Gradients for
693 based preconditioners have much better convergence behavior than the
868 convergence in a wide variety of cases. Setting
886 **not** *always* improve convergence, and that it can in fact
920 can still guarantee convergence if instead of an exact solution,
1885 converged by meeting one of the convergence tolerances or because
|
| D | version_history.rst | 79 #. The enum used for reporting the termination/convergence status of
568 convergence behavior of the solver at a small increase in run time.
|
| D | modeling.rst | 959 convergence can be improved by starting out with a large scale,
961 better convergence behavior than just using a loss function with a
|
| /external/eigen/doc/ |
| D | SparseLinearSystems.dox | 26 <td>To speedup the convergence, try it with the \ref IncompleteLUT preconditioner.</td></tr>
121 …mber that, basically, the goal of the preconditioner is to speedup the convergence of an iterative…
|
| D | TopicLinearAlgebraDecompositions.dox | 230 …lues, SVD and Schur decompositions rely on iterative algorithms. Their convergence speed depends o…
|
| /external/jpeg/ |
| D | README | 366 force convergence on common, open format standards for JPEG files. Don't
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/about_files/ |
| D | IJG_README | 366 force convergence on common, open format standards for JPEG files. Don't
|
| /external/libxml2/ |
| D | ChangeLog | 18492 libxml1 libxml2 convergence.
|