Modified polynomial base functions.
More...
#include <PolyModifiedBasis.hpp>
|
double | eval (LT level, IT index, double p) override |
| Evaluate the basis function with given level and index. More...
|
|
double | eval (LT level, IT index, double p, double offset, double width) |
|
double | evalDx (LT level, IT index, double x) |
|
double | evalHierToTop (LT level, IT index, DataVector &coeffs, double pos) |
| Evaluates all the hierarchical ancestors of the node defined by level and index. More...
|
|
size_t | getDegree () const override |
| Returns the polynomial degree of the basis. More...
|
|
double | getIntegral (LT level, IT index) override |
| returns the integal of the current basis function More...
|
|
| PolyModifiedBasis (size_t degree) |
| Constructor. More...
|
|
| ~PolyModifiedBasis () override |
| Destructor. More...
|
|
virtual | ~Basis () |
| Destructor. More...
|
|
template<class LT, class IT>
class sgpp::base::PolyModifiedBasis< LT, IT >
Modified polynomial base functions.
Special polynomial functions to cover values unequal 0 at the border. Implemented as seen in AWR 2 paper by Prof. Bungartz (http://www5.in.tum.de/wiki/index.php/Algorithmen_des_Wissenschaftlichen_Rechnens_II_-_Winter_08)
◆ PolyModifiedBasis()
template<class LT, class IT>
Constructor.
- Parameters
-
degree | the polynom's max. degree |
◆ ~PolyModifiedBasis()
template<class LT, class IT>
◆ eval() [1/2]
template<class LT, class IT>
◆ eval() [2/2]
template<class LT, class IT>
◆ evalDx()
template<class LT, class IT>
◆ evalHierToTop()
template<class LT, class IT>
◆ getDegree()
template<class LT, class IT>
◆ getIntegral()
template<class LT, class IT>
◆ polyBasis
template<class LT, class IT>
The documentation for this class was generated from the following file: