python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive Class Reference

Inheritance diagram for python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive:

Public Member Functions
def	__init__ (self, grid)
def	addFullGridPoints (self, grid, alpha)
def	coarsening (self, grid, alpha, newGridPoints)
def	findCandidates (self, grid, alpha)
def	findCandidatesSweep1d (self, d, gp, alpha, grid, acc, negativeAncestorFound=False)
def	lookupFullGridPoints (self, grid, alpha, candidates)
def	lookupFullGridPointsRec1d (self, grid, alpha, gp, d, p, opEval, maxLevel, acc)
def	makeCurrentNodalValuesPositive (self, grid, alpha)
def	makePositive (self, alpha)
def	setInterpolationAlgorithm (self, algorithm)

Public Attributes
	algorithm
	grid
	verbose

Constructor & Destructor Documentation

__init__()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.__init__	(		self,
			grid
	)

Member Function Documentation

addFullGridPoints()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.addFullGridPoints	(		self,
			grid,
			alpha
	)

Add all those full grid points with |accLevel|_1 <= n, where n is the
maximun level of the sparse grid
@param grid: Grid sparse grid to be discretized
@param alpha: numpy array hierarchical coefficients

References python.uq.operations.forcePositivity.findCandidateSet.CandidateSet.findCandidates(), python.uq.operations.forcePositivity.fullGridSearch.FullGridCandidates.findCandidates(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidates(), python.uq.operations.forcePositivity.findIntersectionsSubspaceBased.IntersectionSubspaceCandidates.findCandidates(), python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates.findCandidates(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findCandidates(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findCandidates(), python.uq.operations.sparse_grid.insertHierarchicalAncestors(), python.uq.operations.sparse_grid.insertPoint(), python.uq.operations.sparse_grid.insertTruncatedBorder(), and python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.lookupFullGridPoints().

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makePositive(), and python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makePositive().

coarsening()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.coarsening	(		self,
			grid,
			alpha,
			newGridPoints
	)

Removes all unnecessary grid points. A grid point is defined as
unnecessary if it is a leaf node and its hierarchical coefficient is
negative. This is applied just for the newly added points.
@param grid: Grid
@param alpha: numpy array hierarchical coefficients
@param newGridPoints: newly added grid points

References python.uq.operations.sparse_grid.copyGrid(), and python.uq.operations.sparse_grid.hasChildren().

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makePositive().

findCandidates()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidates	(		self,
			grid,
			alpha
	)

References python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidatesSweep1d(), and python.uq.operations.sparse_grid.getLevel().

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.addFullGridPoints().

findCandidatesSweep1d()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidatesSweep1d	(		self,
			d,
			gp,
			alpha,
			grid,
			acc,
			negativeAncestorFound = False
	)

References python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidatesSweep1d(), and python.uq.operations.sparse_grid.hasAllChildren().

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidates(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidatesSweep1d(), and python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makeCurrentNodalValuesPositive().

lookupFullGridPoints()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.lookupFullGridPoints	(		self,
			grid,
			alpha,
			candidates
	)

References sgpp::op_factory.createOperationEval(), and python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.lookupFullGridPointsRec1d().

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.addFullGridPoints().

lookupFullGridPointsRec1d()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.lookupFullGridPointsRec1d	(		self,
			grid,
			alpha,
			gp,
			d,
			p,
			opEval,
			maxLevel,
			acc
	)

References python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.lookupFullGridPointsRec1d().

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.lookupFullGridPoints(), and python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.lookupFullGridPointsRec1d().

makeCurrentNodalValuesPositive()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makeCurrentNodalValuesPositive	(		self,
			grid,
			alpha
	)

References python.uq.operations.sparse_grid.dehierarchize(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidatesSweep1d(), python.uq.operations.sparse_grid.hierarchize(), python.uq.operations.forcePositivity.findCandidateSet.CandidateSet.verbose, python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.verbose, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.verbose, sgpp::base::OCLManager.verbose, sgpp::base::OCLManagerMultiPlatform.verbose, python.uq.manager.ASGCUQManager.ASGCUQManager.verbose, python.uq.estimators.MonteCarloStrategy.MonteCarloStrategy.verbose, and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.verbose.

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makePositive(), and python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makePositive().

makePositive()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makePositive	(		self,
			alpha
	)

insert recursively all grid points such that the function is positive
defined. Interpolate the function values for the new grid points using
the registered algorithm.
@param alpha: numpy array hierarchical coefficients

References python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.addFullGridPoints(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.algorithm, python.uq.operations.sparse_grid.checkPositivity(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.coarsening(), python.uq.operations.sparse_grid.copyGrid(), python.uq.operations.sparse_grid.dehierarchize(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.grid, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.grid, python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.grid, sgpp::base::OperationMultipleEval.grid, sgpp::base::OperationFirstMomentPolyBoundary.grid, sgpp::base::OperationFirstMomentPolyClenshawCurtis.grid, sgpp::base::OperationFirstMomentModBspline.grid, sgpp::base::OperationFirstMomentBspline.grid, sgpp::base::OperationFirstMomentBsplineBoundary.grid, sgpp::base::OperationSecondMomentBspline.grid, sgpp::base::OperationSecondMomentBsplineBoundary.grid, sgpp::base::OperationFirstMomentModPoly.grid, sgpp::base::OperationSecondMomentModBspline.grid, sgpp::base::OperationSecondMomentModPoly.grid, sgpp::base::OperationSecondMomentPoly.grid, sgpp::base::OperationSecondMomentModPolyClenshawCurtis.grid, sgpp::base::OperationFirstMomentModPolyClenshawCurtis.grid, sgpp::base::OperationFirstMomentPoly.grid, sgpp::base::OperationSecondMomentPolyBoundary.grid, sgpp::base::OperationSecondMomentPolyClenshawCurtis.grid, sgpp::base::OperationSecondMomentPolyClenshawCurtisBoundary.grid, sgpp::base::OperationFirstMomentPolyClenshawCurtisBoundary.grid, sgpp::base::OperationFirstMomentBsplineClenshawCurtis.grid, sgpp::base::OperationFirstMomentModBsplineClenshawCurtis.grid, sgpp::base::OperationSecondMomentBsplineClenshawCurtis.grid, sgpp::base::OperationSecondMomentModBsplineClenshawCurtis.grid, sgpp::base::OperationHierarchisationFundamentalSpline.grid, sgpp::base::OperationHierarchisationModFundamentalSpline.grid, sgpp::base::OperationArbitraryBoundaryHierarchisation.grid, python.uq.learner.Learner.Learner.grid, python.uq.dists.SGDEdist.SGDEdist.grid, python.learner.Learner.Learner.grid, sgpp::base::DehierarchisationFundamentalSpline.grid, sgpp::base::HierarchisationModFundamentalSpline.grid, sgpp::base::HierarchisationFundamentalSpline.grid, sgpp::base::DehierarchisationModFundamentalSpline.grid, sgpp::base::OperationQuadratureMC.grid, python.controller.CheckpointController.CheckpointController.grid, sgpp::combigrid::LTwoScalarProductHashMapNakBsplineBoundaryCombigrid.grid, sgpp::base::ImpurityRefinementIndicator.grid, sgpp::base::ForwardSelectorRefinementIndicator.grid, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.grid, python.tools.Matrix.grid, python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makeCurrentNodalValuesPositive(), python.uq.plot.plot2d.plotSG2d(), python.uq.operations.forcePositivity.findCandidateSet.CandidateSet.verbose, python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.verbose, python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.verbose, sgpp::base::OCLManager.verbose, sgpp::base::OCLManagerMultiPlatform.verbose, python.uq.manager.ASGCUQManager.ASGCUQManager.verbose, python.uq.estimators.MonteCarloStrategy.MonteCarloStrategy.verbose, and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.verbose.

setInterpolationAlgorithm()

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.setInterpolationAlgorithm	(		self,
			algorithm
	)

Member Data Documentation

algorithm

python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.algorithm

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makePositive().

grid

python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.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().

verbose

python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.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().

---

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

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