|
def | create (self, grid) |
|
def | update (self, grid, gps) |
|
def | __contains__ (self, elem) |
|
def | __init__ (self, maxLevel=30) |
|
def | checkRange (self, gp, maxLevel) |
|
def | create (self, grid) |
|
def | getSize (self) |
|
def | insertPoint (self, gp) |
|
def | update (self, grid, nps) |
|
def | values (self) |
|
◆ create()
def python.uq.refinement.AdmissibleSet.RefinableNodesSet.create |
( |
|
self, |
|
|
|
grid |
|
) |
| |
◆ update()
def python.uq.refinement.AdmissibleSet.RefinableNodesSet.update |
( |
|
self, |
|
|
|
grid, |
|
|
|
gps |
|
) |
| |
References python.uq.refinement.AdmissibleSet.AdmissibleSetGenerator.admissibleSet, python.uq.refinement.AdmissibleSet.AdmissibleSetGenerator.checkRange(), python.uq.refinement.AdmissibleSet.AdmissibleSetGenerator.insertPoint(), sgpp::base::Grid.insertPoint(), python.uq.operations.sparse_grid.isRefineable(), python.uq.refinement.AdmissibleSet.AdmissibleSetGenerator.maxLevel, 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, and python.uq.refinement.AdmissibleSet.AdmissibleSetGenerator.values().
Referenced by python.uq.refinement.RefinementStrategy.Ranking.rank().
The documentation for this class was generated from the following file: