Home
last modified time | relevance | path

Searched refs:numCollocPts (Results 1 – 3 of 3) sorted by relevance

/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/
H A DSparseGridDriver.hpp259 std::map<UShortArray, int> numCollocPts; member in Pecos::SparseGridDriver
310 numPtsIter = numCollocPts.insert(ui_pair).first; in SparseGridDriver()
325 numPtsIter = numCollocPts.insert(ui_pair).first; // count to be updated in SparseGridDriver()
354 numPtsIter = numCollocPts.find(activeKey); in update_active_iterators()
355 if (numPtsIter == numCollocPts.end()) { in update_active_iterators()
358 numPtsIter = numCollocPts.insert(ui_pair).first; in update_active_iterators()
380 numCollocPts.clear(); numPtsIter = numCollocPts.end(); in clear_keys()
H A DSparseGridDriver.cpp532 std::map<UShortArray, int>::iterator cp_it = numCollocPts.begin(); in clear_inactive()
539 numCollocPts.erase(cp_it++); in clear_inactive()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/inactive/
H A DLRDHierarchInterpPolyApproximation.cpp548 for ( unsigned int i = 0; i<numCollocPts; ++i) in mean()
585 for (i=0; i<numCollocPts; ++i) { in mean_gradient()
642 for ( unsigned int i=0; i<numCollocPts; ++i) in covariance()
713 assert(numCollocPts == driverRep->grid_size()); in compute_expansion_coefficients()
722 for (int i=1; i<numCollocPts; ++i) { in compute_expansion_coefficients()
749 maxComputedCoeff = numCollocPts-1; in compute_expansion_coefficients()
778 numCollocPts = new_colloc_pts; in restore_expansion_coefficients()
785 numCollocPts = driverRep->grid_size(); in increment_coefficients()
790 if ( maxComputedCoeff == numCollocPts ) return; in increment_coefficients()
791 assert(numCollocPts == surrData.size()); in increment_coefficients()
[all …]