|
void | cliques (size_t level, size_t clique_size) override |
| Creates a sparse grid with fully connected cliques. More...
|
|
void | cliques (size_t level, size_t clique_size, double T) override |
| Creates a sparse grid with fully connected cliques. More...
|
|
void | coarsen (CoarseningFunctor &func, DataVector &alpha) override |
| Coarsens a grid according to the settings of the CoarseningFunctor func. More...
|
|
void | coarsenNFirstOnly (CoarseningFunctor &func, DataVector &alpha, size_t numFirstOnly) override |
| Coarsens a grid according to the settings of the CoarseningFunctor func. More...
|
|
void | full (size_t level) override |
| Creates a full grid for a certain level \( n \), i.e., \( V_n = \bigoplus_{|\vec{l}|_\infty *\leq n} W_{\vec{l}}\). More...
|
|
size_t | getNumberOfRefinablePoints () override |
| Returns the number of points on the grid that can be refined in the next iteration. More...
|
|
size_t | getNumberOfRefinablePointsToMaxLevel (size_t maxLevel) override |
| Returns the number of points on the grid that can be refined in the next iteration additionally a maximum level for refinement is taken into account. More...
|
|
size_t | getNumberOfRemovablePoints () override |
| Returns the number of points on the grid that can be removed in the next iteration. More...
|
|
| PeriodicGridGenerator (GridStorage &storage) |
| Constructor. More...
|
|
void | refine (RefinementFunctor &func, std::vector< size_t > *addedPoints=0) override |
| Refines a grid according to the settings of the RefinementFunctor func. More...
|
|
void | refineMaxLevel (RefinementFunctor &func, size_t maxLevel) override |
| Refines a grid according to the settings of the RefinementFunctor func. More...
|
|
void | regular (size_t level) override |
| Creates a regular sparse grid for a certain level \( n \), i.e., \( V_n^{(1)} = *\bigoplus_{|\vec{l}|_1 \leq n+d-1} W_{\vec{l}}\). More...
|
|
void | regular (size_t level, double T) override |
| Creates a regular sparse grid for a certain level \( n \), i.e., \( V_n^{(1)} = *\bigoplus_{|\vec{l}|_1 \leq n+d-1} W_{\vec{l}}\). More...
|
|
| ~PeriodicGridGenerator () override |
| Destructor. More...
|
|
| GridGenerator () |
| Constructor. More...
|
|
virtual void | refineInter (RefinementFunctor &func, const std::vector< std::vector< size_t >> &interactions) |
| Refines a grid according to the settings of the RefinementFunctor func. More...
|
|
virtual void | regularInter (size_t level, const std::vector< std::vector< size_t >> &terms, double T) |
| Creates a regular sparse grid for a certain level \( n \), i.e., \( V_n^{(1)} = *\bigoplus_{|\vec{l}|_1 \leq n+d-1} W_{\vec{l}}\). More...
|
|
virtual void | truncated (size_t level, size_t l_user) |
| Creates a grid which doesn't contain the fullgrids with li<l_user, for any li level_t. More...
|
|
virtual | ~GridGenerator () |
| Destructor. More...
|
|
GridGenerator for periodic grids with boundaries.
void sgpp::base::PeriodicGridGenerator::regular |
( |
size_t |
level, |
|
|
double |
T = 0 |
|
) |
| |
|
overridevirtual |
Creates a regular sparse grid for a certain level \( n \), i.e., \( V_n^{(1)} = *\bigoplus_{|\vec{l}|_1 \leq n+d-1} W_{\vec{l}}\).
If the used grid doesn't support the parameter t, t = 0 is used instead.
- Parameters
-
level | Grid level |
T | modifier for subgrid selection, T = 0 implies standard sparse grid. For further information see Griebel and Knapek's paper optimized tensor-product approximation spaces |
Reimplemented from sgpp::base::GridGenerator.
References sgpp::base::HashGenerator::regularWithPeriodicBoundaries(), and storage.