SG++
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates Class Reference
Inheritance diagram for python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates:

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
 

Constructor & Destructor Documentation

def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.__init__ (   self,
  grid 
)

Member Function Documentation

def python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeCandidates (   self,
  sortedOverlap,
  localFullGridLevels,
  grid,
  alpha 
)
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.findIntersections (   self,
  gpsi,
  gpsj,
  grid,
  alpha 
)
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.models.testEnvironments.PCEBuilderHeat.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.plotDebug (   self,
  grid,
  alpha,
  candidates,
  gpi,
  gpj,
  ans 
)

Member Data Documentation

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.gs
python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.newCandidates

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