#include <OperationMakePositiveCandidateSetAlgorithm.hpp>
|
void | computeIntersection (base::HashGridPoint &gpi, base::HashGridPoint &gpj, base::HashGridPoint &gpintersection) |
|
virtual void | findIntersections (base::Grid &grid, base::DataVector &alpha, size_t levelSum, std::unordered_map< size_t, std::shared_ptr< base::HashGridPoint >> &res) |
|
bool | haveOverlappingSupport (base::HashGridPoint &gpi, base::HashGridPoint &gpj, size_t dim) |
|
bool | haveOverlappingSupport (base::HashGridPoint &gpi, base::HashGridPoint &gpj) |
|
virtual void | initializeCandidates (base::Grid &grid, std::vector< size_t > &negativeGridPoints) |
|
Protected Member Functions inherited from sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm |
void | findNodesWithNegativeCoefficients (base::DataVector &alpha, std::vector< size_t > &negativeGridPoints, double tol=-1e-14) |
| Extract grid points with negative coefficient. More...
|
|
◆ OperationMakePositiveFindIntersectionCandidates()
sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::OperationMakePositiveFindIntersectionCandidates |
( |
size_t |
maxLevel | ) |
|
|
explicit |
◆ ~OperationMakePositiveFindIntersectionCandidates()
sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::~OperationMakePositiveFindIntersectionCandidates |
( |
| ) |
|
|
virtual |
◆ compareGridPointsByHash()
bool sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::compareGridPointsByHash |
( |
const std::shared_ptr< base::HashGridPoint > & |
lhs, |
|
|
const std::shared_ptr< base::HashGridPoint > & |
rhs |
|
) |
| |
|
staticprotected |
◆ computeIntersection()
◆ findIntersections()
void sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::findIntersections |
( |
base::Grid & |
grid, |
|
|
base::DataVector & |
alpha, |
|
|
size_t |
levelSum, |
|
|
std::unordered_map< size_t, std::shared_ptr< base::HashGridPoint >> & |
res |
|
) |
| |
|
protectedvirtual |
Reimplemented in sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates, and sgpp::datadriven::OperationMakePositiveFindIntersectionCandidatesJoin.
References compareGridPointsByHash(), computeIntersection(), sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::costsPerIteration, currentIntersections, sgpp::base::HashGridStorage::getDimension(), sgpp::base::Grid::getSize(), sgpp::base::Grid::getStorage(), python.utils.sg_projections::gridStorage, intersections, sgpp::base::HashGridStorage::isContaining(), python.utils.statsfile2gnuplot::j, nextIntersections, numCandidatesIteration, sgpp::base::DataVector::setAll(), sgpp::base::DataVector::sum(), and sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::verbose.
Referenced by nextCandidates().
◆ haveOverlappingSupport() [1/2]
◆ haveOverlappingSupport() [2/2]
◆ initializeCandidates()
void sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::initializeCandidates |
( |
base::Grid & |
grid, |
|
|
std::vector< size_t > & |
negativeGridPoints |
|
) |
| |
|
protectedvirtual |
Reimplemented in sgpp::datadriven::OperationMakePositiveFindIntersectionCandidatesJoin.
References compareGridPointsByHash(), currentIntersections, sgpp::base::HashGridStorage::getPoint(), sgpp::base::Grid::getStorage(), python.utils.sg_projections::gridStorage, haveOverlappingSupport(), python.statsfileInfo::i, intersections, python.utils.statsfile2gnuplot::j, and sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::verbose.
Referenced by nextCandidates(), and sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates::nextCandidates().
◆ nextCandidates()
Load the next candidate set that contains grid points with the currently explored levelsum.
- Parameters
-
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 |
Implements sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm.
Reimplemented in sgpp::datadriven::OperationMakePositiveHybridFindIntersectionCandidates.
References candidates, sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::costsPerIteration, findIntersections(), sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::findNodesWithNegativeCoefficients(), sgpp::base::HashGridStorage::getDimension(), sgpp::base::HashGridStorage::getMaxLevel(), sgpp::base::DataVector::getSize(), sgpp::base::Grid::getStorage(), sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::gridPointsPerLevel, initializeCandidates(), sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::iteration, sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::maxLevel, numCandidatesIteration, sgpp::combigrid::pow(), sgpp::base::DataVector::resizeZero(), sgpp::base::DataVector::setAll(), sgpp::base::DataVector::sum(), and sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::verbose.
◆ numCandidates()
size_t sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::numCandidates |
( |
| ) |
|
|
overridevirtual |
◆ numCandidatesPerIteration()
base::DataVector & sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::numCandidatesPerIteration |
( |
| ) |
|
|
overridevirtual |
◆ candidates
std::unordered_map<size_t, std::shared_ptr<base::HashGridPoint> > sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::candidates |
|
protected |
◆ currentIntersections
◆ intersections
std::unordered_map<size_t, std::shared_ptr<std::vector<std::shared_ptr<base::HashGridPoint> > > > sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::intersections |
|
protected |
◆ nextIntersections
◆ numCandidatesIteration
base::DataVector sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::numCandidatesIteration |
|
protected |
The documentation for this class was generated from the following files: