SG++DoxygenDocumentation

Class that implements the hierarchisation on a linear sparse grid. More...
#include <HierarchisationLinearStretched.hpp>
Public Member Functions  
HierarchisationLinearStretched (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  ~HierarchisationLinearStretched () 
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 hierarchisation algorithm, this algorithms works inplace > source should be equal to result. More...  
Protected Attributes  
GridStorage &  storage 
the grid object More...  
Stretching *  stretch 
the stretching object More...  
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

protected 

explicit 
Constructor, must be bind to a grid.
storage  the grid storage object of the the grid, on which the hierarchisation should be executed 

virtual 
Destructor.

virtual 
Implements operator() needed by the sweep class during the grid traversal.
This function is applied to the whole grid.
source  this DataVector holds the node base coefficients of the function that should be applied to the sparse grid 
result  this DataVector holds the linear base coefficients of the sparse grid's ansatzfunctions 
index  a iterator object of the grid 
dim  current fixed dimension of the 'execution direction' 
Reimplemented in sgpp::base::HierarchisationLinearStretchedBoundary.
References rec().

protected 
Recursive hierarchisation algorithm, this algorithms works inplace > source should be equal to result.
source  this DataVector holds the node base coefficients of the function that should be applied to the sparse grid 
result  this DataVector holds the linear base coefficients of the sparse grid's ansatzfunctions 
index  a iterator object of the grid 
dim  current fixed dimension of the 'execution direction' 
fl  left value of the current region regarded in this step of the recursion 
fr  right value of the current region regarded in this step of the recursion 
References sgpp::base::HashGridIterator::get(), sgpp::base::Stretching::getAdjacentPositions(), sgpp::base::HashGridIterator::hint(), sgpp::base::HashGridStorage::isInvalidSequenceNumber(), sgpp::base::HashGridIterator::leftChild(), sgpp::base::HashGridIterator::seq(), sgpp::base::HashGridIterator::stepRight(), storage, stretch, and sgpp::base::HashGridIterator::up().
Referenced by operator()(), and sgpp::base::HierarchisationLinearStretchedBoundary::operator()().

protected 
the grid object
Referenced by sgpp::base::HierarchisationLinearStretchedBoundary::operator()(), and rec().

protected 
the stretching object
Referenced by rec().