PointOrdering class with the slowest possible growth (n = (l == 1) ? 1 : 2^l + 1) to make Clenshaw-Curtis-points / uniform points with boundary nested.
More...
#include <ExponentialLevelorderPointOrdering.hpp>
PointOrdering class with the slowest possible growth (n = (l == 1) ? 1 : 2^l + 1) to make Clenshaw-Curtis-points / uniform points with boundary nested.
◆ ~ExponentialLevelorderPointOrdering()
sgpp::combigrid::ExponentialLevelorderPointOrdering::~ExponentialLevelorderPointOrdering |
( |
| ) |
|
|
virtual |
◆ convertIndex()
size_t sgpp::combigrid::ExponentialLevelorderPointOrdering::convertIndex |
( |
size_t |
level, |
|
|
size_t |
numPoints, |
|
|
size_t |
index |
|
) |
| |
|
virtual |
Converts a level-independent index into a corresponding level-dependent index in for the PointDistribution.
- Parameters
-
level | The level where the index is considered |
numPoints | The number of points at the level |
index | The index of the concrete point in the level |
Implements sgpp::combigrid::AbstractPointOrdering.
◆ getSortedPermutationIterator()
std::shared_ptr< AbstractPermutationIterator > sgpp::combigrid::ExponentialLevelorderPointOrdering::getSortedPermutationIterator |
( |
size_t |
level, |
|
|
std::vector< double > const & |
points, |
|
|
size_t |
numPoints |
|
) |
| |
|
virtual |
Returns a permutation iterator which first returns the level-independent index of the leftmost point, then the level-independent index of the second-leftmost point, etc.
Implements sgpp::combigrid::AbstractPointOrdering.
◆ numPoints()
size_t sgpp::combigrid::ExponentialLevelorderPointOrdering::numPoints |
( |
size_t |
level | ) |
|
|
virtual |
The documentation for this class was generated from the following files: