SG++-Doxygen-Documentation
sgpp::combigrid::Parabola Struct Reference

#include <AnalyticModels.hpp>

Static Public Member Functions

static double eval (sgpp::base::DataVector const &v)
 

Public Attributes

double alpha1 = 5.0
 
double alpha2 = 3.0
 
double beta1 = 4.0
 
double beta2 = 2.0
 
std::vector< double > bounds {0, 1}
 
double c1 = std::tgamma(alpha1 + beta1) / (std::tgamma(alpha1) * std::tgamma(beta1))
 
double c2 = std::tgamma(alpha2 + beta2) / (std::tgamma(alpha2) * std::tgamma(beta2))
 
double mean = c1 * c2 / 4725.0
 
size_t numDims = 2
 
double tolerance = 1e-13
 
double variance
 

Member Function Documentation

static double sgpp::combigrid::Parabola::eval ( sgpp::base::DataVector const &  v)
inlinestatic

Member Data Documentation

double sgpp::combigrid::Parabola::alpha1 = 5.0
double sgpp::combigrid::Parabola::alpha2 = 3.0
double sgpp::combigrid::Parabola::beta1 = 4.0
double sgpp::combigrid::Parabola::beta2 = 2.0
double sgpp::combigrid::Parabola::c1 = std::tgamma(alpha1 + beta1) / (std::tgamma(alpha1) * std::tgamma(beta1))
double sgpp::combigrid::Parabola::c2 = std::tgamma(alpha2 + beta2) / (std::tgamma(alpha2) * std::tgamma(beta2))
size_t sgpp::combigrid::Parabola::numDims = 2

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.LocalFullGrid::computeGlobalFullGrid(), 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.models.testEnvironments.ProbabilisticSpaceSGpp::normal(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates::splitFullGrids(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGridCandidates::splitLocalFullGrids(), python.uq.operations.forcePositivity.localFullGridSearch.LocalFullGrid::transformToReferenceGrid(), and python.uq.models.testEnvironments.ProbabilisticSpaceSGpp::uniform().

double sgpp::combigrid::Parabola::tolerance = 1e-13
double sgpp::combigrid::Parabola::variance
Initial value:
= c1 * c1 * c1 * c2 * c2 * c2 / 75014100000.0 -
2 * c1 * c1 * c2 * c2 / 22325625.0 + 4.0 * c1 * c2 / 24255.0

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