python.uq.operations.sparse_grid Namespace Reference

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

Variables
list	bsplineBoundaryGridTypes
list	bsplineGridTypes = bsplineNoBoundaryGridTypes + bsplineBoundaryGridTypes
list	bsplineNoBoundaryGridTypes
list	linearBoundaryGridTypes
list	linearGridTypes = linearNoBoundaryGridTypes + linearBoundaryGridTypes
list	linearNoBoundaryGridTypes
list	multipleEvalNaiveGridTypes
list	polyBoundaryGridTypes
list	polyGridTypes = polyNoBoundaryGridTypes + polyBoundaryGridTypes
list	polyNoBoundaryGridTypes

Function Documentation

add()

def python.uq.operations.sparse_grid.add	(		alpha,
			alphas
	)

Referenced by python.uq.parameters.ParameterDescriptor.UncertainParameterDesciptor.andGetResult(), and python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates.findIntersections().

addConst()

def python.uq.operations.sparse_grid.addConst	(		grid,
			alpha,
			c,
			y
	)

References sgpp::op_factory.createOperationHierarchisation().

balance()

def python.uq.operations.sparse_grid.balance

(

grid

)

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

Referenced by python.uq.refinement.RefinementManager.RefinementManager.candidates().

checkInterpolation()

def python.uq.operations.sparse_grid.checkInterpolation	(		grid,
			alpha,
			nodalValues,
			epsilon = 1e-13
	)

References sgpp::op_factory.createOperationEvalNaive().

checkPositivity()

def python.uq.operations.sparse_grid.checkPositivity	(		grid,
			alpha
	)

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

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

copyGrid()

def python.uq.operations.sparse_grid.copyGrid	(		grid,
			level = 0,
			deg = 1
	)

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

Referenced by python.uq.refinement.RefinementManager.RefinementManager.candidates(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.coarsening(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.coarsening(), python.uq.operations.discretization.discretize(), python.uq.operations.general.join(), python.uq.learner.SimulationLearner.SimulationLearner.learnData(), python.uq.learner.SimulationLearner.SimulationLearner.learnDataWithFolding(), python.uq.manager.ASGCUQManager.ASGCUQManager.learnDataWithoutTest(), python.uq.manager.ASGCUQManager.ASGCUQManager.learnDataWithTest(), python.uq.learner.SimulationLearner.SimulationLearner.learnDataWithTest(), python.uq.operations.forcePositivity.makePositive(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makePositive(), and python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makePositive().

createGrid()

def python.uq.operations.sparse_grid.createGrid	(		grid,
			dim,
			deg = 1,
			addTruncatedBorder = False
	)

Referenced by python.uq.operations.sparse_grid.copyGrid(), python.uq.operations.general.extend_grid_1d(), python.uq.operations.general.project(), python.uq.learner.builder.SimulationLearnerBuilder.SimulationLearnerBuilder.withKnowledge(), and python.uq.sampler.asgc.ASGCSamplerBuilder.ASGCSamplerBuilder.withStopPolicy().

dehierarchize()

def python.uq.operations.sparse_grid.dehierarchize	(		grid,
			alpha
	)

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

Referenced by python.uq.operations.forcePositivity.setGridPointsToZero.SetGridPointsToZero.computeHierarchicalCoefficients(), python.uq.operations.forcePositivity.estimateDensity.EstimateDensityAlgorithm.computeHierarchicalCoefficients(), python.uq.operations.forcePositivity.scaledMinOfParents.ScaledMinOfParents.computeHierarchicalCoefficients(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makeCurrentNodalValuesPositive(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makeCurrentNodalValuesPositive(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makePositive(), python.uq.estimators.CollocationPointsStrategy.CollocationPointsStrategy.mean(), and python.uq.estimators.CollocationPointsStrategy.CollocationPointsStrategy.var().

dehierarchizeList()

def python.uq.operations.sparse_grid.dehierarchizeList	(		grid,
			alpha,
			gps
	)

evaluate sparse grid function at grid points in gps
@param grid: Grid
@param alpha: DataVector
@param gps: list of HashGridPoint

References sgpp::op_factory.createOperationMultipleEval().

dehierarchizeOnNewGrid()

def python.uq.operations.sparse_grid.dehierarchizeOnNewGrid	(		gridResult,
			grid,
			alpha
	)

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

estimateConvergence()

def python.uq.operations.sparse_grid.estimateConvergence	(		grid,
			gp,
			v
	)

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

Referenced by python.uq.refinement.RefinementStrategy.SurplusRatioRanking.rank(), and python.uq.refinement.RefinementStrategy.SurplusRatioEstimationRanking.rank().

estimateSurplus()

def python.uq.operations.sparse_grid.estimateSurplus	(		grid,
			gp,
			v
	)

def estimateSurplus(grid, gp, v): gs = grid.getStorage() ix = gs.getSequenceNumber(gp)

surplus is already known

if ix < len(v): print( "warning: not estimated", ) return v[ix]

vgp = []

get all available parents

myParents = [(d, pgp) for (d, pgp) in parents(grid, gp) if gs.isContaining(pgp)] vparents = np.ndarray(len(myParents), dtype='float') for i, (dp, p) in enumerate(myParents): ipar = gs.getSequenceNumber(p) vparents[i] = v[ipar]

get all grand parents = parents of parents

for dgrp, grp in parents(grid, p):

use a linear extrapolation through parent and grandparent

to estimate the surplus of the current collocation node

igrandpar = gs.getSequenceNumber(grp) xpar = p.getStandardCoordinate(dgrp) xgrandpar = grp.getStandardCoordinate(dgrp) xgp = p.getStandardCoordinate(dgrp) + 2 ** -gp.getLevel(dp)

slope between parent and grand parent

a = (v[ipar] - v[igrandpar]) / (xpar - xgrandpar)

half the slope for the child

a /= 2.

same behavior -> keep direction

if (v[ipar] > 0 and v[igrandpar] > 0) or \ (v[ipar] < 0 and v[igrandpar] < 0): sign = 1.

alternating behavior -> change direction

else: sign = -1.

a *= sign

add constant part

b = v[ipar] - a * xpar

force extrapolation with half the difference between

father and grand father for the child

xgp = xpar + (xpar - xgrandpar) / 2.

do the linear extrapolation

y = a * xgp + b

import matplotlib.pyplot as plt

plt.plot([xpar, xgp], [a * xi + b for xi in [xpar, xgp]])

plt.plot([xgrandpar, xpar], [sign * 2 * a * xi + v[ipar]

- sign * 2 * a * xpar

for xi in [xgrandpar, xpar]])

plt.plot(xpar, v[ipar], marker='p', label='parent')

plt.plot(xgrandpar, v[igrandpar], marker='o', label='grand father')

plt.plot(xgp, y, marker='x', label='self')

plt.legend(loc='best')

plt.show()

        vgp.append(y)

if len(vgp) == 0:
    vgp = vparents

return np.max(vgp) 

Linear extrapolation of the surplus
@param grid: Grid
@param gp: HashGridPoint
@param v: DataVector, surplus vector
@return: float, estimated surplus for gp

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

Referenced by python.uq.refinement.RefinementStrategy.SquaredSurplusBFRanking.rank(), python.uq.refinement.RefinementStrategy.ExpectationValueBFRanking.rank(), python.uq.refinement.RefinementStrategy.LinearSurplusEstimationRanking.rank(), and python.uq.refinement.RefinementStrategy.VarianceBFRanking.update().

evalHierToTop()

def python.uq.operations.sparse_grid.evalHierToTop	(		basis,
			grid,
			coeffs,
			gp,
			d
	)

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

Referenced by python.uq.operations.sparse_grid.hierarchizeBruteForce().

evalSGFunction()

def python.uq.operations.sparse_grid.evalSGFunction	(		grid,
			alpha,
			p,
			isConsistent = True
	)

References sgpp::op_factory.createOperationEval(), sgpp::op_factory.createOperationEvalNaive(), and python.uq.operations.sparse_grid.evalSGFunctionMulti().

Referenced by python.uq.analysis.asgc.anova.hdmrAnalytic.HDMRAnalytic.doDecomposition(), python.uq.estimators.PiecewiseConstantIntegralStrategy.PiecewiseConstantIntegralStrategy.estimate(), python.uq.analysis.asgc.ASGCAnalysis.ASGCAnalysis.eval(), python.uq.operations.sparse_grid.hierarchizeEvalHierToTop(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makeAddedNodalValuesPositive(), python.uq.dists.SGDEdist.SGDEdist.pdf(), python.uq.plot.plot1d.plotSG1d(), python.uq.plot.plot3d.plotSG3d(), python.uq.plot.plot1d.plotSGNodal1d(), python.uq.plot.plot3d.plotSGNodal3d(), and python.uq.refinement.RefinementStrategy.AnchoredVarianceOptRanking.update().

evalSGFunctionBasedOnParents()

def python.uq.operations.sparse_grid.evalSGFunctionBasedOnParents	(		grid,
			alpha,
			gpi
	)

References python.statsfileInfo.f, and python.uq.operations.sparse_grid.getBasis().

evalSGFunctionMulti()

def python.uq.operations.sparse_grid.evalSGFunctionMulti	(		grid,
			alpha,
			samples,
			isConsistent = True
	)

References sgpp::op_factory.createOperationMultipleEval(), and sgpp::op_factory.createOperationMultipleEvalNaive().

Referenced by python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.addFullGridPoints(), python.uq.operations.sparse_grid.checkPositivity(), python.uq.operations.discretization.computeCoefficients(), python.uq.operations.discretizeProduct.computeErrors(), python.uq.operations.discretization.computeErrors(), python.uq.operations.forcePositivity.computeNodalValues(), python.uq.operations.sparse_grid.dehierarchize(), python.uq.operations.discretizeProduct.dehierarchizeOnNewGrid(), python.uq.operations.sparse_grid.dehierarchizeOnNewGrid(), python.uq.operations.discretization.estimateDiscreteL2Error(), python.uq.learner.Interpolant.Interpolant.evalError(), python.uq.operations.sparse_grid.evalSGFunction(), python.uq.estimators.MonteCarloStrategy.MonteCarloStrategy.mean(), python.uq.plot.plot2d.plotSG2d(), python.uq.analysis.asgc.ASGCAnalysis.ASGCAnalysis.sampleGrids(), and python.uq.estimators.MonteCarloStrategy.MonteCarloStrategy.var().

getBasis()

def python.uq.operations.sparse_grid.getBasis

(

grid

)

Referenced by python.uq.quadrature.bilinearform.bilinear_form_admissible_set.computeBF(), python.uq.quadrature.bilinearform.bilinear_form_admissible_set.computeBFQuad(), python.uq.quadrature.bilinearform.BilinearQuadratureStrategy.BilinearQuadratureStrategy.computeBilinearForm(), python.uq.quadrature.bilinearform.bilinear_form.computeBilinearForm(), python.uq.quadrature.bilinearform.bilinear_form.computeBilinearFormQuad(), python.uq.quadrature.bilinearform.bilinear_form_admissible_set.computeExpectationValueEstimation(), python.uq.quadrature.linearform.LinearQuadratureStrategy.LinearQuadratureStrategy.computeLinearForm(), python.uq.estimators.AnalyticEstimationStrategy.AnalyticEstimationStrategy.computeSystemMatrixForMean(), python.uq.estimators.AnalyticEstimationStrategy.AnalyticEstimationStrategy.computeSystemMatrixForVariance(), python.uq.operations.sparse_grid.evalSGFunctionBasedOnParents(), python.uq.quadrature.sparse_grid.getIntegral(), python.uq.operations.sparse_grid.hierarchizeBruteForce(), python.uq.operations.general.project(), python.uq.refinement.RefinementStrategy.MeanSquaredOptRanking.update(), and python.uq.refinement.RefinementStrategy.VarianceBFRanking.update().

getBoundsOfSupport()

def python.uq.operations.sparse_grid.getBoundsOfSupport	(		gs,
			level,
			index,
			gridType = GridType_Linear
	)

Referenced by python.uq.quadrature.bilinearform.DiscreteBilinearScipyQuadratureStrategy.DiscreteBilinearScipyQuadratureStrategy.computeBilinearFormEntry(), python.uq.quadrature.bilinearform.BilinearGaussQuadratureStrategy.BilinearGaussQuadratureStrategy.computeBilinearFormEntry(), python.uq.quadrature.bilinearform.SparseGridQuadratureStrategy.SparseGridQuadratureStrategy.computeBilinearFormEntry(), python.uq.quadrature.linearform.LinearGaussQuadratureStrategy.LinearGaussQuadratureStrategy.computeLinearFormEntry(), python.uq.quadrature.trilinearform.TrilinearGaussQuadratureStrategy.TrilinearGaussQuadratureStrategy.computeTrilinearFormEntry(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint(), and python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.plotDebugIntersections().

getDegree()

def python.uq.operations.sparse_grid.getDegree

(

grid

)

Referenced by sgpp::base::Grid.createGridOfEquivalentType(), sgpp::op_factory.createOperationEval(), sgpp::op_factory.createOperationEvalGradientNaive(), sgpp::op_factory.createOperationEvalHessianNaive(), sgpp::op_factory.createOperationEvalNaive(), sgpp::op_factory.createOperationEvalPartialDerivativeNaive(), sgpp::op_factory.createOperationHierarchisation(), sgpp::op_factory.createOperationMultipleEval(), sgpp::op_factory.createOperationMultipleEvalNaive(), sgpp::op_factory.createOperationQuadrature(), python.uq.operations.discretizeProduct.discretizeProduct(), sgpp::base::OperationFirstMomentModPoly.doQuadrature(), sgpp::base::OperationFirstMomentModPolyClenshawCurtis.doQuadrature(), sgpp::base::OperationFirstMomentPoly.doQuadrature(), sgpp::base::OperationFirstMomentPolyBoundary.doQuadrature(), sgpp::base::OperationFirstMomentPolyClenshawCurtis.doQuadrature(), sgpp::base::OperationFirstMomentBspline.doQuadrature(), sgpp::base::OperationSecondMomentBspline.doQuadrature(), sgpp::base::OperationSecondMomentBsplineBoundary.doQuadrature(), sgpp::base::OperationFirstMomentBsplineBoundary.doQuadrature(), sgpp::base::OperationSecondMomentModBspline.doQuadrature(), sgpp::base::OperationSecondMomentModPoly.doQuadrature(), sgpp::base::OperationFirstMomentModBspline.doQuadrature(), sgpp::base::OperationSecondMomentModPolyClenshawCurtis.doQuadrature(), sgpp::base::OperationSecondMomentPoly.doQuadrature(), sgpp::base::OperationSecondMomentPolyBoundary.doQuadrature(), sgpp::base::OperationSecondMomentPolyClenshawCurtis.doQuadrature(), sgpp::base::OperationSecondMomentPolyClenshawCurtisBoundary.doQuadrature(), sgpp::base::OperationFirstMomentPolyClenshawCurtisBoundary.doQuadrature(), sgpp::base::OperationSecondMomentBsplineClenshawCurtis.doQuadrature(), sgpp::base::OperationSecondMomentModBsplineClenshawCurtis.doQuadrature(), sgpp::base::OperationFirstMomentBsplineClenshawCurtis.doQuadrature(), sgpp::base::OperationFirstMomentModBsplineClenshawCurtis.doQuadrature(), sgpp::datadriven::OperationRosenblattTransformation1DBspline.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DBsplineBoundary.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DBsplineClenshawCurtis.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DModBspline.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DModPoly.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DModPolyClenshawCurtis.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DPoly.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DPolyBoundary.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DPolyClenshawCurtis.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DPolyClenshawCurtisBoundary.doTransformation1D(), sgpp::datadriven::OperationRosenblattTransformation1DModBsplineClenshawCurtis.doTransformation1D(), python.uq.learner.builder.GridDescriptor.GridDescriptor.fromGrid(), sgpp::optimization::HierarchisationSLE.HierarchisationSLE(), sgpp::combigrid::LTwoScalarProductHashMapNakBsplineBoundaryCombigrid.LTwoScalarProductHashMapNakBsplineBoundaryCombigrid(), sgpp::pde::OperationLaplaceModBspline.mult(), sgpp::pde::OperationLaplaceModBsplineClenshawCurtis.mult(), sgpp::pde::OperationMatrixLTwoDotPolyClenshawCurtis.mult(), sgpp::pde::OperationLaplaceModPoly.mult(), sgpp::pde::OperationLaplaceModPolyClenshawCurtis.mult(), sgpp::pde::OperationMatrixLTwoDotModBsplineClenshawCurtis.mult(), sgpp::pde::OperationMatrixLTwoDotModPolyClenshawCurtis.mult(), sgpp::pde::OperationMatrixLTwoDotPolyClenshawCurtisBoundary.mult(), sgpp::pde::OperationLaplacePolyClenshawCurtis.mult(), sgpp::pde::OperationMatrixLTwoDotBspline.mult(), sgpp::pde::OperationMatrixLTwoDotBsplineClenshawCurtis.mult(), sgpp::pde::OperationMatrixLTwoDotPolyBoundary.mult(), sgpp::pde::OperationMatrixLTwoDotModBspline.mult(), sgpp::pde::OperationMatrixLTwoDotModPoly.mult(), sgpp::pde::OperationMatrixLTwoDotPoly.mult(), sgpp::pde::OperationLaplacePoly.mult(), sgpp::pde::OperationLaplaceBsplineClenshawCurtis.mult(), sgpp::pde::OperationLaplaceBsplineBoundary.mult(), sgpp::pde::OperationLaplacePolyClenshawCurtisBoundary.mult(), sgpp::pde::OperationLaplaceBspline.mult(), sgpp::pde::OperationMatrixLTwoDotBsplineBoundary.mult(), sgpp::pde::OperationLaplacePolyBoundary.mult(), sgpp::pde::OperationLaplaceExplicitBspline.OperationLaplaceExplicitBspline(), sgpp::pde::OperationLaplaceExplicitModBspline.OperationLaplaceExplicitModBspline(), sgpp::pde::OperationMatrixLTwoDotExplicitBspline.OperationMatrixLTwoDotExplicitBspline(), sgpp::pde::OperationMatrixLTwoDotExplicitBsplineBoundary.OperationMatrixLTwoDotExplicitBsplineBoundary(), sgpp::pde::OperationMatrixLTwoDotExplicitBsplineClenshawCurtis.OperationMatrixLTwoDotExplicitBsplineClenshawCurtis(), sgpp::pde::OperationMatrixLTwoDotExplicitModBspline.OperationMatrixLTwoDotExplicitModBspline(), sgpp::pde::OperationMatrixLTwoDotExplicitModBsplineClenshawCurtis.OperationMatrixLTwoDotExplicitModBsplineClenshawCurtis(), sgpp::pde::OperationMatrixLTwoDotExplicitModPoly.OperationMatrixLTwoDotExplicitModPoly(), sgpp::pde::OperationMatrixLTwoDotExplicitModPolyClenshawCurtis.OperationMatrixLTwoDotExplicitModPolyClenshawCurtis(), sgpp::pde::OperationMatrixLTwoDotExplicitPoly.OperationMatrixLTwoDotExplicitPoly(), sgpp::pde::OperationMatrixLTwoDotExplicitPolyBoundary.OperationMatrixLTwoDotExplicitPolyBoundary(), sgpp::pde::OperationMatrixLTwoDotExplicitPolyClenshawCurtis.OperationMatrixLTwoDotExplicitPolyClenshawCurtis(), sgpp::pde::OperationMatrixLTwoDotExplicitPolyClenshawCurtisBoundary.OperationMatrixLTwoDotExplicitPolyClenshawCurtisBoundary(), sgpp::datadriven::OperationMultiEvalStreamingBSplineOCL< T >.OperationMultiEvalStreamingBSplineOCL(), sgpp::combigrid::LTwoScalarProductHashMapNakBsplineBoundaryCombigrid.updateGrid(), sgpp::datadriven::OperationInverseRosenblattTransformation1DBspline.~OperationInverseRosenblattTransformation1DBspline(), sgpp::datadriven::OperationInverseRosenblattTransformation1DBsplineBoundary.~OperationInverseRosenblattTransformation1DBsplineBoundary(), sgpp::datadriven::OperationInverseRosenblattTransformation1DBsplineClenshawCurtis.~OperationInverseRosenblattTransformation1DBsplineClenshawCurtis(), sgpp::datadriven::OperationInverseRosenblattTransformation1DModBspline.~OperationInverseRosenblattTransformation1DModBspline(), sgpp::datadriven::OperationInverseRosenblattTransformation1DModBsplineClenshawCurtis.~OperationInverseRosenblattTransformation1DModBsplineClenshawCurtis(), sgpp::datadriven::OperationInverseRosenblattTransformation1DModPoly.~OperationInverseRosenblattTransformation1DModPoly(), sgpp::datadriven::OperationInverseRosenblattTransformation1DModPolyClenshawCurtis.~OperationInverseRosenblattTransformation1DModPolyClenshawCurtis(), sgpp::datadriven::OperationInverseRosenblattTransformation1DPoly.~OperationInverseRosenblattTransformation1DPoly(), sgpp::datadriven::OperationInverseRosenblattTransformation1DPolyBoundary.~OperationInverseRosenblattTransformation1DPolyBoundary(), sgpp::datadriven::OperationInverseRosenblattTransformation1DPolyClenshawCurtis.~OperationInverseRosenblattTransformation1DPolyClenshawCurtis(), and sgpp::datadriven::OperationInverseRosenblattTransformation1DPolyClenshawCurtisBoundary.~OperationInverseRosenblattTransformation1DPolyClenshawCurtisBoundary().

getGridPointsOnBoundary()

def python.uq.operations.sparse_grid.getGridPointsOnBoundary	(		level,
			index
	)

Referenced by python.uq.operations.forcePositivity.scaledMinOfParents.ScaledMinOfParents.computeMin(), and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.getLocalFullGridLevel().

getGridPointsOnBoundaryEfficiently()

def python.uq.operations.sparse_grid.getGridPointsOnBoundaryEfficiently	(		level,
			index
	)

getHierarchicalAncestors()

def python.uq.operations.sparse_grid.getHierarchicalAncestors	(		grid,
			gp
	)

References python.uq.operations.sparse_grid.isValid(), and python.uq.operations.sparse_grid.parents().

Referenced by python.uq.refinement.AdmissibleSet.AdmissibleSparseGridNodeSet.addCollocationNode(), and python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint().

getIndex()

def python.uq.operations.sparse_grid.getIndex

(

gp

)

Referenced by python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.getAllChildrenNodesUpToMaxLevel(), and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.getLocalMaxLevel().

getLevel()

def python.uq.operations.sparse_grid.getLevel

(

gp

)

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidates(), python.uq.operations.forcePositivity.searchNextLevel.SearchLevelWiseForCandidates.getAllChildrenNodesUpToMaxLevel(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.getLocalMaxLevel(), python.uq.operations.forcePositivity.localHierarchicalIntersectionSearch.LocalHierarchicalIntersectionCandidates.getMaxLevelOfChildrenUpToMaxLevel(), and python.uq.operations.sparse_grid.hierarchizeBruteForce().

getLevelIndex()

def python.uq.operations.sparse_grid.getLevelIndex

(

gp

)

Referenced by python.uq.operations.forcePositivity.scaledMinOfParents.ScaledMinOfParents.computeMin(), python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates.findNodesWithNegativeCoefficients(), and python.uq.operations.forcePositivity.findIntersectionsSubspaceBased.IntersectionSubspaceCandidates.findNodesWithNegativeCoefficients().

getNonExistingHierarchicalAncestors()

def python.uq.operations.sparse_grid.getNonExistingHierarchicalAncestors	(		grid,
			gp
	)

References python.uq.operations.sparse_grid.isValid(), and python.uq.operations.sparse_grid.parents().

hasAllChildren()

def python.uq.operations.sparse_grid.hasAllChildren	(		grid,
			gp
	)

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.findCandidatesSweep1d().

hasBorder()

def python.uq.operations.sparse_grid.hasBorder

(

gridType

)

Referenced by python.uq.models.testEnvironments.TestEnvironmentSG.buildSetting(), python.uq.learner.builder.GridDescriptor.GridDescriptor.fromGrid(), python.uq.operations.sparse_grid.hierarchizeBruteForce(), python.uq.operations.sparse_grid.isValid(), python.uq.operations.sparse_grid.isValid1d(), and python.uq.refinement.LocalRefinementStrategy.CreateAllChildrenRefinement.refine().

hasChildren()

def python.uq.operations.sparse_grid.hasChildren	(		grid,
			gp
	)

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.coarsening().

haveHierarchicalRelationshipByLevelIndex()

def python.uq.operations.sparse_grid.haveHierarchicalRelationshipByLevelIndex	(		location_i,
			location_j
	)

Referenced by python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates.findIntersections(), and python.uq.operations.forcePositivity.findIntersectionsSubspaceBased.IntersectionSubspaceCandidates.findIntersections().

haveOverlappingSupport()

def python.uq.operations.sparse_grid.haveOverlappingSupport	(		gpi,
			gpj
	)

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

Referenced by python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint().

haveOverlappingSupportByLevelIndex()

def python.uq.operations.sparse_grid.haveOverlappingSupportByLevelIndex	(		location_i,
			location_j
	)

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

Referenced by python.uq.operations.forcePositivity.findIntersections.IntersectionCandidates.findIntersections(), python.uq.operations.forcePositivity.findIntersectionsSubspaceBased.IntersectionSubspaceCandidates.findIntersections(), and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.overlap().

haveOverlappingSupportDimx()

def python.uq.operations.sparse_grid.haveOverlappingSupportDimx	(		lid,
			iid,
			ljd,
			ijd
	)

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

Referenced by python.uq.operations.sparse_grid.haveOverlappingSupport(), python.uq.operations.sparse_grid.haveOverlappingSupportByLevelIndex(), and python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.overlapDimx().

hierarchize()

def python.uq.operations.sparse_grid.hierarchize	(		grid,
			nodalValues,
			isConsistent = True,
			ignore = None
	)

References sgpp::op_factory.createOperationArbitraryBoundaryHierarchisation(), sgpp::op_factory.createOperationHierarchisation(), sgpp::op_factory.createOperationMultipleHierarchisation(), and python.uq.operations.sparse_grid.hierarchizeBruteForce().

Referenced by python.uq.quadrature.bilinearform.bilinear_form_admissible_set.computeBF(), python.uq.quadrature.bilinearform.bilinear_form.computeBilinearForm(), python.uq.quadrature.bilinearform.SparseGridQuadratureStrategy.SparseGridQuadratureStrategy.computeBilinearFormEntry(), python.uq.operations.discretization.computeCoefficients(), python.uq.operations.forcePositivity.setGridPointsToZero.SetGridPointsToZero.computeHierarchicalCoefficients(), python.uq.operations.forcePositivity.interpolateFunction.InterpolateFunction.computeHierarchicalCoefficients(), python.uq.operations.discretization.discretizeFunction(), python.uq.learner.Interpolant.Interpolant.doLearningIteration(), python.uq.operations.discretizeProduct.interpolateProduct(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.makeCurrentNodalValuesPositive(), python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.makeCurrentNodalValuesPositive(), and python.uq.operations.forcePositivity.makePositive().

hierarchizeBruteForce()

def python.uq.operations.sparse_grid.hierarchizeBruteForce	(		grid,
			nodalValues,
			ignore = None
	)

References python.uq.operations.sparse_grid.evalHierToTop(), python.uq.operations.sparse_grid.getBasis(), python.uq.operations.sparse_grid.getLevel(), and python.uq.operations.sparse_grid.hasBorder().

Referenced by python.uq.operations.sparse_grid.hierarchize().

hierarchizeEvalHierToTop()

def python.uq.operations.sparse_grid.hierarchizeEvalHierToTop	(		grid,
			nodalValues
	)

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

insertHierarchicalAncestors()

def python.uq.operations.sparse_grid.insertHierarchicalAncestors	(		grid,
			gp
	)

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

Referenced by python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.addFullGridPoints(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.addFullGridPoints(), and python.uq.operations.forcePositivity.makePositive().

insertPoint()

def python.uq.operations.sparse_grid.insertPoint	(		grid,
			gp
	)

insert a grid point to the storage if it is valid. Returns the
sequence number of the new grid point in the storage

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

Referenced by python.uq.operations.forcePositivity.operationMakePositiveFast.OperationMakePositiveFast.addFullGridPoints(), python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.addFullGridPoints(), python.uq.operations.sparse_grid.balance(), python.uq.operations.general.extend_grid_1d(), python.uq.operations.sparse_grid.insertHierarchicalAncestors(), python.uq.operations.sparse_grid.insertTruncatedBorder(), python.uq.operations.forcePositivity.makePositive(), and python.uq.refinement.LocalRefinementStrategy.CreateAllChildrenRefinement.refine().

insertTruncatedBorder()

def python.uq.operations.sparse_grid.insertTruncatedBorder	(		grid,
			gp
	)

insert points on the border recursively for grids with border
@param grid: Grid
@param gp: HashGridPoint
@return: list of HashGridPoint, contains all the newly added grid points

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

Referenced by python.uq.operations.forcePositivity.operationMakePositive.OperationMakePositive.addFullGridPoints(), python.uq.learner.builder.GridDescriptor.GridDescriptor.createGrid(), and python.uq.refinement.LocalRefinementStrategy.CreateAllChildrenRefinement.refine().

isHierarchicalAncestor()

def python.uq.operations.sparse_grid.isHierarchicalAncestor	(		gpi,
			gpj
	)

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

Referenced by python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates.findIntersectionsOfOverlappingSuppportsForOneGridPoint().

isHierarchicalAncestorByLevelIndex()

def python.uq.operations.sparse_grid.isHierarchicalAncestorByLevelIndex	(		location_i,
			location_j
	)

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

Referenced by python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.contains().

isHierarchicalAncestorDimx()

def python.uq.operations.sparse_grid.isHierarchicalAncestorDimx	(		li,
			ii,
			lj,
			ij
	)

Referenced by python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid.containsDimx(), python.uq.operations.sparse_grid.haveOverlappingSupportDimx(), python.uq.operations.sparse_grid.isHierarchicalAncestor(), and python.uq.operations.sparse_grid.isHierarchicalAncestorByLevelIndex().

isRefineable()

def python.uq.operations.sparse_grid.isRefineable	(		grid,
			gp
	)

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

Referenced by python.uq.refinement.AdmissibleSet.RefinableNodesSet.create(), python.uq.operations.discretizeProduct.refine(), python.uq.refinement.AdmissibleSet.RefinableNodesSet.update(), and sgpp::datadriven::DBMatOnline.updateSystemMatrixDecomposition().

isValid()

def python.uq.operations.sparse_grid.isValid	(		grid,
			gp
	)

References python.uq.operations.sparse_grid.hasBorder(), and python.uq.operations.sparse_grid.isValid1d().

Referenced by python.uq.refinement.AdmissibleSet.AdmissibleSparseGridNodeSet.addChildren(), sgpp::combigrid::LevelManager.addLevelToCombiEval(), python.uq.operations.sparse_grid.getHierarchicalAncestors(), python.uq.operations.sparse_grid.getNonExistingHierarchicalAncestors(), python.uq.operations.general.insert_children(), python.uq.operations.sparse_grid.insertPoint(), python.uq.operations.sparse_grid.isRefineable(), python.uq.refinement.LocalRefinementStrategy.CreateAllChildrenRefinement.refine(), and sgpp::datadriven::SortedDataset.setOrder().

isValid1d()

def python.uq.operations.sparse_grid.isValid1d	(		grid,
			level,
			index
	)

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

Referenced by python.uq.operations.sparse_grid.isValid(), and python.uq.operations.sparse_grid.parent().

loadOperationMultiEval()

def python.uq.operations.sparse_grid.loadOperationMultiEval	(		grid,
			samples,
			isConsistent = True
	)

parent()

def python.uq.operations.sparse_grid.parent	(		grid,
			gp,
			d
	)

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

Referenced by python.uq.operations.sparse_grid.evalHierToTop(), and python.uq.operations.sparse_grid.parents().

parents()

def python.uq.operations.sparse_grid.parents	(		grid,
			gp
	)

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

Referenced by python.uq.operations.sparse_grid.estimateConvergence(), python.uq.operations.sparse_grid.estimateSurplus(), python.uq.operations.sparse_grid.getHierarchicalAncestors(), python.uq.operations.sparse_grid.getNonExistingHierarchicalAncestors(), and python.uq.refinement.RefinementStrategy.WeightedSurplusBFRanking.update().

sub()

def python.uq.operations.sparse_grid.sub	(		alpha,
			alphas
	)

Referenced by python.learner.Regressor.Regressor.evalError(), and python.uq.learner.Regressor.Regressor.evalError().

Variable Documentation

bsplineBoundaryGridTypes

list python.uq.operations.sparse_grid.bsplineBoundaryGridTypes

Initial value:

=  [GridType_BsplineBoundary,
                            GridType_BsplineClenshawCurtis]

bsplineGridTypes

list python.uq.operations.sparse_grid.bsplineGridTypes = bsplineNoBoundaryGridTypes + bsplineBoundaryGridTypes

bsplineNoBoundaryGridTypes

list python.uq.operations.sparse_grid.bsplineNoBoundaryGridTypes

Initial value:

=  [GridType_Bspline,
                              GridType_ModBspline,
                              GridType_ModBsplineClenshawCurtis]

linearBoundaryGridTypes

list python.uq.operations.sparse_grid.linearBoundaryGridTypes

Initial value:

=  [GridType_LinearBoundary,
                           GridType_LinearL0Boundary,
                           GridType_LinearTruncatedBoundary,
                           GridType_LinearClenshawCurtisBoundary]

linearGridTypes

list python.uq.operations.sparse_grid.linearGridTypes = linearNoBoundaryGridTypes + linearBoundaryGridTypes

linearNoBoundaryGridTypes

list python.uq.operations.sparse_grid.linearNoBoundaryGridTypes

Initial value:

=  [GridType_Linear,
                             GridType_ModLinear,
                             GridType_LinearClenshawCurtis,
                             GridType_ModLinearClenshawCurtis]

multipleEvalNaiveGridTypes

list python.uq.operations.sparse_grid.multipleEvalNaiveGridTypes

Initial value:

=  [GridType_Bspline,
                              GridType_BsplineClenshawCurtis,
                              GridType_BsplineBoundary,
                              GridType_ModBsplineClenshawCurtis,
                              GridType_ModBspline,
                              GridType_LinearClenshawCurtis,
                              GridType_LinearClenshawCurtisBoundary,
                              GridType_ModLinearClenshawCurtis,
                              GridType_PolyClenshawCurtis,
                              GridType_PolyClenshawCurtisBoundary,
                              GridType_ModPolyClenshawCurtis]

polyBoundaryGridTypes

list python.uq.operations.sparse_grid.polyBoundaryGridTypes

Initial value:

=  [GridType_PolyBoundary,
                         GridType_PolyClenshawCurtisBoundary]

polyGridTypes

list python.uq.operations.sparse_grid.polyGridTypes = polyNoBoundaryGridTypes + polyBoundaryGridTypes

polyNoBoundaryGridTypes

list python.uq.operations.sparse_grid.polyNoBoundaryGridTypes

Initial value:

=  [GridType_Poly,
                           GridType_ModPoly,
                           GridType_PolyClenshawCurtis,
                           GridType_ModPolyClenshawCurtis]