1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218
|
// ------------------------------------------------------------------------
//
// SPDX-License-Identifier: LGPL-2.1-or-later
// Copyright (C) 2020 - 2024 by the deal.II authors
//
// This file is part of the deal.II library.
//
// Part of the source code is dual licensed under Apache-2.0 WITH
// LLVM-exception OR LGPL-2.1-or-later. Detailed license information
// governing the source code and code contributions can be found in
// LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II.
//
// ------------------------------------------------------------------------
#include <deal.II/base/polynomials_barycentric.h>
#include <deal.II/base/polynomials_wedge.h>
DEAL_II_NAMESPACE_OPEN
namespace
{
unsigned int
compute_n_polynomials_wedge(const unsigned int dim, const unsigned int degree)
{
if (dim == 3)
{
if (degree == 1)
return 6;
if (degree == 2)
return 18;
}
DEAL_II_NOT_IMPLEMENTED();
return 0;
}
} // namespace
template <int dim>
ScalarLagrangePolynomialWedge<dim>::ScalarLagrangePolynomialWedge(
const unsigned int degree)
: ScalarPolynomialsBase<dim>(degree, compute_n_polynomials_wedge(dim, degree))
, poly_tri(BarycentricPolynomials<2>::get_fe_p_basis(degree))
, poly_line(BarycentricPolynomials<1>::get_fe_p_basis(degree))
{}
template <int dim>
double
ScalarLagrangePolynomialWedge<dim>::compute_value(const unsigned int i,
const Point<dim> &p) const
{
const auto pair = this->degree() == 1 ? internal::wedge_table_1[i] :
internal::wedge_table_2[i];
const Point<2> p_tri(p[0], p[1]);
const auto v_tri = poly_tri.compute_value(pair[0], p_tri);
const Point<1> p_line(p[2]);
const auto v_line = poly_line.compute_value(pair[1], p_line);
return v_tri * v_line;
}
template <int dim>
Tensor<1, dim>
ScalarLagrangePolynomialWedge<dim>::compute_grad(const unsigned int i,
const Point<dim> &p) const
{
const auto pair = this->degree() == 1 ? internal::wedge_table_1[i] :
internal::wedge_table_2[i];
const Point<2> p_tri(p[0], p[1]);
const auto v_tri = poly_tri.compute_value(pair[0], p_tri);
const auto g_tri = poly_tri.compute_grad(pair[0], p_tri);
const Point<1> p_line(p[2]);
const auto v_line = poly_line.compute_value(pair[1], p_line);
const auto g_line = poly_line.compute_grad(pair[1], p_line);
Tensor<1, dim> grad;
grad[0] = g_tri[0] * v_line;
grad[1] = g_tri[1] * v_line;
grad[2] = v_tri * g_line[0];
return grad;
}
template <int dim>
Tensor<2, dim>
ScalarLagrangePolynomialWedge<dim>::compute_grad_grad(const unsigned int i,
const Point<dim> &p) const
{
(void)i;
(void)p;
DEAL_II_NOT_IMPLEMENTED();
return Tensor<2, dim>();
}
template <int dim>
void
ScalarLagrangePolynomialWedge<dim>::evaluate(
const Point<dim> &unit_point,
std::vector<double> &values,
std::vector<Tensor<1, dim>> &grads,
std::vector<Tensor<2, dim>> &grad_grads,
std::vector<Tensor<3, dim>> &third_derivatives,
std::vector<Tensor<4, dim>> &fourth_derivatives) const
{
(void)grads;
(void)grad_grads;
(void)third_derivatives;
(void)fourth_derivatives;
if (values.size() == this->n())
for (unsigned int i = 0; i < this->n(); ++i)
values[i] = compute_value(i, unit_point);
if (grads.size() == this->n())
for (unsigned int i = 0; i < this->n(); ++i)
grads[i] = compute_grad(i, unit_point);
}
template <int dim>
Tensor<1, dim>
ScalarLagrangePolynomialWedge<dim>::compute_1st_derivative(
const unsigned int i,
const Point<dim> &p) const
{
return compute_grad(i, p);
}
template <int dim>
Tensor<2, dim>
ScalarLagrangePolynomialWedge<dim>::compute_2nd_derivative(
const unsigned int i,
const Point<dim> &p) const
{
(void)i;
(void)p;
DEAL_II_NOT_IMPLEMENTED();
return {};
}
template <int dim>
Tensor<3, dim>
ScalarLagrangePolynomialWedge<dim>::compute_3rd_derivative(
const unsigned int i,
const Point<dim> &p) const
{
(void)i;
(void)p;
DEAL_II_NOT_IMPLEMENTED();
return {};
}
template <int dim>
Tensor<4, dim>
ScalarLagrangePolynomialWedge<dim>::compute_4th_derivative(
const unsigned int i,
const Point<dim> &p) const
{
(void)i;
(void)p;
DEAL_II_NOT_IMPLEMENTED();
return {};
}
template <int dim>
std::string
ScalarLagrangePolynomialWedge<dim>::name() const
{
return "ScalarLagrangePolynomialWedge";
}
template <int dim>
std::unique_ptr<ScalarPolynomialsBase<dim>>
ScalarLagrangePolynomialWedge<dim>::clone() const
{
return std::make_unique<ScalarLagrangePolynomialWedge<dim>>(*this);
}
template class ScalarLagrangePolynomialWedge<1>;
template class ScalarLagrangePolynomialWedge<2>;
template class ScalarLagrangePolynomialWedge<3>;
DEAL_II_NAMESPACE_CLOSE
|