#include <AnalyticModels.hpp>
 | 
| std::vector< double >  | bounds {3.87672392696e-13, 2.57949758311e-12} | 
|   | 
| double  | logmean = std::log(1e-12) | 
|   | 
| double  | mean = 0.894066628227 | 
|   | 
| size_t  | numDims = 1 | 
|   | 
| double  | stddev = std::exp(-1) | 
|   | 
| double  | tolerance = 1e-12 | 
|   | 
| double  | variance = 0.0102415510639 | 
|   | 
◆ eval()
◆ bounds
      
        
          | std::vector<double> sgpp::combigrid::CO2::bounds {3.87672392696e-13, 2.57949758311e-12} | 
        
      
 
Referenced by python.uq.dists.SGDEdist.SGDEdist::cov(), python.uq.dists.EstimatedDist.EstimatedDist::getBounds(), python.uq.dists.NatafDist.NatafDist::getBounds(), python.uq.dists.LibAGFDist.LibAGFDist::getBounds(), python.uq.dists.SGDEdist.SGDEdist::getJointTransformation(), python.uq.dists.SGDEdist.SGDEdist::marginalize(), python.uq.dists.NatafDist.NatafDist::marginalizeToDimX(), python.uq.dists.SGDEdist.SGDEdist::marginalizeToDimX(), python.uq.dists.KDEDist.KDEDist::toJson(), python.uq.dists.NatafDist.NatafDist::toJson(), and python.uq.dists.SGDEdist.SGDEdist::toJson().
 
 
◆ logmean
      
        
          | double sgpp::combigrid::CO2::logmean = std::log(1e-12) | 
        
      
 
 
◆ mean
      
        
          | double sgpp::combigrid::CO2::mean = 0.894066628227 | 
        
      
 
 
◆ numDims
      
        
          | size_t sgpp::combigrid::CO2::numDims = 1 | 
        
      
 
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().
 
 
◆ stddev
      
        
          | double sgpp::combigrid::CO2::stddev = std::exp(-1) | 
        
      
 
 
◆ tolerance
      
        
          | double sgpp::combigrid::CO2::tolerance = 1e-12 | 
        
      
 
 
◆ variance
      
        
          | double sgpp::combigrid::CO2::variance = 0.0102415510639 | 
        
      
 
 
The documentation for this struct was generated from the following file: