|
HArD::Core2D
Hybrid Arbitrary Degree::Core 2D - Library to implement 2D schemes with edge and cell polynomials as unknowns
|
#include <cassert>#include <cmath>#include <functional>#include <memory>#include <string>#include <vector>#include <mesh.hpp>#include <quadraturerule.hpp>#include <basis.hpp>#include <iostream>#include <parallel_for.hpp>

Go to the source code of this file.
Classes | |
| class | HArDCore2D::UVector |
| class | HArDCore2D::HybridCore |
Namespaces | |
| namespace | HArDCore2D |
Functions | |
| template<typename GeometricSupport > | |
| size_t const | HArDCore2D::DimPoly (int m) |
| template<> | |
| const size_t | HArDCore2D::DimPoly< Cell > (const int m) |
| Compute the size of the basis of 2-variate polynomials up to degree m. | |
| template<> | |
| const size_t | HArDCore2D::DimPoly< Edge > (const int m) |
| Compute the size of the basis of 1-variate polynomials up to degree m. | |