SG++
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

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

Member Function Documentation

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.addFullGridPoints (   self,
  grid,
  alpha 
)
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().

def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidates (   self,
  grid,
  alpha 
)
def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.lookupFullGridPoints (   self,
  grid,
  alpha,
  candidates 
)
def python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.lookupFullGridPointsRec1d (   self,
  grid,
  alpha,
  gp,
  d,
  p,
  opEval,
  maxLevel,
  acc 
)
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.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::OperationHierarchisationModFundamentalSpline.grid, sgpp::base::OperationHierarchisationFundamentalSpline.grid, python.uq.learner.Learner.Learner.grid, python.learner.Learner.Learner.grid, sgpp::base::HierarchisationFundamentalSpline.grid, sgpp::base::DehierarchisationFundamentalSpline.grid, sgpp::base::HierarchisationModFundamentalSpline.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.

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

Member Data Documentation

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

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