16 #ifndef dealii_quadrature_lib_h 17 #define dealii_quadrature_lib_h 20 #include <deal.II/base/config.h> 22 #include <deal.II/base/quadrature.h> 24 DEAL_II_NAMESPACE_OPEN
47 QGauss(
const unsigned int n);
183 QGaussLog(
const unsigned int n,
const bool revert =
false);
189 static std::vector<double>
195 static std::vector<double>
250 const double alpha = 1,
251 const bool factor_out_singular_weight =
false);
330 const bool factor_out_singular_weight =
false);
366 const unsigned int vertex_index,
367 const bool factor_out_singular_weight =
false);
646 compute_affine_transformation(
647 const std::array<
Point<dim>, dim + 1> &vertices)
const;
745 const double beta = 1.0);
754 QDuffy(
const unsigned int n,
const double beta);
839 const unsigned int index,
847 DEAL_II_NAMESPACE_CLOSE
QGaussLog(const unsigned int n, const bool revert=false)
QGaussOneOverR(const unsigned int n, const Point< dim > singularity, const bool factor_out_singular_weight=false)
QGaussChebyshev(const unsigned int n)
Generate a formula with n quadrature points.
static std::vector< double > get_quadrature_points(const unsigned int n)
QGauss(const unsigned int n)
static std::vector< double > get_quadrature_weights(const unsigned int n)
QGaussRadauChebyshev(const unsigned int n, EndPoint ep=QGaussRadauChebyshev::left)
Generate a formula with n quadrature points.
bool compare_weights(const unsigned int a, const unsigned int b) const
QGaussLobatto(const unsigned int n)
QTelles(const Quadrature< 1 > &base_quad, const Point< dim > &singularity)
QSorted(const Quadrature< dim > &quad)
QGaussLogR(const unsigned int n, const Point< dim > x0=Point< dim >(), const double alpha=1, const bool factor_out_singular_weight=false)
static unsigned int quad_size(const Point< dim > singularity, const unsigned int n)