Home
last modified time | relevance | path

Searched refs:numEvals (Results 1 – 25 of 101) sorted by relevance

12345

/dports/math/gismo/gismo-21.12.0/src/gsCore/
H A DgsField.hpp27 int numEvals) const in distanceL2()
29 GISMO_UNUSED(numEvals);// todo: subdivided quadrature elements in distanceL2()
93 T gsField<T>::distanceL2(gsField<T> const & field, int numEvals) const in distanceL2()
95 return distanceL2(*field.m_fields, field.m_parametric, numEvals); in distanceL2()
101 int numEvals) const in distanceL2()
104 return distanceL2(func, gsMultiBasis<T>(*mp), isFunc_param, numEvals); in distanceL2()
106 return distanceL2(func, mb, isFunc_param, numEvals); in distanceL2()
H A DgsField.h138 T distanceL2(gsField<T> const & field, int numEvals= 1000) const;
143 int numEvals=1000) const;
150 int numEvals=1000) const;
/dports/math/primme/primme-3.2/examples/
H A Dex_eigs_zseq_normal.c71 primme.numEvals = 10; /* Number of wanted eigenpairs */ in main()
105 evals = (complex double*)malloc(primme.numEvals*sizeof(complex double)); in main()
106 evecs = (complex double*)malloc(primme.n*primme.numEvals*sizeof(complex double)); in main()
107 rnorms = (double*)malloc(primme.numEvals*sizeof(double)); in main()
155 primme.numEvals = 5; in main()
205 primme.numEvals = 5; in main()
249 primme.numEvals = 5; in main()
H A Dex_eigs_zseq.c71 primme.numEvals = 10; /* Number of wanted eigenpairs */ in main()
98 evals = (double*)malloc(primme.numEvals*sizeof(double)); in main()
99 evecs = (complex double*)malloc(primme.n*primme.numEvals*sizeof(complex double)); in main()
100 rnorms = (double*)malloc(primme.numEvals*sizeof(double)); in main()
148 primme.numEvals = 5; in main()
198 primme.numEvals = 5; in main()
242 primme.numEvals = 5; in main()
H A Dex_eigs_zseqxx.cxx71 primme.numEvals = 10; /* Number of wanted eigenpairs */ in main()
98 evals = new double[primme.numEvals]; in main()
99 evecs = new std::complex<double>[primme.n*primme.numEvals]; in main()
100 rnorms = new double[primme.numEvals]; in main()
148 primme.numEvals = 5; in main()
198 primme.numEvals = 5; in main()
242 primme.numEvals = 5; in main()
H A Dex_eigs_dseq.c70 primme.numEvals = 10; /* Number of wanted eigenpairs */ in main()
97 evals = (double*)malloc(primme.numEvals*sizeof(double)); in main()
98 evecs = (double*)malloc(primme.n*primme.numEvals*sizeof(double)); in main()
99 rnorms = (double*)malloc(primme.numEvals*sizeof(double)); in main()
H A Dex_eigs_mpi.c81 primme.numEvals = 1000; /* Number of wanted eigenpairs */ in main()
118 evals = (float*)malloc(primme.numEvals*sizeof(float)); in main()
119 evecs = (float*)malloc(primme.n*primme.numEvals*sizeof(float)); in main()
120 rnorms = (float*)malloc(primme.numEvals*sizeof(float)); in main()
H A Dex_eigs_dmagma.c100 primme.numEvals = 6; /* Number of wanted eigenpairs */ in main()
135 evals = (double*)malloc(primme.numEvals*sizeof(double)); in main()
136 magma_dmalloc(&evecs, primme.n*primme.numEvals); in main()
137 rnorms = (double*)malloc(primme.numEvals*sizeof(double)); in main()
H A Dex_c.m499 primme.numEvals = 10; /* Number of wanted eigenpairs */
145 evals = new PRIMME_REAL[primme.numEvals];
146 evecs = new PRIMME_SCALAR[primme.n*primme.numEvals];
147 rnorms = new PRIMME_REAL[primme.numEvals];',`
148 evals = (PRIMME_REAL*)malloc(primme.numEvals*sizeof(PRIMME_REAL));
149 evecs = (PRIMME_SCALAR*)malloc(primme.n*primme.numEvals*sizeof(PRIMME_SCALAR));
150 rnorms = (PRIMME_REAL*)malloc(primme.numEvals*sizeof(PRIMME_REAL));')
214 primme.numEvals = 5;
226 primme.numEvals = 5;
232 primme.numEvals = 5;
/dports/math/py-primme/primme-3.2/examples/
H A Dex_eigs_zseqxx.cxx71 primme.numEvals = 10; /* Number of wanted eigenpairs */ in main()
98 evals = new double[primme.numEvals]; in main()
99 evecs = new std::complex<double>[primme.n*primme.numEvals]; in main()
100 rnorms = new double[primme.numEvals]; in main()
148 primme.numEvals = 5; in main()
198 primme.numEvals = 5; in main()
242 primme.numEvals = 5; in main()
H A Dex_eigs_zseq_normal.c71 primme.numEvals = 10; /* Number of wanted eigenpairs */ in main()
105 evals = (complex double*)malloc(primme.numEvals*sizeof(complex double)); in main()
106 evecs = (complex double*)malloc(primme.n*primme.numEvals*sizeof(complex double)); in main()
107 rnorms = (double*)malloc(primme.numEvals*sizeof(double)); in main()
155 primme.numEvals = 5; in main()
205 primme.numEvals = 5; in main()
249 primme.numEvals = 5; in main()
H A Dex_eigs_zseq.c71 primme.numEvals = 10; /* Number of wanted eigenpairs */ in main()
98 evals = (double*)malloc(primme.numEvals*sizeof(double)); in main()
99 evecs = (complex double*)malloc(primme.n*primme.numEvals*sizeof(complex double)); in main()
100 rnorms = (double*)malloc(primme.numEvals*sizeof(double)); in main()
148 primme.numEvals = 5; in main()
198 primme.numEvals = 5; in main()
242 primme.numEvals = 5; in main()
H A Dex_eigs_dseq.c70 primme.numEvals = 10; /* Number of wanted eigenpairs */
97 evals = (double*)malloc(primme.numEvals*sizeof(double));
98 evecs = (double*)malloc(primme.n*primme.numEvals*sizeof(double));
99 rnorms = (double*)malloc(primme.numEvals*sizeof(double));
H A Dex_eigs_mpi.c81 primme.numEvals = 1000; /* Number of wanted eigenpairs */
118 evals = (float*)malloc(primme.numEvals*sizeof(float));
119 evecs = (float*)malloc(primme.n*primme.numEvals*sizeof(float));
120 rnorms = (float*)malloc(primme.numEvals*sizeof(float));
H A Dex_eigs_dmagma.c100 primme.numEvals = 6; /* Number of wanted eigenpairs */
135 evals = (double*)malloc(primme.numEvals*sizeof(double));
136 magma_dmalloc(&evecs, primme.n*primme.numEvals);
137 rnorms = (double*)malloc(primme.numEvals*sizeof(double));
H A Dex_c.m499 primme.numEvals = 10; /* Number of wanted eigenpairs */
145 evals = new PRIMME_REAL[primme.numEvals];
146 evecs = new PRIMME_SCALAR[primme.n*primme.numEvals];
147 rnorms = new PRIMME_REAL[primme.numEvals];',`
148 evals = (PRIMME_REAL*)malloc(primme.numEvals*sizeof(PRIMME_REAL));
149 evecs = (PRIMME_SCALAR*)malloc(primme.n*primme.numEvals*sizeof(PRIMME_SCALAR));
150 rnorms = (PRIMME_REAL*)malloc(primme.numEvals*sizeof(PRIMME_REAL));')
214 primme.numEvals = 5;
226 primme.numEvals = 5;
232 primme.numEvals = 5;
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/muq2/modules/Approximation/test/GaussianProcesses/
H A DStateSpaceTests.cpp209 const int numEvals = 100; in TEST() local
210 Eigen::MatrixXd evalPts(1,numEvals); in TEST()
211 evalPts.row(0) = Eigen::VectorXd::LinSpaced(numEvals, 0, 2); in TEST()
261 const int numEvals = 100; in TEST() local
262 Eigen::MatrixXd evalPts(1,numEvals); in TEST()
263 evalPts.row(0) = Eigen::VectorXd::LinSpaced(numEvals, 1.6, 3); in TEST()
314 const int numEvals = 100; in TEST() local
315 Eigen::MatrixXd evalPts(1,numEvals); in TEST()
316 evalPts.row(0) = Eigen::VectorXd::LinSpaced(numEvals, -1, 0.2); in TEST()
/dports/math/primme/primme-3.2/src/eigs/
H A Dmain_iter.c267 maxEvecsSize = primme->numOrthoConst + primme->numEvals; in main_iter_Sprimme()
399 for (i=0; i<primme->numEvals; i++) perm[i] = i; in main_iter_Sprimme()
405 if (primme->numEvals == 0) { in main_iter_Sprimme()
430 if (primme->numEvals < 5 || in main_iter_Sprimme()
501 while (numConverged < primme->numEvals && in main_iter_Sprimme()
625 if (numConverged >= primme->numEvals || in main_iter_Sprimme()
1012 numConverged < primme->numEvals && in main_iter_Sprimme()
1013 (i < primme->numEvals - numLocked in main_iter_Sprimme()
1280 for (i=0; i < primme->numEvals; i++) { in main_iter_Sprimme()
1287 *numRet = primme->numEvals; in main_iter_Sprimme()
[all …]
H A Dprimme_c.c380 primme->numEvals, 1, evals_resNorms_type, (void **)&evals0, NULL, in wrapper_Sprimme()
384 primme->numOrthoConst + max(primme->numEvals, primme->initSize), in wrapper_Sprimme()
389 CHKERR(Num_matrix_astype_RHprimme(resNorms, 1, primme->numEvals, in wrapper_Sprimme()
453 else if (primme->numEvals > primme->n) in check_input()
455 else if (primme->numEvals < 0) in check_input()
472 && primme->n > 2 && primme->numEvals > 0)) in check_input()
475 || (primme->maxBlockSize == 0 && primme->numEvals > 0)) in check_input()
483 else if (primme->locking > 0 && primme->initSize > primme->numEvals) in check_input()
506 else if (primme->locking == 0 && primme->minRestartSize < primme->numEvals && in check_input()
752 PARALLEL_CHECK(primme->numEvals); in check_params_coherence()
H A Dprimme_interface.c105 primme->numEvals = 1; in primme_initialize()
341 if ((primme->maxBlockSize == 1 && primme->numEvals > 1) || in primme_set_method()
355 if ((primme->maxBlockSize == 1 && primme->numEvals > 1) || in primme_set_method()
369 if ((primme->maxBlockSize == 1 && primme->numEvals > 1) || in primme_set_method()
454 primme->minRestartSize = primme->numEvals; in primme_set_method()
497 if ((primme->maxBlockSize == 1 && primme->numEvals > 1) || in primme_set_method()
610 else if (primme->numEvals > primme->minRestartSize) { in primme_set_defaults()
674 PRINT(numEvals, %d); in primme_display_params_prefix()
823 *(PRIMME_INT*)value = primme->numEvals; in primme_get_member()
1126 primme->numEvals = (int)*(PRIMME_INT*)value; in primme_set_member()
[all …]
/dports/math/py-primme/primme-3.2/src/eigs/
H A Dmain_iter.c267 maxEvecsSize = primme->numOrthoConst + primme->numEvals;
399 for (i=0; i<primme->numEvals; i++) perm[i] = i;
405 if (primme->numEvals == 0) {
430 if (primme->numEvals < 5 ||
501 while (numConverged < primme->numEvals &&
625 if (numConverged >= primme->numEvals ||
1012 numConverged < primme->numEvals &&
1013 (i < primme->numEvals - numLocked
1280 for (i=0; i < primme->numEvals; i++) {
1287 *numRet = primme->numEvals;
[all …]
H A Dprimme_c.c380 primme->numEvals, 1, evals_resNorms_type, (void **)&evals0, NULL,
384 primme->numOrthoConst + max(primme->numEvals, primme->initSize),
389 CHKERR(Num_matrix_astype_RHprimme(resNorms, 1, primme->numEvals,
453 else if (primme->numEvals > primme->n)
455 else if (primme->numEvals < 0)
472 && primme->n > 2 && primme->numEvals > 0))
475 || (primme->maxBlockSize == 0 && primme->numEvals > 0))
483 else if (primme->locking > 0 && primme->initSize > primme->numEvals)
506 else if (primme->locking == 0 && primme->minRestartSize < primme->numEvals &&
752 PARALLEL_CHECK(primme->numEvals);
H A Dprimme_interface.c105 primme->numEvals = 1; in primme_initialize()
341 if ((primme->maxBlockSize == 1 && primme->numEvals > 1) || in primme_set_method()
355 if ((primme->maxBlockSize == 1 && primme->numEvals > 1) || in primme_set_method()
369 if ((primme->maxBlockSize == 1 && primme->numEvals > 1) || in primme_set_method()
454 primme->minRestartSize = primme->numEvals; in primme_set_method()
497 if ((primme->maxBlockSize == 1 && primme->numEvals > 1) || in primme_set_method()
610 else if (primme->numEvals > primme->minRestartSize) { in primme_set_defaults()
674 PRINT(numEvals, %d); in primme_display_params_prefix()
823 *(PRIMME_INT*)value = primme->numEvals; in primme_get_member()
1126 primme->numEvals = (int)*(PRIMME_INT*)value; in primme_set_member()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/
H A DParamStudy.cpp130 maxEvalConcurrency *= numEvals; in ParamStudy()
175 if (av_size != numEvals) { in pre_run()
176 allVariables.resize(numEvals); in pre_run()
182 allHeaders.resize(numEvals); in pre_run()
422 for (size_t i=0; i<numEvals; ++i) { in sample()
599 for (i=0; i<numEvals; ++i) { in multidim_loop()
649 numEvals = TabularIO:: in load_distribute_points()
654 if (numEvals == 0) err = true; in load_distribute_points()
659 for (size_t i=0; i<numEvals; ++i) { in load_distribute_points()
741 numEvals = len_lop / num_vars; in distribute_list_of_points()
[all …]
H A DParamStudy.hpp191 size_t numEvals; member in Dakota::ParamStudy
451 numEvals = numSteps + 1; in check_num_steps()
534 numEvals = 2*spv_sum + 1; in check_steps_per_variable()
560 numEvals = 1; in check_variable_partitions()
562 numEvals *= contVarPartitions[i] + 1; in check_variable_partitions()
564 numEvals *= discIntVarPartitions[i] + 1; in check_variable_partitions()
566 numEvals *= discStringVarPartitions[i] + 1; in check_variable_partitions()
568 numEvals *= discRealVarPartitions[i] + 1; in check_variable_partitions()

12345