SG++-Doxygen-Documentation
sgpp::base::HierarchisationLinear Class Reference

Class that implements the hierarchisation on a linear sparse grid. More...

#include <HierarchisationLinear.hpp>

Inheritance diagram for sgpp::base::HierarchisationLinear:
sgpp::base::HierarchisationLinearBoundary

Public Member Functions

 HierarchisationLinear (GridStorage &storage)
 Constructor, must be bind to a grid. More...
 
virtual void operator() (DataVector &source, DataVector &result, grid_iterator &index, size_t dim)
 Implements operator() needed by the sweep class during the grid traversal. More...
 
virtual ~HierarchisationLinear ()
 Destructor. More...
 

Protected Types

typedef GridStorage::grid_iterator grid_iterator
 

Protected Member Functions

void rec (DataVector &source, DataVector &result, grid_iterator &index, size_t dim, double fl, double fr)
 Recursive hierarchisaton algorithm, this algorithms works in-place -> source should be equal to result. More...
 

Protected Attributes

GridStoragestorage
 the grid object More...
 

Detailed Description

Class that implements the hierarchisation on a linear sparse grid.

Therefore the ()operator has to be implement in order to use the sweep algorithm for the grid traversal

Member Typedef Documentation

◆ grid_iterator

Constructor & Destructor Documentation

◆ HierarchisationLinear()

sgpp::base::HierarchisationLinear::HierarchisationLinear ( GridStorage storage)
explicit

Constructor, must be bind to a grid.

Parameters
storagethe grid storage object of the the grid, on which the hierarchisation should be executed

◆ ~HierarchisationLinear()

sgpp::base::HierarchisationLinear::~HierarchisationLinear ( )
virtual

Destructor.

Member Function Documentation

◆ operator()()

void sgpp::base::HierarchisationLinear::operator() ( DataVector source,
DataVector result,
grid_iterator index,
size_t  dim 
)
virtual

Implements operator() needed by the sweep class during the grid traversal.

This function is applied to the whole grid.

Parameters
sourcethis DataVector holds the node base coefficients of the function that should be applied to the sparse grid
resultthis DataVector holds the linear base coefficients of the sparse grid's ansatz-functions
indexa iterator object of the grid
dimcurrent fixed dimension of the 'execution direction'

Reimplemented in sgpp::base::HierarchisationLinearBoundary.

References rec().

◆ rec()

void sgpp::base::HierarchisationLinear::rec ( DataVector source,
DataVector result,
grid_iterator index,
size_t  dim,
double  fl,
double  fr 
)
protected

Recursive hierarchisaton algorithm, this algorithms works in-place -> source should be equal to result.

Parameters
sourcethis DataVector holds the node base coefficients of the function that should be applied to the sparse grid
resultthis DataVector holds the linear base coefficients of the sparse grid's ansatz-functions
indexa iterator object of the grid
dimcurrent fixed dimension of the 'execution direction'
flleft value of the current region regarded in this step of the recursion
frright value of the current region regarded in this step of the recursion

References sgpp::base::HashGridIterator::hint(), sgpp::base::HashGridStorage::isInvalidSequenceNumber(), sgpp::base::HashGridIterator::leftChild(), sgpp::base::HashGridIterator::seq(), sgpp::base::HashGridIterator::stepRight(), storage, and sgpp::base::HashGridIterator::up().

Referenced by operator()(), and sgpp::base::HierarchisationLinearBoundary::operator()().

Member Data Documentation

◆ storage

GridStorage& sgpp::base::HierarchisationLinear::storage
protected

The documentation for this class was generated from the following files: