python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates Class Reference

Inheritance diagram for python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates:

Public Member Functions
def	__init__ (self, grid, alpha)
def	findCandidates (self, grid, alpha, addedGridPoints)
def	getAllChildrenNodesUpToMaxLevel (self, gp, maxLevel, grid)

Public Attributes
	candidates
	costs
	iteration
	maxLevelSum
	minLevelSum
	newCandidates

Constructor & Destructor Documentation

__init__()

def python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.__init__	(		self,
			grid,
			alpha
	)

Member Function Documentation

findCandidates()

def python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.findCandidates	(		self,
			grid,
			alpha,
			addedGridPoints
	)

collect all leaf nodes with at least one negative hierarchical
ancestor

getAllChildrenNodesUpToMaxLevel()

def python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.getAllChildrenNodesUpToMaxLevel	(		self,
			gp,
			maxLevel,
			grid
	)

References python.uq.operations.forcePositivity.findCandidateSet.CandidateSet.costs, python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.costs, python.uq.operations.forcePositivity.findIntersectionsSubspaceBased.IntersectionSubspaceCandidates.costs, python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates.costs, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.costs, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.costs, python.uq.operations.sparse_grid.getIndex(), and python.uq.operations.sparse_grid.getLevel().

Member Data Documentation

candidates

python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.candidates

Referenced by python.uq.refinement.RefinementManager.RefinementManager.refineGrid().

costs

python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.costs

Referenced by python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.getAllChildrenNodesUpToMaxLevel().

iteration

python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.iteration

Referenced by python.uq.learner.Regressor.Regressor.learnData(), python.uq.learner.Interpolant.Interpolant.learnDataWithTest(), python.uq.learner.SimulationLearner.SimulationLearner.refineGrid(), and python.uq.learner.SimulationLearner.SimulationLearner.updateResults().

maxLevelSum

python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.maxLevelSum

minLevelSum

python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.minLevelSum

newCandidates

python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.newCandidates

---

The documentation for this class was generated from the following file:

• datadriven/python/uq/operations/forcePositivity/searchNextLevel.py