Home
last modified time | relevance | path

Searched refs:num_v (Results 1 – 25 of 189) sorted by relevance

12345678

/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/
H A DTaylorApproximation.cpp32 size_t num_v = sharedDataRep->numVars; in min_coefficients() local
35 num_coeffs += num_v; in min_coefficients()
37 num_coeffs += num_v*(num_v + 1)/2; in min_coefficients()
58 size_t num_v = sharedDataRep->numVars; in build() local
90 for (i=0; i<num_v; i++) { in value()
95 for (size_t j=0; j<num_v; j++) in value()
116 approxGradient.size(num_v); in gradient()
126 for (i=0; i<num_v; i++) in gradient()
127 for (j=0; j<num_v; j++) in gradient()
141 size_t num_v = sharedDataRep->numVars; in hessian() local
[all …]
H A DGaussProcApproximation.cpp198 for (j=0; j<num_v; j++) in build()
294 for (i=0; i<num_v; i++) in GPmodel_apply()
328 for (i=0; i<num_v; i++) in normalize_training_data()
383 RealVector theta_lbnds(num_v, false), theta_ubnds(num_v, false); in optimize_theta_global()
415 for (i=0; i<num_v; i++){ in get_cov_matrix()
488 size_t num_v = sharedDataRep->numVars, trend_dim = 1 + trendOrder * num_v; in get_beta_coefficients() local
810 RealVector theta_lbnds(num_v), theta_ubnds(num_v); in optimize_theta_multipoint()
847 for (j=0; j<num_v; j++) in optimize_theta_multipoint()
1039 if (num_v==1) in initialize_point_selection()
1042 ninit = (num_v*num_v+1 <= numObs) ? num_v*num_v+1 : numObs; in initialize_point_selection()
[all …]
H A DTANA3Approximation.cpp94 for (size_t i=0; i<num_v; i++) in build()
183 for (i=0; i<num_v; i++) { in find_scaled_coefficients()
229 for (i=0; i<num_v; i++) { in find_scaled_coefficients()
250 for (i=0; i<num_v; i++) { in offset()
281 for (i=0; i<num_v; i++) { in value()
292 for (i=0; i<num_v; i++) in value()
307 for (i=0; i<num_v; i++) { in value()
344 for (i=0; i<num_v; i++) in gradient()
358 for (i=0; i<num_v; i++) { in gradient()
364 if (approxGradient.length() != num_v) in gradient()
[all …]
H A DQMEApproximation.cpp222 for (i=0; i<num_v; i++) { in find_scaled_coefficients()
267 for (i=0; i<num_v; i++) { in find_scaled_coefficients()
282 RealVector y0(num_v), y(num_v); in find_scaled_coefficients()
289 for (i=0; i<num_v; ++i) { in find_scaled_coefficients()
373 for (i=0; i<num_v; i++) { in offset()
403 for (i=0; i<num_v; i++) { in apxfn_value()
413 for (i=0; i<num_v; i++) in apxfn_value()
430 RealVector dy(num_v); in apxfn_value()
431 for (i=0; i<num_v; i++) { in apxfn_value()
494 for (i=0; i<num_v; i++) in gradient()
[all …]
H A DC3Approximation.cpp68 size_t v, num_v = data_rep->numVars; in recover_function_train_orders() local
69 ft_orders.resize(num_v); in recover_function_train_orders()
71 for (v=0; v<num_v; ++v) in recover_function_train_orders()
159 SizetVector start_ranks(num_v+1); in build()
238 for (j=0; j<num_v; j++) in build()
239 xtrain[j + i*num_v] = c_vars[j]; in build()
243 RealMatrix in(Teuchos::View, xtrain, num_v, num_v, ndata); in build()
334 for (i=0; i<num_v; ++i) in build()
942 for (i=0; i<num_v; ++i) in gradient()
955 for (i=0; i<num_v; ++i) in hessian()
[all …]
H A DNOWPACOptimizer.hpp128 size_t v, num_v = unscaled_x.length(); in scale() local
129 if (scaled_x.size() != num_v) in scale()
130 scaled_x.resize(num_v); in scale()
131 for (v=0; v<num_v; ++v) in scale()
140 size_t v, num_v = scaled_x.size(); in unscale() local
141 if (unscaled_x.length() != num_v) in unscale()
142 unscaled_x.sizeUninitialized(num_v); in unscale()
143 for (v=0; v<num_v; ++v) in unscale()
H A DNonDIntegration.cpp213 size_t num_v, in dimension_preference_to_anisotropic_order() argument
219 aniso_order.assign(num_v, scalar_order_spec); in dimension_preference_to_anisotropic_order()
225 for (i=1; i<num_v; ++i) in dimension_preference_to_anisotropic_order()
229 aniso_order.resize(num_v); in dimension_preference_to_anisotropic_order()
230 for (i=0; i<num_v; ++i) in dimension_preference_to_anisotropic_order()
247 size_t i, num_v = aniso_order.size(); bool anisotropic = false; in anisotropic_order_to_dimension_preference() local
248 for (i=1; i<num_v; ++i) in anisotropic_order_to_dimension_preference()
253 dim_pref.sizeUninitialized(num_v); in anisotropic_order_to_dimension_preference()
254 for (i=0; i<num_v; ++i) in anisotropic_order_to_dimension_preference()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/
H A DMarginalsCorrDistribution.hpp561 values.resize(num_v); in pull_parameters()
577 for (v=0; v<num_v; ++v) in pull_parameters()
594 for (v=0; v<num_v; ++v) in pull_parameters()
665 mom.resize(num_v); in moments()
666 for (v=0; v<num_v; ++v) in moments()
672 for (v=0; v<num_v; ++v) in moments()
686 for (v=0; v<num_v; ++v) in means()
692 for (v=0; v<num_v; ++v) in means()
706 for (v=0; v<num_v; ++v) in std_deviations()
712 for (v=0; v<num_v; ++v) in std_deviations()
[all …]
H A DNatafTransformation.cpp424 RealVector fn_grad_x_trans(num_v), fn_grad_u_trans(num_v, false); in trans_grad_X_to_U()
712 ( fn_grad_x.length() != num_v || hessian_xu.size() != num_v ) ) { in trans_hess_X_to_U()
808 if (jacobian_xu.numRows() != num_v || jacobian_xu.numCols() != num_v) in jacobian_dX_dU()
809 jacobian_xu.shape(num_v, num_v); in jacobian_dX_dU()
829 if (jacobian_xz.numRows() != num_v || jacobian_xz.numCols() != num_v) in jacobian_dX_dZ()
830 jacobian_xz.shape(num_v, num_v); in jacobian_dX_dZ()
906 RealMatrix tmp_jac_ux(num_v, num_v); in jacobian_dU_dX()
908 if (jacobian_ux.numRows() != num_v || jacobian_ux.numCols() != num_v) in jacobian_dU_dX()
909 jacobian_ux.shape(num_v, num_v); in jacobian_dU_dX()
933 if (jacobian_zx.numRows() != num_v || jacobian_zx.numCols() != num_v) in jacobian_dZ_dX()
[all …]
H A DDiscrepancyCalculator.cpp70 size_t v, num_v = std::min(truth_grad.length(), approx_grad.length()); in compute_additive() local
71 if (discrep_grad.length() != num_v) discrep_grad.sizeUninitialized(num_v); in compute_additive()
72 for (v=0; v<num_v; ++v) in compute_additive()
85 if (discrep_hess.numRows() != num_v) in compute_additive()
86 discrep_hess.shapeUninitialized(num_v); in compute_additive()
87 for (r=0; r<num_v; ++r) in compute_additive()
117 if (discrep_grad.length() != num_v) discrep_grad.sizeUninitialized(num_v); in compute_multiplicative()
119 for (v=0; v<num_v; ++v) in compute_multiplicative()
135 if (discrep_hess.numRows() != num_v) in compute_multiplicative()
136 discrep_hess.shapeUninitialized(num_v); in compute_multiplicative()
[all …]
H A DNodalInterpPolyApproximation.cpp417 (int)num_v); in synthetic_surrogate_data()
480 RealMatrix t2_accumulator(num_v, num_v); // init to 0. in tensor_product_mean()
498 for (k=1; k<num_v; ++k) in tensor_product_mean()
504 for (k=1; k<num_v; ++k) in tensor_product_mean()
759 t2_accumulators[v].shape(num_v, num_v); // init to 0. in tensor_product_mean_gradient()
1049 RealMatrix t2_accumulator(num_v, num_v); // init to 0. in tensor_product_covariance()
1242 RealMatrix t2_accumulator(num_v, num_v); // init to 0. in tensor_product_covariance()
1580 t2_accumulators[v].shape(num_v, num_v); // init to 0. in tensor_product_variance_gradient()
1668 for (v=0; v<num_v; ++v) in tensor_product_variance_gradient()
1921 t2_accumulators[v].shape(num_v, num_v); // init to 0. in tensor_product_variance_gradient()
[all …]
H A DOrthogPolyApproximation.cpp244 for (v=0; v<num_v; ++v) { in multiply_expansion()
276 for (v=0; v<num_v; ++v) { in multiply_expansion()
385 if (approxGradient.length() != num_v) approxGradient.size(num_v); // init to 0 in gradient_basis_variables()
395 for (j=0; j<num_v; ++j) in gradient_basis_variables()
415 if (approxGradient.length() != num_v) approxGradient.size(num_v); // init to 0 in gradient_basis_variables()
442 if (approxGradient.length() != num_v) approxGradient.size(num_v); // init to 0 in gradient_nonbasis_variables()
469 if (approxHessian.numRows() != num_v) approxHessian.shape(num_v); // init to 0 in hessian_basis_variables()
1076 BitArray set(num_v); in compute_component_sobol()
1171 RealVectorArray A_vectors(num_v), b_vectors(num_v); in dimension_decay_rates()
1206 for (i=0; i<num_v; ++i) in dimension_decay_rates()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/surrogates/models/unit/
H A Dgp_approximation.cpp92 trainMeans.sizeUninitialized(num_v); in center_training_data()
93 trainStdvs.sizeUninitialized(num_v); in center_training_data()
98 for( size_t i=0; i<num_v; i++ ) in center_training_data()
107 for( size_t i=0; i<num_v; i++ ) in center_training_data()
119 for( size_t i=0; i<num_v; i++ ) in center_training_data()
125 for( size_t i=0; i<num_v; i++ ) in center_training_data()
135 size_t num_v = ctrPoints.numCols(); in compute_trend_func() local
157 for (size_t j=0; j<num_v; j++) { in compute_trend_func()
210 size_t num_v = ctrPoints.numCols(); in compute_covariance_matrix() local
215 RealVector expThetaParms(num_v); in compute_covariance_matrix()
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/Subdivision_method_3/internal/
H A Dsubdivision_hosts_impl_3.h60 std::size_t num_v = p_vertices.size(); in PQQ_1step() local
88 std::vector<bool> v_onborder(num_v); in PQQ_1step()
110 for (std::size_t i = 0; i < num_v; i++, ++vitr) in PQQ_1step()
160 for (std::size_t i = 0; i < num_v; i++, ++vitr) in PQQ_1step()
184 std::size_t num_v = p_vertices.size(); in PTQ_1step() local
207 std::vector<bool> v_onborder(num_v); in PTQ_1step()
225 for (std::size_t i = 0; i < num_v; i++, ++vitr) in PTQ_1step()
264 for (std::size_t i = 0; i < num_v; i++, ++vitr) in PTQ_1step()
288 std::size_t num_v = p_vertices.size(); in DQQ_1step() local
321 for (std::size_t i = 0; i < num_v; ++i) { in DQQ_1step()
[all …]
/dports/graphics/py-geomdl/geomdl-5.2.10/geomdl/
H A DCPGen.py66 def generate(self, num_u, num_v): argument
78 if num_v < 1:
85 if not isinstance(num_v, int):
86 num_v = int(num_v)
87 warnings.warn("%d will be used as the value of num_v" % num_v, UserWarning)
94 spacing_y = self._size_y / num_v
105 for _ in range(0, num_v + 1):
117 self._size_v = num_v
/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/
H A Dmatching_test.cpp135 void matching_test(std::size_t num_v, const std::string& graph_name) in matching_test() argument
142 const std::size_t double_num_v = num_v * 2; in matching_test()
205 is_a_matching(g,edmonds_mate) && matching_size(g,edmonds_mate) == num_v; in matching_test()
217 is_a_matching(g,greedy_mate) && matching_size(g,greedy_mate) == num_v; in matching_test()
229 is_a_matching(g,extra_greedy_mate) && matching_size(g,extra_greedy_mate) == num_v; in matching_test()
262 gabows_graph(h,num_v); in matching_test()
281 BOOST_CHECK (matching_size(h,gabow_mate) == num_v); in matching_test()
282 if (gabows_graph_result && matching_size(h,gabow_mate) != num_v) in matching_test()
287 << " when it should be " << num_v << std::endl; in matching_test()
347 std::cout << graph_name << " passed all tests for n = " << num_v << '.' << std::endl; in matching_test()
H A Dweighted_matching_test.cpp97 Graph make_graph(typename graph_traits<Graph>::vertices_size_type num_v, in make_graph() argument
101 Graph g(num_v); in make_graph()
124 std::size_t answer, num_v, num_e; in test_main() local
125 in_graph >> answer >> num_v >> num_e; in test_main()
132 weighted_matching_test(make_graph<undirected_graph>(num_v, num_e, input_edges), answer); in test_main()
133 … weighted_matching_test(make_graph<undirected_list_graph>(num_v, num_e, input_edges), answer); in test_main()
134 …weighted_matching_test(make_graph<undirected_adjacency_matrix_graph>(num_v, num_e, input_edges), a… in test_main()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/
H A Dmatching_test.cpp135 void matching_test(std::size_t num_v, const std::string& graph_name) in matching_test() argument
142 const std::size_t double_num_v = num_v * 2; in matching_test()
205 is_a_matching(g,edmonds_mate) && matching_size(g,edmonds_mate) == num_v; in matching_test()
217 is_a_matching(g,greedy_mate) && matching_size(g,greedy_mate) == num_v; in matching_test()
229 is_a_matching(g,extra_greedy_mate) && matching_size(g,extra_greedy_mate) == num_v; in matching_test()
262 gabows_graph(h,num_v); in matching_test()
281 BOOST_CHECK (matching_size(h,gabow_mate) == num_v); in matching_test()
282 if (gabows_graph_result && matching_size(h,gabow_mate) != num_v) in matching_test()
287 << " when it should be " << num_v << std::endl; in matching_test()
347 std::cout << graph_name << " passed all tests for n = " << num_v << '.' << std::endl; in matching_test()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/
H A Dmatching_test.cpp128 void matching_test(std::size_t num_v, const std::string& graph_name) in matching_test() argument
135 const std::size_t double_num_v = num_v * 2; in matching_test()
198 is_a_matching(g,edmonds_mate) && matching_size(g,edmonds_mate) == num_v; in matching_test()
210 is_a_matching(g,greedy_mate) && matching_size(g,greedy_mate) == num_v; in matching_test()
222 is_a_matching(g,extra_greedy_mate) && matching_size(g,extra_greedy_mate) == num_v; in matching_test()
255 gabows_graph(h,num_v); in matching_test()
274 BOOST_CHECK (matching_size(h,gabow_mate) == num_v); in matching_test()
275 if (gabows_graph_result && matching_size(h,gabow_mate) != num_v) in matching_test()
280 << " when it should be " << num_v << std::endl; in matching_test()
340 std::cout << graph_name << " passed all tests for n = " << num_v << '.' << std::endl; in matching_test()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/
H A Dmatching_test.cpp128 void matching_test(std::size_t num_v, const std::string& graph_name) in matching_test() argument
135 const std::size_t double_num_v = num_v * 2; in matching_test()
198 is_a_matching(g,edmonds_mate) && matching_size(g,edmonds_mate) == num_v; in matching_test()
210 is_a_matching(g,greedy_mate) && matching_size(g,greedy_mate) == num_v; in matching_test()
222 is_a_matching(g,extra_greedy_mate) && matching_size(g,extra_greedy_mate) == num_v; in matching_test()
255 gabows_graph(h,num_v); in matching_test()
274 BOOST_CHECK (matching_size(h,gabow_mate) == num_v); in matching_test()
275 if (gabows_graph_result && matching_size(h,gabow_mate) != num_v) in matching_test()
280 << " when it should be " << num_v << std::endl; in matching_test()
340 std::cout << graph_name << " passed all tests for n = " << num_v << '.' << std::endl; in matching_test()
/dports/databases/percona57-server/boost_1_59_0/libs/graph/test/
H A Dmatching_test.cpp128 void matching_test(std::size_t num_v, const std::string& graph_name) in matching_test() argument
135 const std::size_t double_num_v = num_v * 2; in matching_test()
198 is_a_matching(g,edmonds_mate) && matching_size(g,edmonds_mate) == num_v; in matching_test()
210 is_a_matching(g,greedy_mate) && matching_size(g,greedy_mate) == num_v; in matching_test()
222 is_a_matching(g,extra_greedy_mate) && matching_size(g,extra_greedy_mate) == num_v; in matching_test()
255 gabows_graph(h,num_v); in matching_test()
274 BOOST_CHECK (matching_size(h,gabow_mate) == num_v); in matching_test()
275 if (gabows_graph_result && matching_size(h,gabow_mate) != num_v) in matching_test()
280 << " when it should be " << num_v << std::endl; in matching_test()
340 std::cout << graph_name << " passed all tests for n = " << num_v << '.' << std::endl; in matching_test()
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/
H A Dmatching_test.cpp128 void matching_test(std::size_t num_v, const std::string& graph_name) in matching_test() argument
135 const std::size_t double_num_v = num_v * 2; in matching_test()
198 is_a_matching(g,edmonds_mate) && matching_size(g,edmonds_mate) == num_v; in matching_test()
210 is_a_matching(g,greedy_mate) && matching_size(g,greedy_mate) == num_v; in matching_test()
222 is_a_matching(g,extra_greedy_mate) && matching_size(g,extra_greedy_mate) == num_v; in matching_test()
255 gabows_graph(h,num_v); in matching_test()
274 BOOST_CHECK (matching_size(h,gabow_mate) == num_v); in matching_test()
275 if (gabows_graph_result && matching_size(h,gabow_mate) != num_v) in matching_test()
280 << " when it should be " << num_v << std::endl; in matching_test()
340 std::cout << graph_name << " passed all tests for n = " << num_v << '.' << std::endl; in matching_test()
/dports/databases/percona57-client/boost_1_59_0/libs/graph/test/
H A Dmatching_test.cpp128 void matching_test(std::size_t num_v, const std::string& graph_name) in matching_test() argument
135 const std::size_t double_num_v = num_v * 2; in matching_test()
198 is_a_matching(g,edmonds_mate) && matching_size(g,edmonds_mate) == num_v; in matching_test()
210 is_a_matching(g,greedy_mate) && matching_size(g,greedy_mate) == num_v; in matching_test()
222 is_a_matching(g,extra_greedy_mate) && matching_size(g,extra_greedy_mate) == num_v; in matching_test()
255 gabows_graph(h,num_v); in matching_test()
274 BOOST_CHECK (matching_size(h,gabow_mate) == num_v); in matching_test()
275 if (gabows_graph_result && matching_size(h,gabow_mate) != num_v) in matching_test()
280 << " when it should be " << num_v << std::endl; in matching_test()
340 std::cout << graph_name << " passed all tests for n = " << num_v << '.' << std::endl; in matching_test()
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/
H A Dmatching_test.cpp135 void matching_test(std::size_t num_v, const std::string& graph_name) in matching_test() argument
142 const std::size_t double_num_v = num_v * 2; in matching_test()
205 is_a_matching(g,edmonds_mate) && matching_size(g,edmonds_mate) == num_v; in matching_test()
217 is_a_matching(g,greedy_mate) && matching_size(g,greedy_mate) == num_v; in matching_test()
229 is_a_matching(g,extra_greedy_mate) && matching_size(g,extra_greedy_mate) == num_v; in matching_test()
262 gabows_graph(h,num_v); in matching_test()
281 BOOST_CHECK (matching_size(h,gabow_mate) == num_v); in matching_test()
282 if (gabows_graph_result && matching_size(h,gabow_mate) != num_v) in matching_test()
287 << " when it should be " << num_v << std::endl; in matching_test()
347 std::cout << graph_name << " passed all tests for n = " << num_v << '.' << std::endl; in matching_test()
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/innobase/include/
H A Ddata0data.h430 uint32_t num_v; member
462 if (num_v != multi_value->num_v) { in equal()
466 for (uint32_t i = 0; i < num_v; ++i) { in equal()
480 if (num_alc < multi_value->num_v) { in copy()
518 if (num_v > 1) { in duplicate()
519 for (uint32_t i = 1; i < num_v; ++i) { in duplicate()
536 ut_ad(num_alc >= multi_value->num_v); in copy_low()
537 for (uint32_t i = 0; i < multi_value->num_v; ++i) { in copy_low()
542 sizeof(*data_len) * multi_value->num_v); in copy_low()
544 sizeof(*conv_buf) * multi_value->num_v); in copy_low()
[all …]

12345678