tensor_product_polynomials_const.cc

Go to the documentation of this file.

// ---------------------------------------------------------------------
//
// Copyright (C) 2012 - 2020 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.
//
// ---------------------------------------------------------------------
 
 
#include <deal.II/base/exceptions.h>
#include <deal.II/base/tensor_product_polynomials_const.h>
 
#include <memory>
 
DEAL_II_NAMESPACE_OPEN
 
 
 
/* ------------------- TensorProductPolynomialsConst -------------- */
 
 
 
template <int dim>
void
TensorProductPolynomialsConst<dim>::output_indices(std::ostream &out) const
{
  std::array<unsigned int, dim> ix;
  for (unsigned int i = 0; i < tensor_polys.n(); ++i)
    {
      tensor_polys.compute_index(i, ix);
      out << i << "\t";
      for (unsigned int d = 0; d < dim; ++d)
        out << ix[d] << " ";
      out << std::endl;
    }
}
 
 
 
template <int dim>
void
TensorProductPolynomialsConst<dim>::set_numbering(
  const std::vector<unsigned int> &renumber)
{
  Assert(renumber.size() == index_map.size(),
         ExcDimensionMismatch(renumber.size(), index_map.size()));
 
  index_map = renumber;
  for (unsigned int i = 0; i < index_map.size(); ++i)
    index_map_inverse[index_map[i]] = i;
 
  std::vector<unsigned int> renumber_base;
  for (unsigned int i = 0; i < tensor_polys.n(); ++i)
    renumber_base.push_back(renumber[i]);
 
  tensor_polys.set_numbering(renumber_base);
}
 
 
template <int dim>
double
TensorProductPolynomialsConst<dim>::compute_value(const unsigned int i,
                                                  const Point<dim> & p) const
{
  const unsigned int max_indices = tensor_polys.n();
  Assert(i <= max_indices, ExcInternalError());
 
  // treat the regular basis functions
  if (i < max_indices)
    return tensor_polys.compute_value(i, p);
  else
    // this is for the constant function
    return 1.;
}
 
 
 
template <>
double
TensorProductPolynomialsConst<0>::compute_value(const unsigned int,
                                                const Point<0> &) const
{
  Assert(false, ExcNotImplemented());
  return 0.;
}
 
 
template <int dim>
Tensor<1, dim>
TensorProductPolynomialsConst<dim>::compute_grad(const unsigned int i,
                                                 const Point<dim> & p) const
{
  const unsigned int max_indices = tensor_polys.n();
  Assert(i <= max_indices, ExcInternalError());
 
  // treat the regular basis functions
  if (i < max_indices)
    return tensor_polys.compute_grad(i, p);
  else
    // this is for the constant function
    return Tensor<1, dim>();
}
 
template <int dim>
Tensor<2, dim>
TensorProductPolynomialsConst<dim>::compute_grad_grad(const unsigned int i,
                                                      const Point<dim> &p) const
{
  const unsigned int max_indices = tensor_polys.n();
  Assert(i <= max_indices, ExcInternalError());
 
  // treat the regular basis functions
  if (i < max_indices)
    return tensor_polys.compute_grad_grad(i, p);
  else
    // this is for the constant function
    return Tensor<2, dim>();
}
 
template <int dim>
void
TensorProductPolynomialsConst<dim>::evaluate(
  const Point<dim> &           p,
  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
{
  Assert(values.size() == tensor_polys.n() + 1 || values.size() == 0,
         ExcDimensionMismatch2(values.size(), tensor_polys.n() + 1, 0));
  Assert(grads.size() == tensor_polys.n() + 1 || grads.size() == 0,
         ExcDimensionMismatch2(grads.size(), tensor_polys.n() + 1, 0));
  Assert(grad_grads.size() == tensor_polys.n() + 1 || grad_grads.size() == 0,
         ExcDimensionMismatch2(grad_grads.size(), tensor_polys.n() + 1, 0));
  Assert(third_derivatives.size() == tensor_polys.n() + 1 ||
           third_derivatives.size() == 0,
         ExcDimensionMismatch2(third_derivatives.size(),
                               tensor_polys.n() + 1,
                               0));
  Assert(fourth_derivatives.size() == tensor_polys.n() + 1 ||
           fourth_derivatives.size() == 0,
         ExcDimensionMismatch2(fourth_derivatives.size(),
                               tensor_polys.n() + 1,
                               0));
 
  // remove slot for const value, go into the base class compute method and
  // finally append the const value again
  bool do_values = false, do_grads = false, do_grad_grads = false;
  bool do_3rd_derivatives = false, do_4th_derivatives = false;
  if (values.empty() == false)
    {
      values.pop_back();
      do_values = true;
    }
  if (grads.empty() == false)
    {
      grads.pop_back();
      do_grads = true;
    }
  if (grad_grads.empty() == false)
    {
      grad_grads.pop_back();
      do_grad_grads = true;
    }
  if (third_derivatives.empty() == false)
    {
      third_derivatives.resize(tensor_polys.n());
      do_3rd_derivatives = true;
    }
  if (fourth_derivatives.empty() == false)
    {
      fourth_derivatives.resize(tensor_polys.n());
      do_4th_derivatives = true;
    }
 
  tensor_polys.evaluate(
    p, values, grads, grad_grads, third_derivatives, fourth_derivatives);
 
  // for dgq node: values =1, grads=0, grads_grads=0, third_derivatives=0,
  // fourth_derivatives=0
  if (do_values)
    values.push_back(1.);
  if (do_grads)
    grads.emplace_back();
  if (do_grad_grads)
    grad_grads.emplace_back();
  if (do_3rd_derivatives)
    third_derivatives.emplace_back();
  if (do_4th_derivatives)
    fourth_derivatives.emplace_back();
}
 
 
 
template <int dim>
std::unique_ptr<ScalarPolynomialsBase<dim>>
TensorProductPolynomialsConst<dim>::clone() const
{
  return std::make_unique<TensorProductPolynomialsConst<dim>>(*this);
}
 
 
/* ------------------- explicit instantiations -------------- */
template class TensorProductPolynomialsConst<1>;
template class TensorProductPolynomialsConst<2>;
template class TensorProductPolynomialsConst<3>;
 
DEAL_II_NAMESPACE_CLOSE