Tdarcy_elements.h

Go to the documentation of this file.

// LIC// ====================================================================
// LIC// This file forms part of oomph-lib, the object-oriented,
// LIC// multi-physics finite-element library, available
// LIC// at http://www.oomph-lib.org.
// LIC//
// LIC// Copyright (C) 2006-2022 Matthias Heil and Andrew Hazel
// LIC//
// LIC// This library is free software; you can redistribute it and/or
// LIC// modify it under the terms of the GNU Lesser General Public
// LIC// License as published by the Free Software Foundation; either
// LIC// version 2.1 of the License, or (at your option) any later version.
// LIC//
// LIC// This library is distributed in the hope that it will be useful,
// LIC// but WITHOUT ANY WARRANTY; without even the implied warranty of
// LIC// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// LIC// Lesser General Public License for more details.
// LIC//
// LIC// You should have received a copy of the GNU Lesser General Public
// LIC// License along with this library; if not, write to the Free Software
// LIC// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
// LIC// 02110-1301  USA.
// LIC//
// LIC// The authors may be contacted at oomph-lib@maths.man.ac.uk.
// LIC//
// LIC//====================================================================
#ifndef OOMPH_TRAVIART_THOMAS_DARCY_HEADER
#define OOMPH_TRAVIART_THOMAS_DARCY_HEADER
 
// Config header generated by autoconfig
#ifdef HAVE_CONFIG_H
#include <oomph-lib-config.h>
#endif
 
#include "darcy_elements.h"
#include "../generic/Telements.h"
 
namespace oomph
{
  //================================================================
  //================================================================
  template<unsigned ORDER>
  class TRaviartThomasDarcyElement : public TElement<2, 3>,
                                     public DarcyEquations<2>
  {
  private:
    static const unsigned Face_index_of_edge_flux[];
 
    static const unsigned Q_edge_conv[];
 
    static const double Flux_interpolation_point[];
 
    unsigned Q_internal_data_index;
 
    unsigned P_internal_data_index;
 
    std::vector<short> Sign_edge;
 
  public:
    TRaviartThomasDarcyElement();
 
    ~TRaviartThomasDarcyElement();
 
    unsigned required_nvalue(const unsigned& n) const
    {
      return Initial_Nvalue[n];
    }
 
    unsigned face_index_of_edge(const unsigned& j) const
    {
      return (j + 2) % 3;
    }
 
    void face_local_coordinate_of_flux_interpolation_point(
      const unsigned& edge, const unsigned& n, Vector<double>& s) const
    {
      // Get the location of the n-th flux interpolation point along
      // the edge in terms of the distance along the edge itself
      Vector<double> flux_interpolation_point =
        edge_flux_interpolation_point(edge, n);
 
      // Convert the edge number to the number of the mid-edge node along that
      // edge
      unsigned node_number = Q_edge_conv[edge];
 
      // The edge basis functions are defined in a clockwise manner, so we have
      // to effectively "flip" some coordinates
      switch (node_number)
      {
        case 3:
          s[0] = flux_interpolation_point[0];
          break;
        case 4:
          s[0] = 1.0 - flux_interpolation_point[0];
          break;
        case 5:
          s[0] = flux_interpolation_point[0];
          break;
      }
    }
 
    unsigned face_index_of_q_edge_basis_fct(const unsigned& j) const
    {
      return Face_index_of_edge_flux[j];
    }
 
    int q_edge_local_eqn(const unsigned& n) const
    {
      return this->nodal_local_eqn(q_edge_node_number(n), q_edge_index(n));
    }
 
    int q_internal_local_eqn(const unsigned& n) const
    {
      return internal_local_eqn(q_internal_index(), n);
    }
 
    Vector<Data*> q_edge_data_pt() const
    {
      // It's the mid-side nodes:
      Vector<Data*> data_pt(3);
      data_pt[0] = node_pt(3);
      data_pt[1] = node_pt(4);
      data_pt[2] = node_pt(5);
      return data_pt;
    }
 
    Data* q_internal_data_pt() const
    {
      return this->internal_data_pt(Q_internal_data_index);
    }
 
    unsigned q_internal_index() const
    {
      return Q_internal_data_index;
    }
 
    unsigned q_edge_index(const unsigned& n) const
    {
      return n % (ORDER + 1);
    }
 
    unsigned q_edge_node_number(const unsigned& n) const
    {
      return Q_edge_conv[n / (ORDER + 1)];
    }
 
    Node* edge_flux_node_pt(const unsigned& edge)
    {
      return node_pt(Q_edge_conv[edge]);
    }
 
    double q_edge(const unsigned& n) const
    {
      return nodal_value(q_edge_node_number(n), q_edge_index(n));
    }
 
    double q_internal(const unsigned& n) const
    {
      return this->internal_data_pt(q_internal_index())->value(n);
    }
 
    void set_q_edge(const unsigned& n, const double& value)
    {
      node_pt(q_edge_node_number(n))->set_value(q_edge_index(n), value);
    }
 
    void set_q_internal(const unsigned& n, const double& value)
    {
      this->internal_data_pt(q_internal_index())->set_value(n, value);
    }
 
    unsigned nq_basis_edge() const;
 
    unsigned nq_basis_internal() const;
 
    void get_q_basis_local(const Vector<double>& s, Shape& q_basis) const;
 
    void get_div_q_basis_local(const Vector<double>& s,
                               Shape& div_q_basis_ds) const;
 
    unsigned nedge_flux_interpolation_point() const;
 
    Vector<double> edge_flux_interpolation_point(const unsigned& edge,
                                                 const unsigned& n) const
    {
      Vector<double> coord(1);
      coord[0] = (1.0 - sign_edge(edge)) / 2.0 +
                 sign_edge(edge) * Flux_interpolation_point[n];
      return coord;
    }
 
 
    void edge_flux_interpolation_point_global(const unsigned& j,
                                              Vector<double>& x) const
    {
      unsigned n = j % nedge_flux_interpolation_point();
      unsigned edge = (j - n) / nedge_flux_interpolation_point();
      edge_flux_interpolation_point_global(edge, n, x);
    }
 
 
    void edge_flux_interpolation_point_global(const unsigned& edge,
                                              const unsigned& n,
                                              Vector<double>& x) const
    {
      // Get the location of the n-th flux interpolation point along
      // the edge in terms of the distance along the edge itself
      Vector<double> flux_interpolation_point =
        edge_flux_interpolation_point(edge, n);
 
      // Convert the edge number to the number of the mid-edge node along that
      // edge
      unsigned node_number = Q_edge_conv[edge];
 
      // Storage for the local coords of the flux_interpolation point
      Vector<double> s_flux_interpolation(2, 0.0);
 
      // The edge basis functions are defined in a clockwise manner, so we have
      // to effectively "flip" the coordinates along edges 0 and 1 to match this
      switch (node_number)
      {
        case 3:
          s_flux_interpolation[0] = 1.0 - flux_interpolation_point[0];
          s_flux_interpolation[1] = flux_interpolation_point[0];
          break;
        case 4:
          s_flux_interpolation[0] = 0.0;
          s_flux_interpolation[1] = 1.0 - flux_interpolation_point[0];
          break;
        case 5:
          s_flux_interpolation[0] = flux_interpolation_point[0];
          s_flux_interpolation[1] = 0.0;
          break;
      }
 
      // Calculate the global coordinates from the local ones
      interpolated_x(s_flux_interpolation, x);
    }
 
    void pin_q_internal_value(const unsigned& n)
    {
      this->internal_data_pt(q_internal_index())->pin(n);
    }
 
    int p_local_eqn(const unsigned& n) const;
 
    double p_value(const unsigned& n) const;
 
    unsigned np_basis() const;
 
    void get_p_basis(const Vector<double>& s, Shape& p_basis) const;
 
    void pin_p_value(const unsigned& n)
    {
      this->internal_data_pt(P_internal_data_index)->pin(n);
    }
 
    Data* p_data_pt() const
    {
      return this->internal_data_pt(P_internal_data_index);
    }
 
    void set_p_value(const unsigned& n, const double& value)
    {
      this->internal_data_pt(P_internal_data_index)->set_value(n, value);
    }
 
    // hierher explain please
    void scale_basis(Shape& basis) const
    {
      // Storage for the lengths of the edges of the element
      Vector<double> length(3, 0.0);
 
      // Temporary storage for the vertex positions
      double x0, y0, x1, y1;
 
      // loop over the edges of the element and calculate their lengths (in x-y
      // space)
      for (unsigned i = 0; i < 3; i++)
      {
        x0 = this->node_pt(i)->x(0);
        y0 = this->node_pt(i)->x(1);
        x1 = this->node_pt((i + 1) % 3)->x(0);
        y1 = this->node_pt((i + 1) % 3)->x(1);
 
        length[i] = std::sqrt(std::pow(y1 - y0, 2) + std::pow(x1 - x0, 2));
      }
 
      // lengths of the sides of the reference element (in the same order as the
      // basis functions)
      const double ref_length[3] = {std::sqrt(2.0), 1, 1};
 
      // get the number of basis functions associated with the edges
      unsigned n_q_basis_edge = nq_basis_edge();
 
      // rescale the edge basis functions to allow arbitrary edge mappings from
      // element to ref. element
      const unsigned n_index2 = basis.nindex2();
      for (unsigned i = 0; i < n_index2; i++)
      {
        for (unsigned l = 0; l < n_q_basis_edge; l++)
        {
          basis(l, i) *=
            (length[l / (ORDER + 1)] / ref_length[l / (ORDER + 1)]);
        }
      }
    }
 
    const short& sign_edge(const unsigned& n) const
    {
      return Sign_edge[n];
    }
 
    short& sign_edge(const unsigned& n)
    {
      return Sign_edge[n];
    }
 
    void output(std::ostream& outfile)
    {
      DarcyEquations<2>::output(outfile);
    }
 
    void output(std::ostream& outfile, const unsigned& Nplot)
    {
      DarcyEquations<2>::output(outfile, Nplot);
    }
 
    unsigned nvertex_node() const
    {
      return TElement<2, 3>::nvertex_node();
    }
 
    Node* vertex_node_pt(const unsigned& j) const
    {
      return TElement<2, 3>::vertex_node_pt(j);
    }
 
 
    unsigned nrecovery_order();
 
  protected:
    double shape_basis_test_local(const Vector<double>& s,
                                  Shape& psi,
                                  Shape& q_basis,
                                  Shape& q_test,
                                  Shape& p_basis,
                                  Shape& p_test,
                                  Shape& div_q_basis_ds,
                                  Shape& div_q_test_ds) const
    {
      const unsigned n_q_basis = this->nq_basis();
 
      Shape q_basis_local(n_q_basis, 2);
      this->get_q_basis_local(s, q_basis_local);
      this->get_p_basis(s, p_basis);
      this->get_div_q_basis_local(s, div_q_basis_ds);
 
      double J = this->transform_basis(s, q_basis_local, psi, q_basis);
 
      q_test = q_basis;
      p_test = p_basis;
      div_q_test_ds = div_q_basis_ds;
 
      return J;
    }
 
    double shape_basis_test_local_at_knot(const unsigned& ipt,
                                          Shape& psi,
                                          Shape& q_basis,
                                          Shape& q_test,
                                          Shape& p_basis,
                                          Shape& p_test,
                                          Shape& div_q_basis_ds,
                                          Shape& div_q_test_ds) const
    {
      Vector<double> s(2);
      for (unsigned i = 0; i < 2; i++)
      {
        s[i] = this->integral_pt()->knot(ipt, i);
      }
 
      return shape_basis_test_local(s,
                                    psi,
                                    q_basis,
                                    q_test,
                                    p_basis,
                                    p_test,
                                    div_q_basis_ds,
                                    div_q_test_ds);
    }
 
    static const unsigned Initial_Nvalue[];
  };
 
 
  //============================================================
  //============================================================
  template<>
  class FaceGeometry<TRaviartThomasDarcyElement<0>>
    : public virtual TElement<1, 3>
  {
  public:
    FaceGeometry() : TElement<1, 3>() {}
  };
 
 
  //============================================================
  //============================================================
  template<>
  class FaceGeometry<TRaviartThomasDarcyElement<1>>
    : public virtual TElement<1, 3>
  {
  public:
    FaceGeometry() : TElement<1, 3>() {}
  };
 
 
} // namespace oomph
 
#endif