hierarchicalsimplexp2withelementbubble.hh

Go to the documentation of this file.

// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_HIERARCHICAL_SIMPLEX_P2_WITH_ELEMENT_BUBBLE_LOCALBASIS_HH
#define DUNE_HIERARCHICAL_SIMPLEX_P2_WITH_ELEMENT_BUBBLE_LOCALBASIS_HH
 
#include <numeric>
#include <vector>
 
#include <dune/common/fvector.hh>
#include <dune/common/fmatrix.hh>
 
#include <dune/localfunctions/common/localbasis.hh>
#include <dune/localfunctions/common/localkey.hh>
 
namespace Dune
{
  template<class D, class R, int dim>
  class HierarchicalSimplexP2WithElementBubbleLocalBasis
  {
  public:
    HierarchicalSimplexP2WithElementBubbleLocalBasis()
    {
      DUNE_THROW(Dune::NotImplemented,"HierarchicalSimplexP2LocalBasis not implemented for dim > 3.");
    }
  };
 
  template<class D, class R>
  class HierarchicalSimplexP2WithElementBubbleLocalBasis<D,R,1>
  {
  public:
    typedef LocalBasisTraits<D,1,Dune::FieldVector<D,1>,R,1,Dune::FieldVector<R,1>,
        Dune::FieldMatrix<R,1,1> > Traits;
 
    unsigned int size () const
    {
      return 3;
    }
 
    inline void evaluateFunction (const typename Traits::DomainType& in,
                                  std::vector<typename Traits::RangeType>& out) const
    {
      out.resize(3);
 
      out[0] = 1-in[0];
      out[1] = in[0];
      out[2] = 1-4*(in[0]-0.5)*(in[0]-0.5);
    }
 
    inline void
    evaluateJacobian (const typename Traits::DomainType& in,         // position
                      std::vector<typename Traits::JacobianType>& out) const      // return value
    {
      out.resize(3);
 
      out[0][0][0] = -1;
      out[1][0][0] =  1;
      out[2][0][0] = 4-8*in[0];
    }
 
    void partial (const std::array<unsigned int, 1>& order,
                  const typename Traits::DomainType& in,         // position
                  std::vector<typename Traits::RangeType>& out) const      // return value
    {
      auto totalOrder = order[0];
      if (totalOrder == 0) {
        evaluateFunction(in, out);
      } else if (totalOrder == 1) {
        out.resize(size());
        out[0] = -1;
        out[1] =  1;
        out[2] = 4-8*in[0];
      } else if (totalOrder == 2) {
        out.resize(size());
        out[0] = 0;
        out[1] = 0;
        out[2] =-8;
      } else {
        out.resize(size());
        out[0] = out[1] = out[2] = 0;
      }
    }
 
    unsigned int order () const
    {
      return 2;
    }
 
  };
 
  template<class D, class R>
  class HierarchicalSimplexP2WithElementBubbleLocalBasis<D,R,2>
  {
  public:
    typedef LocalBasisTraits<D,2,Dune::FieldVector<D,2>,R,1,Dune::FieldVector<R,1>,
        Dune::FieldMatrix<R,1,2> > Traits;
 
    unsigned int size () const
    {
      return 7;
    }
 
    inline void evaluateFunction (const typename Traits::DomainType& in,
                                  std::vector<typename Traits::RangeType>& out) const
    {
      out.resize(7);
 
      out[0] = 1 - in[0] - in[1];
      out[1] = 4*in[0]*(1-in[0]-in[1]);
      out[2] = in[0];
      out[3] = 4*in[1]*(1-in[0]-in[1]);
      out[4] = 4*in[0]*in[1];
      out[5] = in[1];
      out[6] = 27*in[0]*in[1]*(1-in[0]-in[1]);
 
    }
 
    inline void
    evaluateJacobian (const typename Traits::DomainType& in,         // position
                      std::vector<typename Traits::JacobianType>& out) const      // return value
    {
      out.resize(7);
 
      out[0][0][0] = -1;                    out[0][0][1] = -1;
      out[1][0][0] =  4-8*in[0]-4*in[1];    out[1][0][1] = -4*in[0];
      out[2][0][0] =  1;                    out[2][0][1] =  0;
      out[3][0][0] = -4*in[1];              out[3][0][1] =  4-4*in[0]-8*in[1];
      out[4][0][0] =  4*in[1];              out[4][0][1] =  4*in[0];
      out[5][0][0] =  0;                    out[5][0][1] =  1;
 
      // Cubic bubble
      out[6][0][0] = 27 * in[1] * (1 - 2*in[0] - in[1]);
      out[6][0][1] = 27 * in[0] * (1 - 2*in[1] - in[0]);
 
    }
 
    void partial (const std::array<unsigned int, 2>& order,
                  const typename Traits::DomainType& in,         // position
                  std::vector<typename Traits::RangeType>& out) const      // return value
    {
      auto totalOrder = std::accumulate(order.begin(), order.end(), 0);
      if (totalOrder == 0) {
        evaluateFunction(in, out);
      } else if (totalOrder == 1) {
        out.resize(size());
        auto const direction = std::distance(order.begin(), std::find(order.begin(), order.end(), 1));
 
        switch (direction) {
        case 0:
          out[0] = -1;
          out[1] =  4-8*in[0]-4*in[1];
          out[2] =  1;
          out[3] = -4*in[1];
          out[4] =  4*in[1];
          out[5] =  0;
          out[6] = 27 * in[1] * (1 - 2*in[0] - in[1]);
          break;
        case 1:
          out[0] = -1;
          out[1] = -4*in[0];
          out[2] =  0;
          out[3] =  4-4*in[0]-8*in[1];
          out[4] =  4*in[0];
          out[5] =  1;
          out[6] = 27 * in[0] * (1 - 2*in[1] - in[0]);
          break;
        default:
          DUNE_THROW(RangeError, "Component out of range.");
        }
      } else {
        DUNE_THROW(NotImplemented, "Desired derivative order is not implemented");
      }
    }
 
    unsigned int order () const
    {
      return 3;
    }
 
  };
 
  template<class D, class R>
  class HierarchicalSimplexP2WithElementBubbleLocalBasis<D,R,3>
  {
  public:
    typedef LocalBasisTraits<D,3,Dune::FieldVector<D,3>,R,1,Dune::FieldVector<R,1>,
        Dune::FieldMatrix<R,1,3> > Traits;
 
    unsigned int size () const
    {
      return 11;
    }
 
    void evaluateFunction (const typename Traits::DomainType& in,
                           std::vector<typename Traits::RangeType>& out) const
    {
      out.resize(10);
 
      out[0] = 1 - in[0] - in[1] - in[2];
      out[1] = 4 * in[0] * (1 - in[0] - in[1] - in[2]);
      out[2] = in[0];
      out[3] = 4 * in[1] * (1 - in[0] - in[1] - in[2]);
      out[4] = 4 * in[0] * in[1];
      out[5] = in[1];
      out[6] = 4 * in[2] * (1 - in[0] - in[1] - in[2]);
      out[7] = 4 * in[0] * in[2];
      out[8] = 4 * in[1] * in[2];
      out[9] = in[2];
 
      // quartic element bubble
      out[10] = 81*in[0]*in[1]*in[2]*(1-in[0]-in[1]-in[2]);
    }
 
    void evaluateJacobian (const typename Traits::DomainType& in,         // position
                           std::vector<typename Traits::JacobianType>& out) const      // return value
    {
      out.resize(10);
 
      out[0][0][0] = -1;                           out[0][0][1] = -1;                            out[0][0][2] = -1;
      out[1][0][0] =  4-8*in[0]-4*in[1]-4*in[2];   out[1][0][1] = -4*in[0];                      out[1][0][2] = -4*in[0];
      out[2][0][0] =  1;                           out[2][0][1] =  0;                            out[2][0][2] =  0;
      out[3][0][0] = -4*in[1];                     out[3][0][1] =  4-4*in[0]-8*in[1]-4*in[2];    out[3][0][2] = -4*in[1];
      out[4][0][0] =  4*in[1];                     out[4][0][1] =  4*in[0];                      out[4][0][2] =  0;
      out[5][0][0] =  0;                           out[5][0][1] =  1;                            out[5][0][2] =  0;
      out[6][0][0] = -4*in[2];                     out[6][0][1] = -4*in[2];                      out[6][0][2] =  4-4*in[0]-4*in[1]-8*in[2];
      out[7][0][0] =  4*in[2];                     out[7][0][1] =  0;                            out[7][0][2] =  4*in[0];
      out[8][0][0] =  0;                           out[8][0][1] =  4*in[2];                      out[8][0][2] =  4*in[1];
      out[9][0][0] =  0;                           out[9][0][1] =  0;                            out[9][0][2] =  1;
 
      out[10][0][0] = 81 * in[1] * in[2] * (1 - 2*in[0] -   in[1] -   in[2]);
      out[10][0][1] = 81 * in[0] * in[2] * (1 -   in[0] - 2*in[1] -   in[2]);
      out[10][0][2] = 81 * in[0] * in[1] * (1 -   in[0] -   in[1] - 2*in[2]);
    }
 
    void partial (const std::array<unsigned int, 3>& order,
                  const typename Traits::DomainType& in,         // position
                  std::vector<typename Traits::RangeType>& out) const      // return value
    {
      auto totalOrder = std::accumulate(order.begin(), order.end(), 0);
      if (totalOrder == 0) {
        evaluateFunction(in, out);
      } else if (totalOrder == 1) {
        out.resize(size());
        auto const direction = std::distance(order.begin(), std::find(order.begin(), order.end(), 1));
 
        switch (direction) {
        case 0:
          out[0] = -1;
          out[1] =  4-8*in[0]-4*in[1]-4*in[2];
          out[2] =  1;
          out[3] = -4*in[1];
          out[4] =  4*in[1];
          out[5] =  0;
          out[6] = -4*in[2];
          out[7] =  4*in[2];
          out[8] =  0;
          out[9] =  0;
          out[10] = 81 * in[1] * in[2] * (1 - 2*in[0] -   in[1] -   in[2]);
          break;
        case 1:
          out[0] = -1;
          out[1] = -4*in[0];
          out[2] =  0;
          out[3] =  4-4*in[0]-8*in[1]-4*in[2];
          out[4] =  4*in[0];
          out[5] =  1;
          out[6] = -4*in[2];
          out[7] =  0;
          out[8] =  4*in[2];
          out[9] =  0;
          out[10] = 81 * in[0] * in[2] * (1 -   in[0] - 2*in[1] -   in[2]);
          break;
        case 2:
          out[0] = -1;
          out[1] = -4*in[0];
          out[2] =  0;
          out[3] = -4*in[1];
          out[4] =  0;
          out[5] =  0;
          out[6] =  4-4*in[0]-4*in[1]-8*in[2];
          out[7] =  4*in[0];
          out[8] =  4*in[1];
          out[9] =  1;
          out[10] = 81 * in[0] * in[1] * (1 -   in[0] -   in[1] - 2*in[2]);
          break;
        default:
          DUNE_THROW(RangeError, "Component out of range.");
        }
      } else {
        DUNE_THROW(NotImplemented, "Desired derivative order is not implemented");
      }
    }
 
    unsigned int order () const
    {
      return 4;
    }
 
  };
 
 
  template <int dim>
  class HierarchicalSimplexP2WithElementBubbleLocalCoefficients
  {
    // The binomial coefficient: dim+1 over 1
    static const int numVertices = dim+1;
 
    // The binomial coefficient: dim+1 over 2
    static const int numEdges    = (dim+1)*dim / 2;
 
  public:
    HierarchicalSimplexP2WithElementBubbleLocalCoefficients ()
      : li(numVertices+numEdges + 1)
    {
      if (dim!=2)
        DUNE_THROW(NotImplemented, "only for 2d");
 
      li[0] = Dune::LocalKey(0,2,0);    // Vertex (0,0)
      li[1] = Dune::LocalKey(0,1,0);    // Edge   (0.5, 0)
      li[2] = Dune::LocalKey(1,2,0);    // Vertex (1,0)
      li[3] = Dune::LocalKey(1,1,0);    // Edge   (0, 0.5)
      li[4] = Dune::LocalKey(2,1,0);    // Edge   (0.5, 0.5)
      li[5] = Dune::LocalKey(2,2,0);    // Vertex (0,1)
      li[6] = Dune::LocalKey(0,0,0);    // Element (1/3, 1/3)
    }
 
    size_t size () const
    {
      return numVertices+numEdges + 1;
    }
 
    const Dune::LocalKey& localKey (size_t i) const
    {
      return li[i];
    }
 
  private:
    std::vector<Dune::LocalKey> li;
  };
 
  template<class LB>
  class HierarchicalSimplexP2WithElementBubbleLocalInterpolation
  {
  public:
 
    template<typename F, typename C>
    void interpolate (const F& f, std::vector<C>& out) const
    {
      typename LB::Traits::DomainType x;
      typename LB::Traits::RangeType y;
 
      out.resize(7);
 
      // vertices
      x[0] = 0.0; x[1] = 0.0; f.evaluate(x,y); out[0] = y;
      x[0] = 1.0; x[1] = 0.0; f.evaluate(x,y); out[2] = y;
      x[0] = 0.0; x[1] = 1.0; f.evaluate(x,y); out[5] = y;
 
      // edge bubbles
      x[0] = 0.5; x[1] = 0.0; f.evaluate(x,y);
      out[1] = y - out[0]*(1-x[0]) - out[2]*x[0];
 
      x[0] = 0.0; x[1] = 0.5; f.evaluate(x,y);
      out[3] = y - out[0]*(1-x[1]) - out[5]*x[1];
 
      x[0] = 0.5; x[1] = 0.5; f.evaluate(x,y);
      out[4] = y - out[2]*x[0] - out[5]*x[1];
 
      // element bubble
      x[0] = 1.0/3; x[1] = 1.0/3; f.evaluate(x,y);
 
      HierarchicalSimplexP2WithElementBubbleLocalBasis<double,double,2> shapeFunctions;
      std::vector<typename LB::Traits::RangeType> sfValues;
      shapeFunctions.evaluateFunction(x, sfValues);
 
      out[6] = y;
      for (int i=0; i<6; i++)
        out[6] -= out[i]*sfValues[i];
 
    }
 
  };
 
 
}
#endif