|
def | python.uq.operations.sparse_grid.add (alpha, alphas) |
|
def | python.uq.operations.sparse_grid.addConst (grid, alpha, c, y) |
|
def | python.uq.operations.sparse_grid.balance (grid) |
|
def | python.uq.operations.sparse_grid.checkInterpolation (grid, alpha, nodalValues, epsilon=1e-13) |
|
def | python.uq.operations.sparse_grid.checkPositivity (grid, alpha) |
|
def | python.uq.operations.sparse_grid.copyGrid (grid, level=0, deg=1) |
|
def | python.uq.operations.sparse_grid.createGrid (grid, dim, deg=1, addTruncatedBorder=False) |
|
def | python.uq.operations.sparse_grid.dehierarchize (grid, alpha) |
|
def | python.uq.operations.sparse_grid.dehierarchizeList (grid, alpha, gps) |
|
def | python.uq.operations.sparse_grid.dehierarchizeOnNewGrid (gridResult, grid, alpha) |
|
def | python.uq.operations.sparse_grid.estimateConvergence (grid, gp, v) |
|
def | python.uq.operations.sparse_grid.estimateSurplus (grid, gp, v) |
| def estimateSurplus(grid, gp, v): gs = grid.getStorage() ix = gs.getSequenceNumber(gp) More...
|
|
def | python.uq.operations.sparse_grid.evalHierToTop (basis, grid, coeffs, gp, d) |
|
def | python.uq.operations.sparse_grid.evalSGFunction (grid, alpha, p, isConsistent=True) |
|
def | python.uq.operations.sparse_grid.evalSGFunctionBasedOnParents (grid, alpha, gpi) |
|
def | python.uq.operations.sparse_grid.evalSGFunctionMulti (grid, alpha, samples, isConsistent=True) |
|
def | python.uq.operations.sparse_grid.getBasis (grid) |
|
def | python.uq.operations.sparse_grid.getBoundsOfSupport (gs, level, index, gridType=GridType_Linear) |
|
def | python.uq.operations.sparse_grid.getDegree (grid) |
|
def | python.uq.operations.sparse_grid.getGridPointsOnBoundary (level, index) |
|
def | python.uq.operations.sparse_grid.getGridPointsOnBoundaryEfficiently (level, index) |
|
def | python.uq.operations.sparse_grid.getHierarchicalAncestors (grid, gp) |
|
def | python.uq.operations.sparse_grid.getIndex (gp) |
|
def | python.uq.operations.sparse_grid.getLevel (gp) |
|
def | python.uq.operations.sparse_grid.getLevelIndex (gp) |
|
def | python.uq.operations.sparse_grid.getNonExistingHierarchicalAncestors (grid, gp) |
|
def | python.uq.operations.sparse_grid.hasAllChildren (grid, gp) |
|
def | python.uq.operations.sparse_grid.hasBorder (gridType) |
|
def | python.uq.operations.sparse_grid.hasChildren (grid, gp) |
|
def | python.uq.operations.sparse_grid.haveHierarchicalRelationshipByLevelIndex (location_i, location_j) |
|
def | python.uq.operations.sparse_grid.haveOverlappingSupport (gpi, gpj) |
|
def | python.uq.operations.sparse_grid.haveOverlappingSupportByLevelIndex (location_i, location_j) |
|
def | python.uq.operations.sparse_grid.haveOverlappingSupportDimx (lid, iid, ljd, ijd) |
|
def | python.uq.operations.sparse_grid.hierarchize (grid, nodalValues, isConsistent=True, ignore=None) |
|
def | python.uq.operations.sparse_grid.hierarchizeBruteForce (grid, nodalValues, ignore=None) |
|
def | python.uq.operations.sparse_grid.hierarchizeEvalHierToTop (grid, nodalValues) |
|
def | python.uq.operations.sparse_grid.insertHierarchicalAncestors (grid, gp) |
|
def | python.uq.operations.sparse_grid.insertPoint (grid, gp) |
|
def | python.uq.operations.sparse_grid.insertTruncatedBorder (grid, gp) |
|
def | python.uq.operations.sparse_grid.isHierarchicalAncestor (gpi, gpj) |
|
def | python.uq.operations.sparse_grid.isHierarchicalAncestorByLevelIndex (location_i, location_j) |
|
def | python.uq.operations.sparse_grid.isHierarchicalAncestorDimx (li, ii, lj, ij) |
|
def | python.uq.operations.sparse_grid.isRefineable (grid, gp) |
|
def | python.uq.operations.sparse_grid.isValid (grid, gp) |
|
def | python.uq.operations.sparse_grid.isValid1d (grid, level, index) |
|
def | python.uq.operations.sparse_grid.loadOperationMultiEval (grid, samples, isConsistent=True) |
|
def | python.uq.operations.sparse_grid.parent (grid, gp, d) |
|
def | python.uq.operations.sparse_grid.parents (grid, gp) |
|
def | python.uq.operations.sparse_grid.sub (alpha, alphas) |
|