/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/math/ |
H A D | root.h | 47 const size_t max_iterations, 59 const size_t max_iterations, 72 const size_t max_iterations, 86 const size_t max_iterations, 100 const size_t max_iterations, in find_root_bisection() argument 109 for (size_t i = 0; i < max_iterations; ++i) in find_root_bisection() 143 const size_t max_iterations, in find_root_newton() argument 155 for (size_t i = 0; i < max_iterations; ++i) in find_root_newton() 178 const size_t max_iterations, in find_multiple_roots_bisection() argument 203 const size_t max_iterations, in find_multiple_roots_newton() argument [all …]
|
/dports/databases/cassandra-cpp-driver/cpp-driver-2.16.0/tests/src/unit/tests/ |
H A D | test_random.cpp | 242 const int max_iterations = num_elements * num_elements; in TEST() local 251 for (count = 0; count < max_iterations; ++count) { in TEST() 259 ASSERT_NE(count, max_iterations); in TEST() 263 const int max_iterations = 10; in TEST() local 270 for (count = 0; count < max_iterations; ++count) { in TEST() 277 ASSERT_NE(count, max_iterations); in TEST()
|
/dports/math/stan/stan-2.28.2/src/test/unit/services/experimental/advi/ |
H A D | defaults_test.cpp | 29 TEST(experimental_advi_defaults, max_iterations) { in TEST() argument 30 using stan::services::experimental::advi::max_iterations; in TEST() 32 max_iterations::description()); in TEST() 34 EXPECT_NO_THROW(max_iterations::validate(max_iterations::default_value())); in TEST() 35 EXPECT_NO_THROW(max_iterations::validate(1)); in TEST() 36 EXPECT_THROW(max_iterations::validate(0), std::invalid_argument); in TEST() 38 EXPECT_EQ(10000, max_iterations::default_value()); in TEST()
|
/dports/science/py-dlib/dlib-19.22/dlib/svm/ |
H A D | svm_rank_trainer.h | 47 max_iterations(max_iter), in oca_problem_ranking_svm() 85 if (num_iterations >= max_iterations) in optimization_status() 177 const unsigned long max_iterations; variable 193 const unsigned long max_iterations, in make_oca_problem_ranking_svm() argument 198 C, samples, be_verbose, eps, max_iterations, dims); in make_oca_problem_ranking_svm() 228 max_iterations = 10000; in svm_rank_trainer() 248 max_iterations = 10000; in svm_rank_trainer() 272 ) const { return max_iterations; } in get_max_iterations() 278 max_iterations = max_iter; in set_max_iterations() 436 … solver( make_oca_problem_ranking_svm<w_type>(C, samples, verbose, eps, max_iterations, dims), in train() [all …]
|
H A D | svr_linear_trainer.h | 49 max_iterations(max_iter) in oca_problem_linear_svr() 89 if (num_iterations >= max_iterations) in optimization_status() 153 const unsigned long max_iterations; variable 170 const unsigned long max_iterations in make_oca_problem_linear_svr() argument 174 C, samples, targets, be_verbose, eps, eps_insensitivity, max_iterations); in make_oca_problem_linear_svr() 204 max_iterations = 10000; in svr_linear_trainer() 225 max_iterations = 10000; in svr_linear_trainer() 269 ) const { return max_iterations; } in get_max_iterations() 275 max_iterations = max_iter; in set_max_iterations() 385 …_problem_linear_svr<w_type>(C, samples, targets, verbose, eps, eps_insensitivity, max_iterations), in train() [all …]
|
/dports/science/dlib-cpp/dlib-19.22/dlib/svm/ |
H A D | svm_rank_trainer.h | 47 max_iterations(max_iter), in oca_problem_ranking_svm() 85 if (num_iterations >= max_iterations) in optimization_status() 177 const unsigned long max_iterations; variable 193 const unsigned long max_iterations, in make_oca_problem_ranking_svm() argument 198 C, samples, be_verbose, eps, max_iterations, dims); in make_oca_problem_ranking_svm() 228 max_iterations = 10000; in svm_rank_trainer() 248 max_iterations = 10000; in svm_rank_trainer() 272 ) const { return max_iterations; } in get_max_iterations() 278 max_iterations = max_iter; in set_max_iterations() 436 … solver( make_oca_problem_ranking_svm<w_type>(C, samples, verbose, eps, max_iterations, dims), in train() [all …]
|
H A D | svr_linear_trainer.h | 49 max_iterations(max_iter) in oca_problem_linear_svr() 89 if (num_iterations >= max_iterations) in optimization_status() 153 const unsigned long max_iterations; variable 170 const unsigned long max_iterations in make_oca_problem_linear_svr() argument 174 C, samples, targets, be_verbose, eps, eps_insensitivity, max_iterations); in make_oca_problem_linear_svr() 204 max_iterations = 10000; in svr_linear_trainer() 225 max_iterations = 10000; in svr_linear_trainer() 269 ) const { return max_iterations; } in get_max_iterations() 275 max_iterations = max_iter; in set_max_iterations() 385 …_problem_linear_svr<w_type>(C, samples, targets, verbose, eps, eps_insensitivity, max_iterations), in train() [all …]
|
/dports/graphics/tesseract/tesseract-5.0.0/src/training/ |
H A D | lstmtraining.cpp | 60 static INT_PARAM_FLAG(max_iterations, 0, "If set, exit after this many iterations"); 208 int max_iterations = FLAGS_max_iterations; in main() local 209 if (max_iterations < 0) { in main() 211 max_iterations = filenames.size() * (-max_iterations); in main() 212 } else if (max_iterations == 0) { in main() 214 max_iterations = INT_MAX; in main() 221 iteration < target_iteration && iteration < max_iterations; in main() 229 (trainer.training_iteration() < max_iterations)); in main()
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/examples/task_arena/fractal/ |
H A D | fractal.h | 39 unsigned int max_iterations; variable 76 void quality_inc() { max_iterations += max_iterations/2; } in quality_inc() 77 void quality_dec() { max_iterations -= max_iterations/2; } in quality_dec() 114 unsigned int max_iterations = 100000, int num_frames = 1 );
|
/dports/devel/tbb/oneTBB-2020.3/examples/task_arena/fractal/ |
H A D | fractal.h | 39 unsigned int max_iterations; variable 76 void quality_inc() { max_iterations += max_iterations/2; } in quality_inc() 77 void quality_dec() { max_iterations -= max_iterations/2; } in quality_dec() 114 unsigned int max_iterations = 100000, int num_frames = 1 );
|
/dports/devel/onetbb/oneTBB-2021.4.0/examples/task_arena/fractal/ |
H A D | fractal.hpp | 39 unsigned int max_iterations; member in fractal 91 max_iterations += max_iterations / 2; in quality_inc() 94 max_iterations -= max_iterations / 2; in quality_dec() 129 unsigned int max_iterations = 100000,
|
/dports/benchmarks/p5-Dumbbench/Dumbbench-0.501/lib/ |
H A D | Dumbbench.pm | 40 max_iterations => 10000, 125 my $max_iterations = $self->max_iterations; 132 $max_iterations *= 10; 178 if (not $n_good and @timings >= $max_iterations) { 202 last if not $need_iter or @timings >= $max_iterations; 207 my $n = List::Util::min( $max_iterations - @timings, List::Util::max(1, @timings*0.05) ); 211 if (@timings >= $max_iterations and not $dry) {
|
/dports/graphics/graphviz/graphviz-2.44.1/lib/neatogen/ |
H A D | conjgrad.c | 27 int max_iterations) { in conjugate_gradient() argument 49 for (i = 0; i < max_iterations && max_abs(n, r) > tol; i++) { in conjugate_gradient() 61 if (i < max_iterations - 1) { /* not last iteration */ in conjugate_gradient() 100 int max_iterations, boolean ortho1) { in conjugate_gradient_f() argument 124 for (i = 0; i < max_iterations && max_abs(n, r) > tol; i++) { in conjugate_gradient_f() 136 if (i < max_iterations - 1) { /* not last iteration */ in conjugate_gradient_f() 169 double tol, int max_iterations) in conjugate_gradient_mkernel() argument 197 for (i = 0; i < max_iterations && max_absf(n, r) > tol; i++) { in conjugate_gradient_mkernel() 215 if (i < max_iterations - 1) { /* not last iteration */ in conjugate_gradient_mkernel()
|
/dports/devel/py-bullet3/bullet3-3.21/examples/pybullet/gym/pybullet_envs/minitaur/envs_v2/ |
H A D | curriculum_reset_helpers.py | 13 max_iterations=500, argument 30 gap_length = initial_gap_length + gap_delta * min(max_iterations, num_iter) 41 max_iterations=500, argument 60 next_x = initial_second_block_x + gap_delta * min(max_iterations, num_iter)
|
/dports/biology/infernal/infernal-1.1.3/easel/ |
H A D | esl_minimizer.c | 108 int max_iterations = cfg ? cfg->max_iterations : eslMIN_MAXITER; in esl_min_ConjugateGradientDescent() local 156 for (i = 1; i <= max_iterations; i++) in esl_min_ConjugateGradientDescent() 245 return (i > max_iterations ? eslENOHALT: eslOK); in esl_min_ConjugateGradientDescent() 276 cfg->max_iterations = eslMIN_MAXITER; in esl_min_cfg_Create() 321 int max_iterations = cfg ? cfg->max_iterations : eslMIN_MAXITER; in esl_min_dat_Create() local 334 ESL_ALLOC(dat->fx, sizeof(double) * (max_iterations + 1)); in esl_min_dat_Create() 335 ESL_ALLOC(dat->brack_n, sizeof(int) * (max_iterations + 1)); in esl_min_dat_Create() 336 ESL_ALLOC(dat->brack_ax, sizeof(double) * (max_iterations + 1)); in esl_min_dat_Create() 337 ESL_ALLOC(dat->brack_bx, sizeof(double) * (max_iterations + 1)); in esl_min_dat_Create() 338 ESL_ALLOC(dat->brack_cx, sizeof(double) * (max_iterations + 1)); in esl_min_dat_Create() [all …]
|
/dports/biology/hmmer/hmmer-3.3/easel/ |
H A D | esl_minimizer.c | 108 int max_iterations = cfg ? cfg->max_iterations : eslMIN_MAXITER; in esl_min_ConjugateGradientDescent() local 156 for (i = 1; i <= max_iterations; i++) in esl_min_ConjugateGradientDescent() 245 return (i > max_iterations ? eslENOHALT: eslOK); in esl_min_ConjugateGradientDescent() 276 cfg->max_iterations = eslMIN_MAXITER; in esl_min_cfg_Create() 321 int max_iterations = cfg ? cfg->max_iterations : eslMIN_MAXITER; in esl_min_dat_Create() local 334 ESL_ALLOC(dat->fx, sizeof(double) * (max_iterations + 1)); in esl_min_dat_Create() 335 ESL_ALLOC(dat->brack_n, sizeof(int) * (max_iterations + 1)); in esl_min_dat_Create() 336 ESL_ALLOC(dat->brack_ax, sizeof(double) * (max_iterations + 1)); in esl_min_dat_Create() 337 ESL_ALLOC(dat->brack_bx, sizeof(double) * (max_iterations + 1)); in esl_min_dat_Create() 338 ESL_ALLOC(dat->brack_cx, sizeof(double) * (max_iterations + 1)); in esl_min_dat_Create() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | lloyd_optimize_mesh_2.h | 86 const int max_iterations, in lloyd_optimize_mesh_2_impl() argument 95 return lloyd_optimize_mesh_2_impl(cdt, max_iterations, convergence_ratio, in lloyd_optimize_mesh_2_impl() 102 const int max_iterations, in lloyd_optimize_mesh_2_impl() argument 127 int nb_iterations = (0 == max_iterations) in lloyd_optimize_mesh_2_impl() 129 : max_iterations; in lloyd_optimize_mesh_2_impl()
|
/dports/cad/repsnapper/repsnapper-2.5a4/libraries/vmmlib/include/vmmlib/ |
H A D | tucker4_tensor.hpp | 37 …tensor_stats decompose(const t4_type& data_, T_init init, const size_t max_iterations = 10, const … 40 …tensor_stats tucker_als(const t4_type& data_, T_init init, const size_t max_iterations = 10, const… 100 …VMML_TEMPLATE_CLASSNAME::decompose(const t4_type& data_, T_init init, const size_t max_iterations,… in decompose() argument 101 return tucker_als(data_, init, max_iterations, tolerance); in decompose() 107 …LASSNAME::tucker_als(const t4_type& data_, T_init init, const size_t max_iterations, const float t… in tucker_als() argument 111 …result += hooi_type::als(data_, *_u1, *_u2, *_u3, *_u4, _core, init, 0, max_iterations, tolerance); in tucker_als()
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/Revoropt/include/Revoropt/Solver/ |
H A D | alglib_cg.hpp | 33 max_iterations(10) {} in SolverParams() 38 alglib::ae_int_t max_iterations ; member in Revoropt::Solver::AlgCG::SolverParams 68 solver_param.max_iterations = n_iter ; in solve() 76 solver_param.max_iterations in solve() 101 solver_param.max_iterations = n_iter ; in solve() 109 solver_param.max_iterations in solve()
|
H A D | alglib_lbfgs.hpp | 34 update_size(5), max_iterations(10) {} in SolverParams() 40 alglib::ae_int_t max_iterations ; member in Revoropt::Solver::AlgLBFGS::SolverParams 70 solver_param.max_iterations = n_iter ; in solve() 78 solver_param.max_iterations in solve() 103 solver_param.max_iterations = n_iter ; in solve() 113 solver_param.max_iterations in solve()
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/xtp/xtp-2a31d70/include/votca/xtp/ |
H A D | newton_rapson.h | 43 NewtonRapson(Index max_iterations, double tolerance) in NewtonRapson() argument 44 : max_iterations_(max_iterations), tolerance_(tolerance) {} in NewtonRapson() 46 NewtonRapson(Index max_iterations, double tolerance, double alpha) in NewtonRapson() argument 47 : max_iterations_(max_iterations), tolerance_(tolerance), alpha_(alpha) {} in NewtonRapson()
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/xtp/include/votca/xtp/ |
H A D | newton_rapson.h | 43 NewtonRapson(Index max_iterations, double tolerance) in NewtonRapson() argument 44 : max_iterations_(max_iterations), tolerance_(tolerance) {} in NewtonRapson() 46 NewtonRapson(Index max_iterations, double tolerance, double alpha) in NewtonRapson() argument 47 : max_iterations_(max_iterations), tolerance_(tolerance), alpha_(alpha) {} in NewtonRapson()
|
/dports/science/py-OpenFermion/OpenFermion-1.3.0/src/openfermion/linalg/ |
H A D | davidson_test.py | 72 self.max_iterations = 100 81 self.max_iterations) 105 DavidsonOptions(max_iterations=0) 250 n_lowest, initial_guess, max_iterations=5) 277 n_lowest, initial_guess, max_iterations=5) 333 n_lowest, initial_guess, max_iterations=20) 354 n_lowest, initial_guess, max_iterations=10) 379 n_lowest, initial_guess, max_iterations=10) 405 n_lowest, initial_guess, max_iterations=10) 458 n_lowest, initial_guess, max_iterations=10) [all …]
|
H A D | davidson.py | 39 max_iterations=300, argument 53 if max_subspace <= 2 or max_iterations <= 0 or eps <= 0: 56 max_subspace, max_iterations, eps)) 59 self.max_iterations = max_iterations 102 def get_lowest_n(self, n_lowest=1, initial_guess=None, max_iterations=None): argument 167 max_iterations = max_iterations or self.options.max_iterations 168 while (num_iterations < max_iterations and not success):
|
/dports/science/py-dlib/dlib-19.22/dlib/control/ |
H A D | lspi.h | 108 ) { max_iterations = max_iter; } in set_max_iterations() 111 ) { return max_iterations; } in get_max_iterations() 158 } while(change > eps && iter < max_iterations); in train() 172 max_iterations = 100; in init() 179 unsigned long max_iterations; variable
|