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

#include <AnalyticModels.hpp>

Static Public Member Functions

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

Public Attributes

std::vector< double > bounds {0, 1}
 
double mean = 3.5
 
size_t numDims = 3
 
double pi_4 = M_PI * M_PI * M_PI * M_PI
 
std::vector< double > sobolIndices {0.3138, 0.4424, 0.0, 0.0, 0.2436, 0.0, 0.0}
 
double tolerance = 5e-4
 
std::vector< double > totalSobolIndices {0.5574, 0.4424, 0.2436}
 
double variance = a * a / 8. + b * pi_4 / 5 + b * b * pi_4 * pi_4 / 18. + 0.5
 

Static Public Attributes

static constexpr double a = 7.0
 
static constexpr double b = 0.1
 

Member Function Documentation

◆ eval()

Member Data Documentation

◆ a

constexpr double sgpp::combigrid::Ishigami::a = 7.0
static

◆ b

constexpr double sgpp::combigrid::Ishigami::b = 0.1
static

◆ bounds

◆ mean

◆ numDims

size_t sgpp::combigrid::Ishigami::numDims = 3

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(), sgpp::combigrid::Genz::eval(), 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().

◆ pi_4

double sgpp::combigrid::Ishigami::pi_4 = M_PI * M_PI * M_PI * M_PI

◆ sobolIndices

std::vector<double> sgpp::combigrid::Ishigami::sobolIndices {0.3138, 0.4424, 0.0, 0.0, 0.2436, 0.0, 0.0}

◆ tolerance

double sgpp::combigrid::Ishigami::tolerance = 5e-4

◆ totalSobolIndices

std::vector<double> sgpp::combigrid::Ishigami::totalSobolIndices {0.5574, 0.4424, 0.2436}

◆ variance

double sgpp::combigrid::Ishigami::variance = a * a / 8. + b * pi_4 / 5 + b * b * pi_4 * pi_4 / 18. + 0.5

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