SG++-Doxygen-Documentation
|
#include <OperationMakePositiveCandidateSetAlgorithm.hpp>
Public Member Functions | |
size_t | costsComputingCandidates () |
base::DataVector & | costsComputingCandidatesPerIteration () |
virtual void | nextCandidates (base::Grid &grid, base::DataVector &alpha, size_t levelSum, std::vector< std::shared_ptr< base::HashGridPoint >> &candidates)=0 |
Load the next candidate set that contains grid points with the currently explored levelsum. More... | |
virtual size_t | numCandidates ()=0 |
virtual base::DataVector & | numCandidatesPerIteration ()=0 |
base::DataVector & | numCandidatesPerLevel () |
OperationMakePositiveCandidateSetAlgorithm (size_t maxLevel) | |
Constructor. More... | |
void | setVerbose (bool pverbose) |
Set verbosity level. More... | |
virtual | ~OperationMakePositiveCandidateSetAlgorithm () |
Desctructor. More... | |
Protected Member Functions | |
void | findNodesWithNegativeCoefficients (base::DataVector &alpha, std::vector< size_t > &negativeGridPoints, double tol=-1e-14) |
Extract grid points with negative coefficient. More... | |
Protected Attributes | |
base::DataVector | costsPerIteration |
comparison costs per iteration More... | |
base::DataVector | gridPointsPerLevel |
candiddate grid points per level More... | |
size_t | iteration |
iteration counter More... | |
size_t | maxLevel |
maximum full grid level for the candidate set More... | |
bool | verbose |
verbosity level More... | |
|
explicit |
Constructor.
maxLevel | maximum level for candidate set |
|
virtual |
Desctructor.
size_t sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::costsComputingCandidates | ( | ) |
References costsPerIteration, and sgpp::base::DataVector::sum().
base::DataVector & sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::costsComputingCandidatesPerIteration | ( | ) |
References costsPerIteration.
|
protected |
Extract grid points with negative coefficient.
alpha | coefficient vector |
negativeGridPoints | vector that contains the indices of the grid points with negative coefficient |
tol | tolerance for positivity |
References sgpp::base::DataVector::getSize(), and python.statsfileInfo::i.
Referenced by sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::nextCandidates(), and sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::nextCandidates().
|
pure virtual |
Load the next candidate set that contains grid points with the currently explored levelsum.
grid | current sparse grid that needs to be extended |
alpha | corresponding coefficient vector |
levelSum | current levelsum to be explored |
candidates | vector that contains the candidate set for the current levelsum |
Implemented in sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates, sgpp::datadriven::OperationMakePositiveLoadFullGridCandidates, and sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates.
|
pure virtual |
Implemented in sgpp::datadriven::OperationMakePositiveLoadFullGridCandidates, and sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates.
|
pure virtual |
Implemented in sgpp::datadriven::OperationMakePositiveLoadFullGridCandidates, and sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates.
base::DataVector & sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::numCandidatesPerLevel | ( | ) |
References gridPointsPerLevel.
void sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::setVerbose | ( | bool | pverbose | ) |
|
protected |
comparison costs per iteration
Referenced by costsComputingCandidates(), costsComputingCandidatesPerIteration(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::findIntersections(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidatesJoin::findIntersections(), sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::findIntersections(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::nextCandidates(), and sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::nextCandidates().
|
protected |
candiddate grid points per level
Referenced by sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::nextCandidates(), sgpp::datadriven::OperationMakePositiveLoadFullGridCandidates::nextCandidates(), and numCandidatesPerLevel().
|
protected |
iteration counter
Referenced by sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::findIntersections(), python.uq.learner.Regressor.Regressor::learnData(), python.uq.learner.Interpolant.Interpolant::learnDataWithTest(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::nextCandidates(), sgpp::datadriven::OperationMakePositiveLoadFullGridCandidates::nextCandidates(), sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::nextCandidates(), python.uq.learner.SimulationLearner.SimulationLearner::refineGrid(), and python.uq.learner.SimulationLearner.SimulationLearner::updateResults().
|
protected |
maximum full grid level for the candidate set
Referenced by sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::nextCandidates(), sgpp::datadriven::OperationMakePositiveLoadFullGridCandidates::nextCandidates(), sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::nextCandidates(), and sgpp::datadriven::OperationMakePositiveLoadFullGridCandidates::~OperationMakePositiveLoadFullGridCandidates().
|
protected |
verbosity level
Referenced by python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates::findIntersections(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::findIntersections(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidatesJoin::findIntersections(), sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::findIntersections(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::initializeCandidates(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidatesJoin::initializeCandidates(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::nextCandidates(), sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::nextCandidates(), and setVerbose().