17 #include <deal.II/base/polynomials_piecewise.h> 18 #include <deal.II/base/qprojector.h> 19 #include <deal.II/base/quadrature.h> 20 #include <deal.II/base/quadrature_lib.h> 21 #include <deal.II/base/std_cxx14/memory.h> 22 #include <deal.II/base/template_constraints.h> 23 #include <deal.II/base/tensor_product_polynomials.h> 24 #include <deal.II/base/tensor_product_polynomials_bubbles.h> 25 #include <deal.II/base/tensor_product_polynomials_const.h> 27 #include <deal.II/fe/fe_dgp.h> 28 #include <deal.II/fe/fe_dgq.h> 29 #include <deal.II/fe/fe_nothing.h> 30 #include <deal.II/fe/fe_q_base.h> 31 #include <deal.II/fe/fe_tools.h> 36 DEAL_II_NAMESPACE_OPEN
47 inline std::vector<unsigned int>
48 face_lexicographic_to_hierarchic_numbering(
const unsigned int degree)
50 std::vector<unsigned int> dpo(dim, 1U);
51 for (
unsigned int i = 1; i < dpo.size(); ++i)
52 dpo[i] = dpo[i - 1] * (degree - 1);
53 const ::FiniteElementData<dim - 1> face_data(dpo, 1, degree);
54 std::vector<unsigned int> face_renumber(face_data.dofs_per_cell);
62 inline std::vector<unsigned int>
63 face_lexicographic_to_hierarchic_numbering<1>(
const unsigned int)
65 return std::vector<unsigned int>();
75 zero_indices(
unsigned int (&indices)[dim])
77 for (
unsigned int d = 0;
d < dim; ++
d)
88 increment_indices(
unsigned int (&indices)[dim],
const unsigned int dofs1d)
91 for (
int d = 0;
d < dim - 1; ++
d)
92 if (indices[d] == dofs1d)
108 template <
class PolynomialType,
int xdim,
int xspacedim>
115 template <
int spacedim>
124 template <
int spacedim>
126 initialize_constraints(
const std::vector<
Point<1>> & ,
129 const unsigned int dim = 2;
131 unsigned int q_deg = fe.
degree;
132 if (std::is_same<PolynomialType,
180 std::vector<
Point<dim - 1>> constraint_points;
182 constraint_points.emplace_back(0.5);
186 const unsigned int n = q_deg - 1;
187 const double step = 1. / q_deg;
189 for (
unsigned int i = 1; i <= n; ++i)
190 constraint_points.push_back(
194 for (
unsigned int i = 1; i <= n; ++i)
195 constraint_points.push_back(
208 const std::vector<unsigned int> &index_map_inverse =
210 const std::vector<unsigned int> face_index_map =
211 internal::FE_Q_Base::face_lexicographic_to_hierarchic_numbering<dim>(
218 for (
unsigned int i = 0; i < constraint_points.size(); ++i)
219 for (
unsigned int j = 0; j < q_deg + 1; ++j)
222 p[0] = constraint_points[i](0);
224 fe.
poly_space.compute_value(index_map_inverse[j], p);
236 template <
int spacedim>
238 initialize_constraints(
const std::vector<
Point<1>> & ,
241 const unsigned int dim = 3;
243 unsigned int q_deg = fe.
degree;
244 if (std::is_same<PolynomialType,
263 std::vector<
Point<dim - 1>> constraint_points;
266 constraint_points.emplace_back(0.5, 0.5);
269 constraint_points.emplace_back(0, 0.5);
270 constraint_points.emplace_back(1, 0.5);
271 constraint_points.emplace_back(0.5, 0);
272 constraint_points.emplace_back(0.5, 1);
276 const unsigned int n = q_deg - 1;
277 const double step = 1. / q_deg;
278 std::vector<
Point<dim - 2>> line_support_points(n);
279 for (
unsigned int i = 0; i < n; ++i)
280 line_support_points[i](0) = (i + 1) * step;
281 Quadrature<dim - 2> qline(line_support_points);
284 std::vector<
Point<dim - 1>> p_line(n);
290 for (
unsigned int i = 0; i < n; ++i)
294 for (
unsigned int i = 0; i < n; ++i)
298 for (
unsigned int i = 0; i < n; ++i)
302 for (
unsigned int i = 0; i < n; ++i)
306 for (
unsigned int face = 0;
309 for (
unsigned int subface = 0;
317 constraint_points.insert(constraint_points.end(),
323 std::vector<
Point<dim - 1>> inner_points(n * n);
324 for (
unsigned int i = 0, iy = 1; iy <= n; ++iy)
325 for (
unsigned int ix = 1; ix <= n; ++ix)
329 for (
unsigned int child = 0;
332 for (
unsigned int i = 0; i < inner_points.size(); ++i)
333 constraint_points.push_back(
340 const unsigned int pnts = (q_deg + 1) * (q_deg + 1);
344 const std::vector<unsigned int> &index_map_inverse =
346 const std::vector<unsigned int> face_index_map =
347 internal::FE_Q_Base::face_lexicographic_to_hierarchic_numbering<dim>(
357 for (
unsigned int i = 0; i < constraint_points.size(); ++i)
359 const double interval = (double)(q_deg * 2);
360 bool mirror[dim - 1];
372 for (
unsigned int k = 0; k < dim - 1; ++k)
374 const int coord_int =
375 static_cast<int>(constraint_points[i](k) * interval + 0.25);
376 constraint_point(k) = 1. * coord_int / interval;
398 mirror[k] = (constraint_point(k) > 0.5);
400 constraint_point(k) = 1.0 - constraint_point(k);
403 for (
unsigned int j = 0; j < pnts; ++j)
405 unsigned int indices[2] = {j % (q_deg + 1), j / (q_deg + 1)};
407 for (
unsigned int k = 0; k < 2; ++k)
409 indices[k] = q_deg - indices[k];
411 const unsigned int new_index =
412 indices[1] * (q_deg + 1) + indices[0];
415 fe.
poly_space.compute_value(index_map_inverse[new_index],
432 template <
class PolynomialType,
int dim,
int spacedim>
434 const PolynomialType & poly_space,
436 const std::vector<bool> & restriction_is_additive_flags)
437 :
FE_Poly<PolynomialType, dim, spacedim>(
440 restriction_is_additive_flags,
442 , q_degree(
std::is_same<PolynomialType,
450 template <
class PolynomialType,
int dim,
int spacedim>
453 const std::vector<
Point<1>> &points)
456 ExcMessage(
"The first support point has to be zero."));
457 Assert(points.back()[0] == 1,
458 ExcMessage(
"The last support point has to be one."));
463 const unsigned int q_dofs_per_cell =
464 Utilities::fixed_power<dim>(q_degree + 1);
471 std::vector<unsigned int> renumber(q_dofs_per_cell);
474 for (
unsigned int i = q_dofs_per_cell; i < this->
dofs_per_cell; ++i)
475 renumber.push_back(i);
497 template <
class PolynomialType,
int dim,
int spacedim>
517 const unsigned int q_dofs_per_cell =
518 Utilities::fixed_power<dim>(q_degree + 1);
519 const unsigned int source_q_dofs_per_cell =
520 Utilities::fixed_power<dim>(source_fe->degree + 1);
526 for (
unsigned int j = 0; j < q_dofs_per_cell; ++j)
536 for (
unsigned int i = 0; i < source_q_dofs_per_cell; ++i)
537 interpolation_matrix(j, i) =
538 source_fe->poly_space.compute_value(i, p);
545 for (
unsigned int i = 0; i < source_q_dofs_per_cell; ++i)
546 interpolation_matrix(q_dofs_per_cell, i) = 0.;
547 for (
unsigned int j = 0; j < q_dofs_per_cell; ++j)
548 interpolation_matrix(j, source_q_dofs_per_cell) = 0.;
549 interpolation_matrix(q_dofs_per_cell, source_q_dofs_per_cell) = 1.;
553 const double eps = 2e-13 * q_degree * dim;
555 for (
unsigned int j = 0; j < source_fe->dofs_per_cell; ++j)
556 if (std::fabs(interpolation_matrix(i, j)) < eps)
557 interpolation_matrix(i, j) = 0.;
564 for (
unsigned int j = 0; j < source_fe->dofs_per_cell; ++j)
565 sum += interpolation_matrix(i, j);
595 template <
class PolynomialType,
int dim,
int spacedim>
604 interpolation_matrix);
609 template <
class PolynomialType,
int dim,
int spacedim>
613 const unsigned int subface,
643 source_fe->get_unit_face_support_points());
648 double eps = 2e-13 * q_degree * (dim - 1);
659 for (
unsigned int i = 0; i < source_fe->dofs_per_face; ++i)
661 const Point<dim> &p = subface_quadrature.point(i);
665 double matrix_entry =
671 if (std::fabs(matrix_entry - 1.0) < eps)
673 if (std::fabs(matrix_entry) < eps)
676 interpolation_matrix(i, j) = matrix_entry;
682 for (
unsigned int j = 0; j < source_fe->dofs_per_face; ++j)
687 sum += interpolation_matrix(j, i);
692 else if (
dynamic_cast<const FE_Nothing<dim> *
>(&x_source_fe) !=
nullptr)
705 template <
class PolynomialType,
int dim,
int spacedim>
714 template <
class PolynomialType,
int dim,
int spacedim>
715 std::vector<std::pair<unsigned int, unsigned int>>
724 &fe_other) !=
nullptr)
726 return std::vector<std::pair<unsigned int, unsigned int>>(
727 1, std::make_pair(0U, 0U));
733 return std::vector<std::pair<unsigned int, unsigned int>>();
744 return std::vector<std::pair<unsigned int, unsigned int>>();
749 return std::vector<std::pair<unsigned int, unsigned int>>();
755 template <
class PolynomialType,
int dim,
int spacedim>
756 std::vector<std::pair<unsigned int, unsigned int>>
774 const unsigned int p = this->
degree;
775 const unsigned int q = fe_q_other->degree;
777 std::vector<std::pair<unsigned int, unsigned int>> identities;
779 const std::vector<unsigned int> &index_map_inverse =
781 const std::vector<unsigned int> &index_map_inverse_other =
782 fe_q_other->poly_space.get_numbering_inverse();
784 for (
unsigned int i = 0; i < p - 1; ++i)
785 for (
unsigned int j = 0; j < q - 1; ++j)
788 fe_q_other->unit_support_points[index_map_inverse_other[j + 1]]
790 identities.emplace_back(i, j);
798 return std::vector<std::pair<unsigned int, unsigned int>>();
809 return std::vector<std::pair<unsigned int, unsigned int>>();
814 return std::vector<std::pair<unsigned int, unsigned int>>();
820 template <
class PolynomialType,
int dim,
int spacedim>
821 std::vector<std::pair<unsigned int, unsigned int>>
836 const unsigned int p = this->
degree;
837 const unsigned int q = fe_q_other->degree;
839 std::vector<std::pair<unsigned int, unsigned int>> identities;
841 const std::vector<unsigned int> &index_map_inverse =
843 const std::vector<unsigned int> &index_map_inverse_other =
844 fe_q_other->poly_space.get_numbering_inverse();
846 for (
unsigned int i1 = 0; i1 < p - 1; ++i1)
847 for (
unsigned int i2 = 0; i2 < p - 1; ++i2)
848 for (
unsigned int j1 = 0; j1 < q - 1; ++j1)
849 for (
unsigned int j2 = 0; j2 < q - 1; ++j2)
860 identities.emplace_back(i1 * (p - 1) + i2, j1 * (q - 1) + j2);
868 return std::vector<std::pair<unsigned int, unsigned int>>();
879 return std::vector<std::pair<unsigned int, unsigned int>>();
884 return std::vector<std::pair<unsigned int, unsigned int>>();
890 template <
class PolynomialType,
int dim,
int spacedim>
899 if (this->degree < fe_q_other->degree)
901 else if (this->degree == fe_q_other->degree)
909 if (fe_nothing->is_dominating())
941 template <
class PolynomialType,
int dim,
int spacedim>
944 const std::vector<
Point<1>> &points)
946 const std::vector<unsigned int> &index_map_inverse =
959 for (
unsigned int k = 0; k < support_quadrature.
size(); ++k)
961 support_quadrature.
point(k);
966 template <
class PolynomialType,
int dim,
int spacedim>
969 const std::vector<
Point<1>> &points)
976 Utilities::fixed_power<dim - 1>(q_degree + 1));
979 const std::vector<unsigned int> face_index_map =
980 internal::FE_Q_Base::face_lexicographic_to_hierarchic_numbering<dim>(
988 const Quadrature<dim - 1> support_quadrature(support_1d);
993 for (
unsigned int k = 0; k < support_quadrature.size(); ++k)
995 support_quadrature.point(k);
1000 template <
class PolynomialType,
int dim,
int spacedim>
1013 const unsigned int n = q_degree - 1;
1034 for (
unsigned int local = 0; local < this->
dofs_per_quad; ++local)
1038 unsigned int i = local % n, j = local / n;
1045 i + (n - 1 - j) * n - local;
1048 (n - 1 - j) + (n - 1 - i) * n - local;
1051 (n - 1 - i) + j * n - local;
1056 j + (n - 1 - i) * n - local;
1059 (n - 1 - i) + (n - 1 - j) * n - local;
1062 (n - 1 - j) + i * n - local;
1068 this->dofs_per_line - 1 - i - i;
1073 template <
class PolynomialType,
int dim,
int spacedim>
1076 const unsigned int face_index,
1077 const unsigned int face,
1078 const bool face_orientation,
1079 const bool face_flip,
1080 const bool face_rotation)
const 1104 const unsigned int dof_index_on_vertex =
1110 face, face_vertex, face_orientation, face_flip, face_rotation) *
1112 dof_index_on_vertex);
1122 const unsigned int dof_index_on_line = index % this->
dofs_per_line;
1126 unsigned int adjusted_dof_index_on_line = 0;
1136 if (face_flip ==
false)
1137 adjusted_dof_index_on_line = dof_index_on_line;
1139 adjusted_dof_index_on_line =
1152 ((face_orientation ==
true) && (face_flip ==
false) &&
1153 (face_rotation ==
false)),
1155 adjusted_dof_index_on_line = dof_index_on_line;
1164 face, face_line, face_orientation, face_flip, face_rotation) *
1166 adjusted_dof_index_on_line);
1180 ((face_orientation ==
true) && (face_flip ==
false) &&
1181 (face_rotation ==
false)),
1189 template <
class PolynomialType,
int dim,
int spacedim>
1190 std::vector<unsigned int>
1192 const unsigned int degree)
1195 AssertThrow(degree > 0,
typename FEQ::ExcFEQCannotHaveDegree0());
1196 std::vector<unsigned int> dpo(dim + 1, 1U);
1197 for (
unsigned int i = 1; i < dpo.size(); ++i)
1198 dpo[i] = dpo[i - 1] * (degree - 1);
1204 template <
class PolynomialType,
int dim,
int spacedim>
1207 const std::vector<
Point<1>> &points)
1214 template <
class PolynomialType,
int dim,
int spacedim>
1217 const unsigned int child,
1226 "Prolongation matrices are only available for refined cells!"));
1233 if (this->
prolongation[refinement_case - 1][child].n() == 0)
1238 if (this->
prolongation[refinement_case - 1][child].n() ==
1243 const unsigned int q_dofs_per_cell =
1244 Utilities::fixed_power<dim>(q_degree + 1);
1252 const double eps = 1e-15 * q_degree * dim;
1257 for (
unsigned int i = 0; i < q_dofs_per_cell; ++i)
1260 i, this->unit_support_points[i])) < eps,
1262 "to one or zero in a nodal point. " 1263 "This typically indicates that the " 1264 "polynomial interpolation is " 1265 "ill-conditioned such that round-off " 1266 "prevents the sum to be one."));
1267 for (
unsigned int j = 0; j < q_dofs_per_cell; ++j)
1270 i, this->unit_support_points[j])) < eps,
1272 "The Lagrange polynomial does not evaluate " 1273 "to one or zero in a nodal point. " 1274 "This typically indicates that the " 1275 "polynomial interpolation is " 1276 "ill-conditioned such that round-off " 1277 "prevents the sum to be one."));
1285 const unsigned int dofs1d = q_degree + 1;
1286 std::vector<Table<2, double>> subcell_evaluations(
1288 const std::vector<unsigned int> &index_map_inverse =
1293 unsigned int step_size_diag = 0;
1295 unsigned int factor = 1;
1296 for (
unsigned int d = 0; d < dim; ++d)
1298 step_size_diag += factor;
1307 for (
unsigned int j = 0; j < dofs1d; ++j)
1309 const unsigned int diag_comp = index_map_inverse[j * step_size_diag];
1315 for (
unsigned int i = 0; i < dofs1d; ++i)
1316 for (
unsigned int d = 0; d < dim; ++d)
1320 point[0] = p_cell[d];
1321 const double cell_value =
1322 this->
poly_space.compute_value(index_map_inverse[i], point);
1341 if (std::fabs(cell_value) < eps)
1342 subcell_evaluations[d](j, i) = 0;
1344 subcell_evaluations[d](j, i) = cell_value;
1350 unsigned int j_indices[dim];
1351 internal::FE_Q_Base::zero_indices<dim>(j_indices);
1352 for (
unsigned int j = 0; j < q_dofs_per_cell; j += dofs1d)
1354 unsigned int i_indices[dim];
1355 internal::FE_Q_Base::zero_indices<dim>(i_indices);
1356 for (
unsigned int i = 0; i < q_dofs_per_cell; i += dofs1d)
1358 double val_extra_dim = 1.;
1359 for (
unsigned int d = 1; d < dim; ++d)
1361 subcell_evaluations[d](j_indices[d - 1], i_indices[d - 1]);
1365 for (
unsigned int jj = 0; jj < dofs1d; ++jj)
1367 const unsigned int j_ind = index_map_inverse[j + jj];
1368 for (
unsigned int ii = 0; ii < dofs1d; ++ii)
1369 prolongate(j_ind, index_map_inverse[i + ii]) =
1370 val_extra_dim * subcell_evaluations[0](jj, ii);
1375 internal::FE_Q_Base::increment_indices<dim>(i_indices, dofs1d);
1378 internal::FE_Q_Base::increment_indices<dim>(j_indices, dofs1d);
1384 prolongate(q_dofs_per_cell, q_dofs_per_cell) = 1.;
1389 for (
unsigned int row = 0; row < this->
dofs_per_cell; ++row)
1392 for (
unsigned int col = 0; col < this->
dofs_per_cell; ++col)
1393 sum += prolongate(row, col);
1394 Assert(std::fabs(sum - 1.) <
1395 std::max(eps, 5e-16 * std::sqrt(this->dofs_per_cell)),
1397 "prolongation matrix do not add to one. " 1398 "This typically indicates that the " 1399 "polynomial interpolation is " 1400 "ill-conditioned such that round-off " 1401 "prevents the sum to be one."));
1416 template <
class PolynomialType,
int dim,
int spacedim>
1419 const unsigned int child,
1428 "Restriction matrices are only available for refined cells!"));
1435 if (this->
restriction[refinement_case - 1][child].n() == 0)
1440 if (this->
restriction[refinement_case - 1][child].n() ==
1442 return this->
restriction[refinement_case - 1][child];
1447 const unsigned int q_dofs_per_cell =
1448 Utilities::fixed_power<dim>(q_degree + 1);
1468 const double eps = 1e-15 * q_degree * dim;
1469 const std::vector<unsigned int> &index_map_inverse =
1472 const unsigned int dofs1d = q_degree + 1;
1473 std::vector<Tensor<1, dim>> evaluations1d(dofs1d);
1477 for (
unsigned int i = 0; i < q_dofs_per_cell; ++i)
1479 unsigned int mother_dof = index_map_inverse[i];
1494 for (
unsigned int j = 0; j < dofs1d; ++j)
1495 for (
unsigned int d = 0; d < dim; ++d)
1498 point[0] = p_subcell[d];
1499 evaluations1d[j][d] =
1500 this->
poly_space.compute_value(index_map_inverse[j],
1503 unsigned int j_indices[dim];
1504 internal::FE_Q_Base::zero_indices<dim>(j_indices);
1505 double sum_check = 0;
1506 for (
unsigned int j = 0; j < q_dofs_per_cell; j += dofs1d)
1508 double val_extra_dim = 1.;
1509 for (
unsigned int d = 1; d < dim; ++d)
1510 val_extra_dim *= evaluations1d[j_indices[d - 1]][d];
1511 for (
unsigned int jj = 0; jj < dofs1d; ++jj)
1519 const double val = val_extra_dim * evaluations1d[jj][0];
1520 const unsigned int child_dof = index_map_inverse[j + jj];
1521 if (std::fabs(val - 1.) < eps)
1522 my_restriction(mother_dof, child_dof) = 1.;
1523 else if (std::fabs(val) > eps)
1524 my_restriction(mother_dof, child_dof) = val;
1527 internal::FE_Q_Base::increment_indices<dim>(j_indices,
1530 Assert(std::fabs(sum_check - 1) <
1533 "restriction matrix do not add to one. " 1534 "This typically indicates that the " 1535 "polynomial interpolation is " 1536 "ill-conditioned such that round-off " 1537 "prevents the sum to be one."));
1542 my_restriction(this->dofs_per_cell - 1, this->dofs_per_cell - 1) =
1553 return this->
restriction[refinement_case - 1][child];
1563 template <
class PolynomialType,
int dim,
int spacedim>
1566 const unsigned int shape_index,
1567 const unsigned int face_index)
const 1578 return (((shape_index == 0) && (face_index == 0)) ||
1579 ((shape_index == 1) && (face_index == 1)));
1593 const unsigned int vertex_no = shape_index;
1597 for (
unsigned int v = 0; v < GeometryInfo<dim>::vertices_per_face; ++v)
1607 const unsigned int line_index =
1614 return (line_index == face_index);
1618 const unsigned int lines_per_face =
1621 for (
unsigned int l = 0; l < lines_per_face; ++l)
1634 const unsigned int quad_index =
1636 Assert(static_cast<signed int>(quad_index) <
1646 return (quad_index == face_index);
1665 template <
typename PolynomialType,
int dim,
int spacedim>
1666 std::pair<Table<2, bool>, std::vector<unsigned int>>
1674 for (
unsigned int i = 0; i < Utilities::fixed_power<dim>(q_degree + 1); ++i)
1675 constant_modes(0, i) =
true;
1676 return std::pair<Table<2, bool>, std::vector<unsigned int>>(
1677 constant_modes, std::vector<unsigned int>(1, 0));
1683 #include "fe_q_base.inst" 1685 DEAL_II_NAMESPACE_CLOSE
static Point< dim > child_to_cell_coordinates(const Point< dim > &p, const unsigned int child_index, const RefinementCase< dim > refine_case=RefinementCase< dim >::isotropic_refinement)
virtual std::vector< std::pair< unsigned int, unsigned int > > hp_line_dof_identities(const FiniteElement< dim, spacedim > &fe_other) const override
const unsigned int first_hex_index
FE_Q_Base(const PolynomialType &poly_space, const FiniteElementData< dim > &fe_data, const std::vector< bool > &restriction_is_additive_flags)
static const unsigned int invalid_unsigned_int
std::vector< std::vector< FullMatrix< double > > > restriction
#define AssertDimension(dim1, dim2)
virtual void get_face_interpolation_matrix(const FiniteElement< dim, spacedim > &source, FullMatrix< double > &matrix) const override
void swap(TableBase< N, T > &v)
static std::vector< unsigned int > get_dpo_vector(const unsigned int degree)
static void initialize_constraints(const std::vector< Point< 1 >> &, FE_Q_Base< PolynomialType, 1, spacedim > &)
FullMatrix< double > interface_constraints
virtual double shape_value(const unsigned int i, const Point< dim > &p) const override
Task< RT > new_task(const std::function< RT()> &function)
const unsigned int dofs_per_quad
const unsigned int degree
virtual bool has_support_on_face(const unsigned int shape_index, const unsigned int face_index) const override
static Point< dim > cell_to_child_coordinates(const Point< dim > &p, const unsigned int child_index, const RefinementCase< dim > refine_case=RefinementCase< dim >::isotropic_refinement)
std::vector< Point< dim-1 > > unit_face_support_points
TableIndices< 2 > interface_constraints_size() const
#define AssertThrow(cond, exc)
static::ExceptionBase & ExcInterpolationNotImplemented()
virtual const FullMatrix< double > & get_prolongation_matrix(const unsigned int child, const RefinementCase< dim > &refinement_case=RefinementCase< dim >::isotropic_refinement) const override
static::ExceptionBase & ExcIndexRange(int arg1, int arg2, int arg3)
const unsigned int dofs_per_line
const Point< dim > & point(const unsigned int i) const
std::vector< Point< dim > > unit_support_points
const unsigned int first_face_line_index
unsigned int size() const
void initialize_unit_face_support_points(const std::vector< Point< 1 >> &points)
static::ExceptionBase & ExcMessage(std::string arg1)
static::ExceptionBase & ExcImpossibleInDim(int arg1)
const unsigned int first_quad_index
std::vector< std::vector< FullMatrix< double > > > prolongation
void reinit(const TableIndices< N > &new_size, const bool omit_default_initialization=false)
#define Assert(cond, exc)
static::ExceptionBase & ExcDimensionMismatch(std::size_t arg1, std::size_t arg2)
virtual FiniteElementDomination::Domination compare_for_face_domination(const FiniteElement< dim, spacedim > &fe_other) const override
void initialize_unit_support_points(const std::vector< Point< 1 >> &points)
virtual void get_interpolation_matrix(const FiniteElement< dim, spacedim > &source, FullMatrix< double > &matrix) const override
virtual const FullMatrix< double > & get_restriction_matrix(const unsigned int child, const RefinementCase< dim > &refinement_case=RefinementCase< dim >::isotropic_refinement) const override
virtual unsigned int face_to_cell_index(const unsigned int face_dof_index, const unsigned int face, const bool face_orientation=true, const bool face_flip=false, const bool face_rotation=false) const override
virtual void get_subface_interpolation_matrix(const FiniteElement< dim, spacedim > &source, const unsigned int subface, FullMatrix< double > &matrix) const override
virtual std::vector< std::pair< unsigned int, unsigned int > > hp_quad_dof_identities(const FiniteElement< dim, spacedim > &fe_other) const override
void initialize_constraints(const std::vector< Point< 1 >> &points)
SymmetricTensor< 2, dim, Number > d(const Tensor< 2, dim, Number > &F, const Tensor< 2, dim, Number > &dF_dt)
const unsigned int dofs_per_cell
virtual bool hp_constraints_are_implemented() const override
static unsigned int n_children(const RefinementCase< dim > &refinement_case)
void initialize(const std::vector< Point< 1 >> &support_points_1d)
static void project_to_subface(const SubQuadrature &quadrature, const unsigned int face_no, const unsigned int subface_no, std::vector< Point< dim >> &q_points, const RefinementCase< dim-1 > &ref_case=RefinementCase< dim-1 >::isotropic_refinement)
size_type n_elements() const
static void project_to_face(const SubQuadrature &quadrature, const unsigned int face_no, std::vector< Point< dim >> &q_points)
Table< 2, int > adjust_quad_dof_index_for_face_orientation_table
void initialize_quad_dof_index_permutation()
const unsigned int first_face_quad_index
const unsigned int dofs_per_face
const unsigned int first_line_index
static::ExceptionBase & ExcNotImplemented()
const unsigned int dofs_per_vertex
PolynomialType poly_space
std::vector< int > adjust_line_dof_index_for_line_orientation_table
virtual std::vector< std::pair< unsigned int, unsigned int > > hp_vertex_dof_identities(const FiniteElement< dim, spacedim > &fe_other) const override
virtual std::pair< Table< 2, bool >, std::vector< unsigned int > > get_constant_modes() const override
static::ExceptionBase & ExcInternalError()