#include <OperationMakePositiveCandidateSetAlgorithm.hpp>
◆ OperationMakePositiveCandidateSetAlgorithm()
sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::OperationMakePositiveCandidateSetAlgorithm |
( |
size_t |
maxLevel | ) |
|
|
explicit |
Constructor.
- Parameters
-
maxLevel | maximum level for candidate set |
◆ ~OperationMakePositiveCandidateSetAlgorithm()
sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::~OperationMakePositiveCandidateSetAlgorithm |
( |
| ) |
|
|
virtual |
◆ costsComputingCandidates()
size_t sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::costsComputingCandidates |
( |
| ) |
|
◆ costsComputingCandidatesPerIteration()
base::DataVector & sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::costsComputingCandidatesPerIteration |
( |
| ) |
|
- Returns
- number of comparisons that have been computed per iteration
References costsPerIteration.
◆ findNodesWithNegativeCoefficients()
void sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::findNodesWithNegativeCoefficients |
( |
base::DataVector & |
alpha, |
|
|
std::vector< size_t > & |
negativeGridPoints, |
|
|
double |
tol = -1e-14 |
|
) |
| |
|
protected |
◆ nextCandidates()
◆ numCandidates()
virtual size_t sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::numCandidates |
( |
| ) |
|
|
pure virtual |
◆ numCandidatesPerIteration()
virtual base::DataVector & sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::numCandidatesPerIteration |
( |
| ) |
|
|
pure virtual |
◆ numCandidatesPerLevel()
base::DataVector & sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::numCandidatesPerLevel |
( |
| ) |
|
- Returns
- number of candidates that have been computed per levelsum
References gridPointsPerLevel.
◆ setVerbose()
void sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::setVerbose |
( |
bool |
pverbose | ) |
|
Set verbosity level.
- Parameters
-
References verbose.
◆ costsPerIteration
base::DataVector sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::costsPerIteration |
|
protected |
◆ gridPointsPerLevel
base::DataVector sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::gridPointsPerLevel |
|
protected |
◆ iteration
size_t sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::iteration |
|
protected |
iteration counter
Referenced by python.learner.Learner.Learner::__init__(), python.uq.learner.Learner.Learner::__init__(), sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::findIntersections(), python.learner.Learner.Learner::fromJson(), python.uq.learner.Learner.Learner::fromJson(), python.learner.Learner.Learner::getCurrentIterationNumber(), python.uq.learner.Learner.Learner::getCurrentIterationNumber(), python.uq.operations.forcePositivity.findCandidateSet.CandidateSet::hasMoreCandidates(), python.learner.Learner.Learner::learnData(), python.learner.Learner.Learner::learnDataWithTest(), python.uq.learner.Interpolant.Interpolant::learnDataWithTest(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::nextCandidates(), sgpp::datadriven::OperationMakePositiveLoadFullGridCandidates::nextCandidates(), sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::nextCandidates(), python.uq.learner.SimulationLearner.SimulationLearner::refineGrid(), python.learner.Learner.Learner::setCurrentIterationNumber(), and python.uq.learner.Learner.Learner::setCurrentIterationNumber().
◆ maxLevel
size_t sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::maxLevel |
|
protected |
◆ verbose
bool sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::verbose |
|
protected |
verbosity level
Referenced by python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast::addFullGridPoints(), python.uq.refinement.RefinementManager.RefinementManager::candidates(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates::computeCandidates(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::findIntersections(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidatesJoin::findIntersections(), sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::findIntersections(), python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates::findIntersections(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates::getLocalMaxLevel(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::initializeCandidates(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidatesJoin::initializeCandidates(), python.uq.manager.ASGCUQManager.ASGCUQManager::learnDataWithoutTest(), python.uq.manager.ASGCUQManager.ASGCUQManager::learnDataWithTest(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive::makeCurrentNodalValuesPositive(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive::makePositive(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast::makePositive(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::nextCandidates(), sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::nextCandidates(), python.uq.manager.ASGCUQManager.ASGCUQManager::recomputeStats(), python.uq.refinement.RefinementManager.RefinementManager::refineGrid(), setVerbose(), and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates::splitFullGrids().
The documentation for this class was generated from the following files: