python.uq.operations.forcePositivity Namespace Reference

Namespaces
	estimateDensity
	findCandidateSet
	findIntersections
	findIntersectionsSubspaceBased
	fullGridSearch
	interpolateFunction
	interpolationAlgorithm
	localFullGridSearch
	localHierarchicalIntersectionSearch
	operationMakePositive
	operationMakePositiveFast
	scaledMinOfParents
	searchNextLevel
	setGridPointsToZero

Functions
def	computeNodalValues (jgrid, grid, alpha)
def	makePositive (grid, alpha)

Function Documentation

computeNodalValues()

def python.uq.operations.forcePositivity.computeNodalValues	(		jgrid,
			grid,
			alpha
	)

Dehierarchization of sparse grid function (grid, alpha) on new grid (jgrid)
@param jgrid: Grid, new discretization
@param grid: Grid, old discretization
@param alpha: DataVector, surpluses for grid
@return: DataVector, nodalValues of jgrid

References python.uq.operations.sparse_grid.evalSGFunctionMulti().

Referenced by python.uq.operations.forcePositivity.makePositive().

makePositive()

def python.uq.operations.forcePositivity.makePositive	(		grid,
			alpha
	)

insert full grid points if they are negative and the father
node is part of the sparse grid
@param grid:
@param alpha:

References python.uq.operations.forcePositivity.computeNodalValues(), python.uq.operations.sparse_grid.copyGrid(), python.uq.operations.sparse_grid.hierarchize(), python.uq.operations.sparse_grid.insertHierarchicalAncestors(), and python.uq.operations.sparse_grid.insertPoint().