30 const unsigned int side = (
index > regularity) ? 1 : 0;
36 static_cast<int>(regularity + 2);
38 std::vector<double>
poly_coeffs(2 * regularity + 2, 0.0);
52 for (
int k = 0;
k <
j + 1; ++
k)
82 binomial *= -
static_cast<int>(regularity + 1 - i);
100 const unsigned int index)
102 , degree(2 * regularity + 1)
103 , regularity(regularity)
104 , side_index(index % (regularity + 1))
105 , side((index >= regularity + 1) ? 1 : 0)
112 std::vector<Polynomial<double>>
115 std::vector<Polynomial<double>> polys;
119 for (
unsigned int i = 0; i <
sz; ++i)
static std::vector< Polynomial< double > > generate_complete_basis(const unsigned int regularity)
PolynomialsHermite(const unsigned int regularity, const unsigned int index)
#define DEAL_II_NAMESPACE_OPEN
#define DEAL_II_NAMESPACE_CLOSE
#define AssertIndexRange(index, range)
constexpr T pow(const T base, const int iexp)