femquadratures_inline.hh

Go to the documentation of this file.

#ifndef DUNE_FEM_FEMQUADRATURES_INLINE_HH
#define DUNE_FEM_FEMQUADRATURES_INLINE_HH
 
#include "femquadratures.hh"
 
namespace Dune
{
 
  namespace Fem
  {
 
#define SimplexPointsAdapter ParDGSimplexQuadrature::Quadrature
 
  // only if we use dune-fem quadratures
    template <class ct, int dim>
    SimplexQuadrature<ct, dim>::SimplexQuadrature(const GeometryType&, int order, size_t id) :
      QuadratureImp<ct, dim>(id),
      order_((order <= 0) ? 1 : order)
    {
      // make sure that we only use orders that are available
      assert( order_ <= SimplexMaxOrder :: maxOrder( dim ) );
 
      SimplexPointsAdapter<dim> points(order);
 
      order_ = points.order();
 
      for (int i = 0; i < points.numPoints(); ++i) {
        this->addQuadraturePoint(points.point(i), points.weight(i));
      }
    }
 
    template <class ct, int dim>
    template <class QuadPoints>
    CubeQuadratureBase<ct, dim>::CubeQuadratureBase(const GeometryType&, int order, size_t id, const QuadPoints& gp) :
      QuadratureImp<ct, dim>(id),
      order_((order <= 0) ? 1 : order)
    {
      assert( order_ <= QuadPoints::highestOrder );
 
      typedef FieldVector< ct, dim > CoordinateType;
 
      // point quadrature
      if constexpr ( dim == 0 )
      {
        typedef FieldVector< double, 0 > CoordinateType;
 
        order_ = 20;
 
        // fill in all the gauss points
        // compute coordinates and weight
        double weight = 1.0;
        CoordinateType local( 0 );
 
        // put in container
        this->addQuadraturePoint(local, weight);
      }
      else
      {
        // find the right Gauss Rule from given order
        int m = 0;
        for (int i = 0; i <= GaussPts::MAXP; i++) {
          if (gp.order(i)>=order_) {
            m = i;
            break;
          }
        }
 
        if (m==0) DUNE_THROW(NotImplemented, "order " << order_ << " not implemented");
        order_ = gp.order(m);
 
        // fill in all the gauss points
        int n = gp.power(m,dim);
        for (int i = 0; i < n; i++) {
          // compute multidimensional coordinates of Gauss point
          int x[dim];
          int z = i;
          for (int k=0; k<dim; ++k) {
            x[k] = z%m;
            z = z/m;
          }
 
          // compute coordinates and weight
          double weight = 1.0;
          CoordinateType local;
          for (int k = 0; k < dim; k++)
          {
            local[k] = gp.point(m,x[k]);
            weight *= gp.weight(m,x[k]);
          }
 
          // put in container
          this->addQuadraturePoint(local, weight);
        }
      }
    }
 
 
    template <class ct>
    PrismQuadrature<ct>::PrismQuadrature(const GeometryType&, int order, size_t id) :
      QuadratureImp<ct, 3>(id),
      order_((order <= 0) ? 1 : order)
    {
      SimplexPointsAdapter<2> simplexPoints(order);
      int simplexOrder = simplexPoints.order();
 
      const GaussPts gp;
 
      // find the right Gauss Rule from given order
      int m = 0;
      for (int i = 0; i <= GaussPts::MAXP; i++) {
        if (gp.order(i)>=order_) {
          m = i;
          break;
        }
      }
      if (m==0) DUNE_THROW(NotImplemented, "order not implemented");
 
      int gaussOrder = gp.order(m);
      int minOrder = ((simplexOrder < gaussOrder) ? simplexOrder : gaussOrder);
      order_ = minOrder;
 
      int numSimplexPoints = simplexPoints.numPoints();
      int numGaussPoints = gp.power(m,1);
 
      FieldVector<ct, 3> local;
      double weight, simplexWeight;
 
      for (int i = 0; i < numSimplexPoints; ++i) {
        local[0] = simplexPoints.point(i)[0];
        local[1] = simplexPoints.point(i)[1];
        simplexWeight = simplexPoints.weight(i);
        for (int j = 0; j < numGaussPoints; ++j) {
          local[2] = gp.point(m,j);
          weight = simplexWeight;
          weight *= gp.weight(m,j);
          this->addQuadraturePoint(local, weight);
        }
      }
    }
 
    template <class ct>
    PyramidQuadrature<ct>::PyramidQuadrature(const GeometryType&, int order, size_t id) :
      QuadratureImp<ct, 3>(id),
      order_((order <= 0) ? 1 : order)
    {
      const PyramidPoints points;
 
      int m = 0;
      for (int i = 0; i < PyramidPoints::numQuads; ++i) {
        if (points.order(i) >= order_) {
          m = i;
          break;
        }
      }
 
      if (m==0) DUNE_THROW(NotImplemented, "order not implemented");
      order_ = points.order(m);
 
      // fill in the points
      for (int i = 0; i < points.numPoints(m); ++i) {
        this->addQuadraturePoint(points.point(m, i), points.weight(m, i));
      }
    }
 
 
    template <class ct, int dim>
    PolyhedronQuadrature<ct, dim>::PolyhedronQuadrature(const GeometryType& geomType, int order, size_t id) :
      QuadratureImp<ct, dim>(id),
      geometryType_( geomType ),
      order_((order <= 0) ? 1 : order)
    {
    }
 
 
  } // namespace Fem
 
} // namespace Dune
 
#endif // #ifndef DUNE_FEM_FEMQUADRATURES_INLINE_HH