SG++-Doxygen-Documentation
python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates Class Reference
Inheritance diagram for python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates:

Public Member Functions

def __init__ (self, grid)
 
def coarseIntersections (self, grid, sortedIntersections)
 
def computeCandidates (self, sortedOverlap, grid, alpha, nonOverlapping)
 
def estimateCosts (self, overlap, grid)
 
def findCandidates (self, grid, alpha, addedGridPoints)
 
def findInnerIntersection (self, gpi, gpj)
 
def findIntersections (self, gpsi, gpsj, grid)
 
def findIntersectionsOfOverlappingSuppportsForOneGridPoint (self, gpi, gpsj, overlap, grid)
 
def findNodesWithNegativeCoefficients (self, grid, alpha)
 
def findOuterIntersection (self, gpi, gpj)
 
def getLocalFullGridLevel (self, levels, indices, grid, gpk=None, gpl=None)
 
def getLocalMaxLevel (self, dup, levels, indices, grid)
 
def getMaxLevelOfChildrenUpToMaxLevel (self, gp, grid, idim)
 
def mergeLocalGrids (self, iFullGrid, jFullGrid, idims=None)
 
def plotCandidates (self, candidates)
 
def plotDebug (self, grid, alpha, candidates, localFullGrid, ans, allCounts)
 
def splitFullGrids (self, overlappingGrids, sortedCoarsedOverlap, grid)
 
def splitIntersections (self, sortedCoarsedOverlap)
 
def splitLocalFullGridDimx (self, kFullGrid, lFullGrid, levelOuter, kdim)
 
def splitLocalFullGrids (self, iFullGrid, jFullGrid)
 
def updateLocalGridLists (self, iGridList, jGridList)
 

Public Attributes

 A0
 
 candidates
 
 costs
 
 debug
 
 globalGrids
 
 grid
 
 gs
 
 iteration
 
 maxLevel
 
 multipleSplittingScheme
 
 newCandidates
 
 numDims
 
 plot
 
 plotSubgrids
 
 plotSubtract
 
 reduceLocalGrids
 
 verbose
 

Constructor & Destructor Documentation

◆ __init__()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.__init__ (   self,
  grid 
)

Member Function Documentation

◆ coarseIntersections()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.coarseIntersections (   self,
  grid,
  sortedIntersections 
)

◆ computeCandidates()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.computeCandidates (   self,
  sortedOverlap,
  grid,
  alpha,
  nonOverlapping 
)

◆ estimateCosts()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.estimateCosts (   self,
  overlap,
  grid 
)

◆ findCandidates()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findCandidates (   self,
  grid,
  alpha,
  addedGridPoints 
)

◆ findInnerIntersection()

◆ findIntersections()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findIntersections (   self,
  gpsi,
  gpsj,
  grid 
)

◆ findIntersectionsOfOverlappingSuppportsForOneGridPoint()

◆ findNodesWithNegativeCoefficients()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findNodesWithNegativeCoefficients (   self,
  grid,
  alpha 
)

◆ findOuterIntersection()

◆ getLocalFullGridLevel()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.getLocalFullGridLevel (   self,
  levels,
  indices,
  grid,
  gpk = None,
  gpl = None 
)

◆ getLocalMaxLevel()

◆ getMaxLevelOfChildrenUpToMaxLevel()

◆ mergeLocalGrids()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.mergeLocalGrids (   self,
  iFullGrid,
  jFullGrid,
  idims = None 
)

◆ plotCandidates()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.plotCandidates (   self,
  candidates 
)

◆ plotDebug()

◆ splitFullGrids()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.splitFullGrids (   self,
  overlappingGrids,
  sortedCoarsedOverlap,
  grid 
)

◆ splitIntersections()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.splitIntersections (   self,
  sortedCoarsedOverlap 
)

◆ splitLocalFullGridDimx()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.splitLocalFullGridDimx (   self,
  kFullGrid,
  lFullGrid,
  levelOuter,
  kdim 
)

◆ splitLocalFullGrids()

◆ updateLocalGridLists()

def python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.updateLocalGridLists (   self,
  iGridList,
  jGridList 
)

Member Data Documentation

◆ A0

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.A0

◆ candidates

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.candidates

◆ costs

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.costs

◆ debug

◆ globalGrids

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.globalGrids

◆ grid

◆ gs

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.gs

◆ iteration

◆ maxLevel

◆ multipleSplittingScheme

◆ newCandidates

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.newCandidates

◆ numDims

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.numDims

Referenced by python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.addFullGridPoints(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeAnisotropicFullGrid(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.computeCandidates(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.computeCandidates(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findInnerIntersection(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findOuterIntersection(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getLocalFullGridLevel(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.getLocalFullGridLevel(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getLocalMaxLevel(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.getLocalMaxLevel(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makePositive(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.splitFullGrids(), and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.splitLocalFullGrids().

◆ plot

◆ plotSubgrids

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.plotSubgrids

◆ plotSubtract

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.plotSubtract

◆ reduceLocalGrids

python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.reduceLocalGrids

◆ verbose


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