SG++
python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast Class Reference
Inheritance diagram for python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast:

Public Member Functions

def __init__ (self, grid, candidateSearchAlgorithm=None, interpolationAlgorithm=None)
 
def addFullGridPoints (self, grid, alpha, candidates, tol=-1e-14)
 
def coarsening (self, grid, alpha, newGridPoints, tol=1e-14)
 
def makeAddedNodalValuesPositive (self, grid, alpha, addedGridPoints, tol=-1e-14)
 
def makeCurrentNodalValuesPositive (self, grid, alpha, tol=-1e-14)
 
def makePositive (self, alpha)
 
def plotDebug (self, grid, alpha, addedGridPoints, candidates)
 
def plotDebugIntersections (self, newGrid, overlappingGridPoints)
 
def setCandidateSetSearchAlgorithm (self, algorithm)
 
def setInterpolationAlgorithm (self, algorithm)
 
def sortCandidatesByLevelSum (self, candidates)
 

Public Attributes

 addAllGridPointsOnNextLevel
 
 candidateSearchAlgorithm
 
 grid
 
 interpolationAlgorithm
 
 lastMinimumCandidateLevelSum
 
 maxLevel
 
 maxNewGridPoints
 
 numDims
 
 verbose
 

Constructor & Destructor Documentation

def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.__init__ (   self,
  grid,
  candidateSearchAlgorithm = None,
  interpolationAlgorithm = None 
)

Member Function Documentation

def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.addFullGridPoints (   self,
  grid,
  alpha,
  candidates,
  tol = -1e-14 
)
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 candidates:
@param tol:

References python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.addAllGridPointsOnNextLevel, python.uq.operations.sparse_grid.evalSGFunctionMulti(), python.uq.operations.sparse_grid.insertHierarchicalAncestors(), python.uq.operations.sparse_grid.insertPoint(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.lastMinimumCandidateLevelSum, python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.maxNewGridPoints, 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, python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.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.models.testEnvironments.PCEBuilderHeat.numDims, python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.sortCandidatesByLevelSum(), 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.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.verbose, python.uq.estimators.MonteCarloStrategy.MonteCarloStrategy.verbose, and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.verbose.

Referenced by python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makePositive().

def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.coarsening (   self,
  grid,
  alpha,
  newGridPoints,
  tol = 1e-14 
)
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

References python.uq.operations.sparse_grid.copyGrid().

def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makeAddedNodalValuesPositive (   self,
  grid,
  alpha,
  addedGridPoints,
  tol = -1e-14 
)
def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makeCurrentNodalValuesPositive (   self,
  grid,
  alpha,
  tol = -1e-14 
)
def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.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.operationMakePositiveFast.OperationMakePositiveFast.addFullGridPoints(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.addFullGridPoints(), python.uq.operations.sparse_grid.copyGrid(), 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, python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.grid, sgpp::base::OperationHierarchisationModFundamentalSpline.grid, sgpp::base::OperationHierarchisationFundamentalSpline.grid, python.uq.learner.Learner.Learner.grid, python.learner.Learner.Learner.grid, sgpp::base::DehierarchisationFundamentalSpline.grid, sgpp::base::HierarchisationFundamentalSpline.grid, sgpp::base::HierarchisationModFundamentalSpline.grid, sgpp::base::DehierarchisationModFundamentalSpline.grid, sgpp::base::OperationQuadratureMC.grid, python.controller.CheckpointController.CheckpointController.grid, sgpp::combigrid::LTwoScalarProductHashMapNakBsplineBoundaryCombigrid.grid, sgpp::base::ForwardSelectorRefinementIndicator.grid, sgpp::base::ImpurityRefinementIndicator.grid, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.grid, python.tools.Matrix.grid, python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.interpolationAlgorithm, python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makeAddedNodalValuesPositive(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makeCurrentNodalValuesPositive(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makeCurrentNodalValuesPositive(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.maxLevel, python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.maxLevel, sgpp::base::ClenshawCurtisTable.maxLevel, python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.maxLevel, 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, python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.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.models.testEnvironments.PCEBuilderHeat.numDims, 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.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.verbose, python.uq.estimators.MonteCarloStrategy.MonteCarloStrategy.verbose, and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.verbose.

def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.plotDebug (   self,
  grid,
  alpha,
  addedGridPoints,
  candidates 
)
def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.setCandidateSetSearchAlgorithm (   self,
  algorithm 
)
def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.setInterpolationAlgorithm (   self,
  algorithm 
)
def python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.sortCandidatesByLevelSum (   self,
  candidates 
)

Member Data Documentation

python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.addAllGridPointsOnNextLevel
python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.candidateSearchAlgorithm
python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.lastMinimumCandidateLevelSum
python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.maxNewGridPoints

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