SG++-Doxygen-Documentation
|
Public Member Functions | |
def | __init__ (self, grid) |
def | computeAnisotropicFullGrid (self, levels, indices, localFullGridLevels) |
def | computeCandidates (self, sortedOverlap, localFullGridLevels, grid, alpha) |
def | estimateCosts (self, overlap, grid) |
def | findCandidates (self, grid, alpha, addedGridPoints) |
def | findIntersection (self, gpi, gpj) |
def | findIntersections (self, gpsi, gpsj, grid, alpha) |
def | findIntersectionsOfOverlappingSuppportsForOneGridPoint (self, i, gpi, gpsj, overlap, grid, alpha) |
def | findNodesWithNegativeCoefficients (self, grid, alpha) |
def | getLocalFullGridLevel (self, levels, indices, grid) |
def | getLocalMaxLevel (self, dup, levels, indices, grid) |
def | getMaxLevelOfChildrenUpToMaxLevel (self, gp, grid, idim) |
def | plotDebug (self, grid, alpha, candidates, gpi, gpj, ans) |
Public Attributes | |
A0 | |
candidates | |
costs | |
globalGrids | |
grid | |
gs | |
iteration | |
maxLevel | |
newCandidates | |
numDims | |
plot | |
verbose | |
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.__init__ | ( | self, | |
grid | |||
) |
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeAnisotropicFullGrid | ( | self, | |
levels, | |||
indices, | |||
localFullGridLevels | |||
) |
References python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.globalGrids, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.globalGrids, python.uq.operations.forcePositivity.fullGridSearch.FullGridCandidates.numDims, sgpp::combigrid::Ishigami.numDims, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.numDims, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.numDims, sgpp::combigrid::Parabola.numDims, sgpp::combigrid::CO2.numDims, sgpp::combigrid::CombigridSurrogateModel.numDims, sgpp::combigrid::AtanUniform.numDims, sgpp::combigrid::AtanBeta.numDims, sgpp::combigrid::Debugfct.numDims, python.uq.models.testEnvironments.ProbabilisticSpaceSGpp.numDims, and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.numDims.
Referenced by python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeCandidates().
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeCandidates | ( | self, | |
sortedOverlap, | |||
localFullGridLevels, | |||
grid, | |||
alpha | |||
) |
References python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.computeAnisotropicFullGrid(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeAnisotropicFullGrid(), python.uq.operations.forcePositivity.fullGridSearch.FullGridCandidates.numDims, sgpp::combigrid::Ishigami.numDims, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.numDims, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.numDims, sgpp::combigrid::Parabola.numDims, sgpp::combigrid::CO2.numDims, sgpp::combigrid::CombigridSurrogateModel.numDims, sgpp::combigrid::AtanUniform.numDims, sgpp::combigrid::AtanBeta.numDims, sgpp::combigrid::Debugfct.numDims, python.uq.models.testEnvironments.ProbabilisticSpaceSGpp.numDims, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.numDims, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.plot, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.plot, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.plotDebug(), and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.plotDebug().
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.estimateCosts | ( | self, | |
overlap, | |||
grid | |||
) |
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findCandidates | ( | self, | |
grid, | |||
alpha, | |||
addedGridPoints | |||
) |
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersection | ( | self, | |
gpi, | |||
gpj | |||
) |
Referenced by python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint(), and python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.plotDebugIntersections().
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersections | ( | self, | |
gpsi, | |||
gpsj, | |||
grid, | |||
alpha | |||
) |
References python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint(), and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint().
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint | ( | self, | |
i, | |||
gpi, | |||
gpsj, | |||
overlap, | |||
grid, | |||
alpha | |||
) |
References python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates.findIntersection(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersection(), python.uq.operations.forcePositivity.findIntersectionsSubspaceBased.IntersectionSubspaceCandidates.findIntersection(), python.uq.operations.sparse_grid.getBoundsOfSupport(), python.uq.operations.sparse_grid.getHierarchicalAncestors(), python.uq.operations.forcePositivity.fullGridSearch.FullGridCandidates.numDims, sgpp::combigrid::Ishigami.numDims, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.numDims, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.numDims, sgpp::combigrid::Parabola.numDims, sgpp::combigrid::CO2.numDims, sgpp::combigrid::CombigridSurrogateModel.numDims, sgpp::combigrid::AtanUniform.numDims, sgpp::combigrid::AtanBeta.numDims, sgpp::combigrid::Debugfct.numDims, python.uq.models.testEnvironments.ProbabilisticSpaceSGpp.numDims, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.numDims, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.plot, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.plot, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.plotDebug(), and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.plotDebug().
Referenced by python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersections().
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findNodesWithNegativeCoefficients | ( | self, | |
grid, | |||
alpha | |||
) |
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getLocalFullGridLevel | ( | self, | |
levels, | |||
indices, | |||
grid | |||
) |
References python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getLocalMaxLevel(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.getLocalMaxLevel(), python.uq.operations.forcePositivity.fullGridSearch.FullGridCandidates.numDims, sgpp::combigrid::Ishigami.numDims, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.numDims, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.numDims, sgpp::combigrid::Parabola.numDims, sgpp::combigrid::CO2.numDims, sgpp::combigrid::CombigridSurrogateModel.numDims, sgpp::combigrid::AtanUniform.numDims, sgpp::combigrid::AtanBeta.numDims, sgpp::combigrid::Debugfct.numDims, python.uq.models.testEnvironments.ProbabilisticSpaceSGpp.numDims, and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.numDims.
Referenced by python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.estimateCosts().
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getLocalMaxLevel | ( | self, | |
dup, | |||
levels, | |||
indices, | |||
grid | |||
) |
References python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getMaxLevelOfChildrenUpToMaxLevel(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.getMaxLevelOfChildrenUpToMaxLevel(), python.uq.operations.forcePositivity.fullGridSearch.FullGridCandidates.numDims, sgpp::combigrid::Ishigami.numDims, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.numDims, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.numDims, sgpp::combigrid::Parabola.numDims, sgpp::combigrid::CO2.numDims, sgpp::combigrid::CombigridSurrogateModel.numDims, sgpp::combigrid::AtanUniform.numDims, sgpp::combigrid::AtanBeta.numDims, sgpp::combigrid::Debugfct.numDims, python.uq.models.testEnvironments.ProbabilisticSpaceSGpp.numDims, and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.numDims.
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getMaxLevelOfChildrenUpToMaxLevel | ( | self, | |
gp, | |||
grid, | |||
idim | |||
) |
References python.uq.operations.sparse_grid.getLevel(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.maxLevel, sgpp::base::ClenshawCurtisTable.maxLevel, and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.maxLevel.
Referenced by python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getLocalMaxLevel().
def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.plotDebug | ( | self, | |
grid, | |||
alpha, | |||
candidates, | |||
gpi, | |||
gpj, | |||
ans | |||
) |
References python.uq.plot.plot2d.plotGrid2d().
Referenced by python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeCandidates(), and python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint().
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.A0 |
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.candidates |
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.costs |
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.globalGrids |
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.grid |
Referenced by python.uq.learner.Interpolant.Interpolant.doLearningIteration(), python.learner.Classifier.Classifier.evalError(), python.uq.learner.Interpolant.Interpolant.evalError(), python.uq.learner.SimulationLearner.SimulationLearner.getCollocationNodes(), python.uq.learner.SimulationLearner.SimulationLearner.getGrid(), python.uq.learner.SimulationLearner.SimulationLearner.getLearner(), python.uq.learner.Regressor.Regressor.learnData(), python.uq.learner.Regressor.Regressor.learnDataWithFolding(), python.uq.learner.Regressor.Regressor.learnDataWithTest(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makePositive(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makePositive(), python.learner.Classifier.Classifier.refineGrid(), python.learner.Regressor.Regressor.refineGrid(), python.uq.learner.Regressor.Regressor.refineGrid(), python.uq.learner.SimulationLearner.SimulationLearner.refineGrid(), python.learner.Classifier.Classifier.updateResults(), python.learner.Regressor.Regressor.updateResults(), and python.uq.learner.Regressor.Regressor.updateResults().
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.gs |
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.iteration |
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.maxLevel |
Referenced by python.uq.refinement.AdmissibleSet.AdmissibleSparseGridNodeSet.addChildren(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getMaxLevelOfChildrenUpToMaxLevel(), python.uq.refinement.AdmissibleSet.AdmissibleSetGenerator.insertPoint(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makePositive(), and python.uq.refinement.AdmissibleSet.RefinableNodesSet.update().
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.newCandidates |
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.numDims |
Referenced by python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.addFullGridPoints(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeAnisotropicFullGrid(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeCandidates(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getLocalFullGridLevel(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getLocalMaxLevel(), and python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makePositive().
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.plot |
Referenced by python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeCandidates(), and python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint().
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.verbose |
Referenced by python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.addFullGridPoints(), python.uq.refinement.RefinementManager.RefinementManager.candidates(), python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates.findIntersections(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makeCurrentNodalValuesPositive(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makePositive(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makePositive(), and python.uq.refinement.RefinementManager.RefinementManager.refineGrid().