polynomials_wedge.h

Go to the documentation of this file.

// ---------------------------------------------------------------------
//
// Copyright (C) 2021 - 2022 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE.md at
// the top level directory of deal.II.
//
// ---------------------------------------------------------------------
 
 
#ifndef dealii_base_polynomials_wedge_h
#define dealii_base_polynomials_wedge_h
 
#include <deal.II/base/config.h>
 
#include <deal.II/base/ndarray.h>
#include <deal.II/base/polynomials_barycentric.h>
#include <deal.II/base/scalar_polynomials_base.h>
 
DEAL_II_NAMESPACE_OPEN
 
 
namespace internal
{
  static const constexpr ::ndarray<unsigned int, 6, 2> wedge_table_1{
    {{{0, 0}}, {{1, 0}}, {{2, 0}}, {{0, 1}}, {{1, 1}}, {{2, 1}}}};
 
  static const constexpr ::ndarray<unsigned int, 18, 2> wedge_table_2{
    {{{0, 0}},
     {{1, 0}},
     {{2, 0}},
     {{0, 1}},
     {{1, 1}},
     {{2, 1}},
     {{3, 0}},
     {{4, 0}},
     {{5, 0}},
     {{3, 1}},
     {{4, 1}},
     {{5, 1}},
     {{0, 2}},
     {{1, 2}},
     {{2, 2}},
     {{3, 2}},
     {{4, 2}},
     {{5, 2}}}};
} // namespace internal
 
 
template <int dim>
class ScalarLagrangePolynomialWedge : public ScalarPolynomialsBase<dim>
{
public:
  static constexpr unsigned int dimension = dim;
 
  /*
   * Constructor taking the polynomial @p degree as input.
   *
   * @note Currently, only linear (degree=1) and quadratic polynomials
   *   (degree=2) are implemented.
   */
  ScalarLagrangePolynomialWedge(const unsigned int degree);
 
  void
  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 override;
 
  double
  compute_value(const unsigned int i, const Point<dim> &p) const override;
 
  template <int order>
  Tensor<order, dim>
  compute_derivative(const unsigned int i, const Point<dim> &p) const;
 
  Tensor<1, dim>
  compute_1st_derivative(const unsigned int i,
                         const Point<dim> & p) const override;
 
  Tensor<2, dim>
  compute_2nd_derivative(const unsigned int i,
                         const Point<dim> & p) const override;
 
  Tensor<3, dim>
  compute_3rd_derivative(const unsigned int i,
                         const Point<dim> & p) const override;
 
  Tensor<4, dim>
  compute_4th_derivative(const unsigned int i,
                         const Point<dim> & p) const override;
 
  Tensor<1, dim>
  compute_grad(const unsigned int i, const Point<dim> &p) const override;
 
  Tensor<2, dim>
  compute_grad_grad(const unsigned int i, const Point<dim> &p) const override;
 
  std::string
  name() const override;
 
  virtual std::unique_ptr<ScalarPolynomialsBase<dim>>
  clone() const override;
 
private:
  const BarycentricPolynomials<2> poly_tri;
 
  const BarycentricPolynomials<1> poly_line;
};
 
 
 
template <int dim>
template <int order>
Tensor<order, dim>
ScalarLagrangePolynomialWedge<dim>::compute_derivative(
  const unsigned int i,
  const Point<dim> & p) const
{
  Tensor<order, dim> der;
 
  AssertDimension(order, 1);
  const auto grad = compute_grad(i, p);
 
  for (unsigned int i = 0; i < dim; ++i)
    der[i] = grad[i];
 
  return der;
}
 
DEAL_II_NAMESPACE_CLOSE
 
#endif