exact_solution.hpp

/******************************************************************************
 * Copyright (C) Siarhei Uzunbajakau, 2023.
 *
 * This program is free software. You can use, modify, and redistribute it under
 * the terms of the GNU Lesser General Public License as published by the Free
 * Software Foundation, either version 3 or (at your option) any later version.
 * This program is distributed without any warranty.
 *
 * Refer to COPYING.LESSER for more details.
 ******************************************************************************/
 
#ifndef ExactSolutionsSLDII_H__
#define ExactSolutionsSLDII_H__
 
#include <deal.II/base/function.h>
#include <deal.II/base/point.h>
#include <deal.II/base/tensor.h>
 
#include <deal.II/lac/vector.h>
 
#include <cmath>
 
#include "constants.hpp"
#include "settings.hpp"
 
using namespace dealii;
 
template<int dim>
class ExactSolutionSLDII_THETA
  : public Function<dim>
  , public SettingsSLDII
{
public:
  ExactSolutionSLDII_THETA();
 
  virtual double value(const Point<dim>& r,
                       const unsigned int component = 0) const override final;
 
  virtual Tensor<1, dim> gradient(
    const Point<dim>& r,
    const unsigned int component = 0) const override final;
 
private:
  double OMEGA, alpha_1, beta_1, gamma_1, delta_1;
};
 
template<int dim>
class ExactSolutionSLDII_H
  : public Function<dim>
  , public SettingsSLDII
{
public:
  ExactSolutionSLDII_H()
    : Function<dim>(dim)
  {
  }
 
  virtual void vector_value_list(
    const std::vector<Point<dim>>& r,
    std::vector<Vector<double>>& values) const final;
 
private:
  ExactSolutionSLDII_THETA<dim> theta;
};
 
template<int dim>
void
ExactSolutionSLDII_H<dim>::vector_value_list(
  const std::vector<Point<dim>>& r,
  std::vector<Vector<double>>& values) const
{
  Assert(values.size() == r.size(),
         ExcDimensionMismatch(values.size(), r.size()));
 
  Tensor<1, dim> grad;
 
  for (unsigned int i = 0; i < r.size(); i++) {
    grad = theta.gradient(r[i]);
 
    for (unsigned int j = 0; j < dim; j++)
      values[i][j] = -grad[j];
  }
}
 
#endif