Debian Codegraph @

include/deal.II/fe/fe_nedelec.h

raw
1 // ------------------------------------------------------------------------
2 //
3 // SPDX-License-Identifier: LGPL-2.1-or-later
4 // Copyright (C) 2002 - 2025 by the deal.II authors
5 //
6 // This file is part of the deal.II library.
7 //
8 // Part of the source code is dual licensed under Apache-2.0 WITH
9 // LLVM-exception OR LGPL-2.1-or-later. Detailed license information
10 // governing the source code and code contributions can be found in
11 // LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II.
12 //
13 // ------------------------------------------------------------------------
14
15 #ifndef dealii_fe_nedelec_h
16 #define dealii_fe_nedelec_h
17
18 #include <deal.II/base/config.h>
19
20 #include <deal.II/base/geometry_info.h>
21 #include <deal.II/base/mutex.h>
22 #include <deal.II/base/polynomial.h>
23 #include <deal.II/base/polynomials_nedelec.h>
24 #include <deal.II/base/table.h>
25 #include <deal.II/base/tensor.h>
26 #include <deal.II/base/tensor_product_polynomials.h>
27
28 #include <deal.II/fe/fe.h>
29 #include <deal.II/fe/fe_poly_tensor.h>
30
31 #include <vector>
32
33 DEAL_II_NAMESPACE_OPEN
34
35 /**
36 * @addtogroup fe
37 * @{
38 */
39
40 /**
41 * @warning Several aspects of the implementation are experimental. For the
42 * moment, it is safe to use the element on globally refined meshes with
43 * consistent orientation of faces. See the todo entries below for more
44 * detailed caveats.
45 *
46 * Implementation of N&eacute;d&eacute;lec elements. The N&eacute;d&eacute;lec
47 * space is designed to solve problems in which the solution only lives in the
48 * space
49 * $H^\text{curl}=\{ {\mathbf u} \in L_2: \text{curl}\, {\mathbf u} \in L_2\}$,
50 * rather than in the more commonly used space
51 * $H^1=\{ u \in L_2: \nabla u \in L_2\}$. In other words, the solution must
52 * be a vector field whose curl is square integrable, but for which the
53 * gradient may not be square integrable. The typical application for this
54 * space (and these elements) is to the Maxwell equations and corresponding
55 * simplifications, such as the reduced version of the Maxwell equation
56 * that only involves the electric field $\mathbf E$ which has to satisfy
57 * the equation $\text{curl}\, \text{curl}\, {\mathbf E} = 0$ in the
58 * time independent case when no currents are present, or the equation
59 * $\text{curl}\,\text{curl}\,{\mathbf A} = 4\pi{\mathbf j}$ that the
60 * magnetic vector potential $\mathbf A$ has to satisfy in the
61 * time independent case.
62 *
63 * The defining
64 * characteristic of functions in $H^\text{curl}$ is that they are in
65 * general discontinuous -- but that if you draw a line in 2d (or a
66 * surface in 3d), then the <i>tangential</i> component(s) of the vector
67 * field must be continuous across the line (or surface) even though
68 * the normal component may not be. As a consequence, the
69 * N&eacute;d&eacute;lec element is constructed in such a way that (i) it is
70 * @ref vector_valued "vector-valued",
71 * (ii) the shape functions are
72 * discontinuous, but (iii) the tangential component(s) of the vector field
73 * represented by each shape function are continuous across the faces
74 * of cells.
75 *
76 * Other properties of the N&eacute;d&eacute;lec element are that (i) it is
77 * @ref GlossPrimitive "not a primitive element"
78 * ; (ii) the shape functions
79 * are defined so that certain integrals over the faces are either zero
80 * or one, rather than the common case of certain point values being
81 * either zero or one.
82 *
83 * We follow the commonly used -- though confusing -- definition of the "degree"
84 * of N&eacute;d&eacute;lec elements. Specifically, the "degree" of the element
85 * denotes the polynomial degree of the <i>largest complete polynomial
86 * subspace</i> contained in the finite element space, even if the space may
87 * contain shape functions of higher polynomial degree. The lowest order element
88 * is consequently FE_Nedelec(0), i.e., the Raviart-Thomas element "of degree
89 * zero", even though the functions of this space are in general polynomials of
90 * degree one in each variable. This choice of "degree" implies that the
91 * approximation order of the function itself is <i>degree+1</i>, as with usual
92 * polynomial spaces. The numbering so chosen implies the sequence
93 * @f[
94 * Q_{k+1}
95 * \stackrel{\text{grad}}{\rightarrow}
96 * \text{Nedelec}_k
97 * \stackrel{\text{curl}}{\rightarrow}
98 * \text{RaviartThomas}_k
99 * \stackrel{\text{div}}{\rightarrow}
100 * DGQ_{k}
101 * @f]
102 * Note that this follows the convention of Brezzi and Raviart,
103 * though not the one used in the original paper by N&eacute;d&eacute;lec.
104 *
105 * This class is not implemented for the codimension one case (<tt>spacedim !=
106 * dim</tt>).
107 *
108 * @todo Even if this element is implemented for two and three space
109 * dimensions, the definition of the node values relies on consistently
110 * oriented faces in 3d. Therefore, care should be taken on complicated
111 * meshes.
112 *
113 *
114 * <h3>Interpolation</h3>
115 *
116 * The
117 * @ref GlossInterpolation "interpolation"
118 * operators associated with the N&eacute;d&eacute;lec element are constructed
119 * such that interpolation and computing the curl are commuting operations on
120 * rectangular mesh cells. We require this from interpolating arbitrary
121 * functions as well as the #restriction matrices.
122 *
123 * <h4>Node values</h4>
124 *
125 * The
126 * @ref GlossNodes "node values"
127 * for an element of degree <i>k</i> on the reference cell are:
128 * <ol>
129 * <li> On edges: the moments of the tangential component with respect to
130 * polynomials of degree <i>k</i>.
131 * <li> On faces: the moments of the tangential components with respect to
132 * <tt>dim</tt>-1 dimensional FE_Nedelec polynomials of degree <i>k</i>-1.
133 * <li> In cells: the moments with respect to gradients of polynomials in FE_Q
134 * of degree <i>k</i>.
135 * </ol>
136 *
137 * <h4>Generalized support points</h4>
138 *
139 * The node values above rely on integrals, which will be computed by
140 * quadrature rules themselves. The generalized support points are a set of
141 * points such that this quadrature can be performed with sufficient accuracy.
142 * The points needed are those of QGauss(k+1) on each edge and
143 * QGauss(k+2) on each face and in the interior of the cell (or none
144 * for FE_Nedelec(0)).
145 *
146 * <h3> Depictions of shape functions </h3>
147 *
148 * The following subsections depict the shape functions defined by this class on
149 * the unit cell. The figures below illustrate the direction and magnitude of
150 * these shape functions.
151 *
152 * <h4>FE_Nedelec(0)</h4>
153 *
154 * For the lowest order N&eacute;d&eacute;lec element, we have a single shape
155 * function associated with each edge (i.e., the tangential component of each
156 * shape function is non-zero on only one edge).
157 *
158 * In 2d, these shape functions look as follows: <table> <tr> <td
159 * align="center">
160 * @image html fe_nedelec_shape_function_0_00.png
161 * </td>
162 *
163 * <td align="center">
164 * @image html fe_nedelec_shape_function_0_01.png
165 * </td> </tr> <tr> <td align="center"> FE_Nedelec(0) element, shape function 0
166 * </td>
167 *
168 * <td align="center"> FE_Nedelec(0) element, shape function 1 </td> </tr>
169 *
170 * <tr> <td align="center">
171 * @image html fe_nedelec_shape_function_0_02.png
172 * </td>
173 *
174 * <td align="center">
175 * @image html fe_nedelec_shape_function_0_03.png
176 * </td> </tr> <tr> <td align="center"> FE_Nedelec(0) element, shape function 2
177 * </td>
178 *
179 * <td align="center"> FE_Nedelec(0) element, shape function 3 </td> </tr>
180 * </table>
181 *
182 * <h4>FE_Nedelec(1)</h4>
183 *
184 * For higher order N&eacute;d&eacute;lec cells, we have shape functions
185 * associated with the edges, faces, and the volume.
186 *
187 * In 2d, for example, with FE_Nedelec(1), we have 2 shape functions associated
188 * with each edge, and 4 shape functions associated with the cell, which
189 * correspond to the shape functions with no non-zero tangential components on
190 * the boundary of the cell.
191 *
192 * These shape functions look
193 * as follows: <table> <tr> <td align="center">
194 * @image html fe_nedelec_shape_function_1_00.png
195 * </td>
196 *
197 * <td align="center">
198 * @image html fe_nedelec_shape_function_1_01.png
199 * </td> </tr> <tr> <td align="center"> FE_Nedelec(1) element, shape function 0
200 * </td>
201 *
202 * <td align="center"> FE_Nedelec(1) element, shape function 1 </td> </tr>
203 *
204 * <tr> <td align="center">
205 * @image html fe_nedelec_shape_function_1_02.png
206 * </td>
207 *
208 * <td align="center">
209 * @image html fe_nedelec_shape_function_1_03.png
210 * </td> </tr> <tr> <td align="center"> FE_Nedelec(1) element, shape function 2
211 * </td>
212 *
213 * <td align="center"> FE_Nedelec(1) element, shape function 3 </td> </tr>
214 *
215 * <tr> <td align="center">
216 * @image html fe_nedelec_shape_function_1_04.png
217 * </td>
218 *
219 * <td align="center">
220 * @image html fe_nedelec_shape_function_1_05.png
221 * </td> </tr> <tr> <td align="center"> FE_Nedelec(1) element, shape function 4
222 * </td>
223 *
224 * <td align="center"> FE_Nedelec(1) element, shape function 5 </td> </tr>
225 *
226 * <tr> <td align="center">
227 * @image html fe_nedelec_shape_function_1_06.png
228 * </td>
229 *
230 * <td align="center">
231 * @image html fe_nedelec_shape_function_1_07.png
232 * </td> </tr> <tr> <td align="center"> FE_Nedelec(1) element, shape function 6
233 * </td>
234 *
235 * <td align="center"> FE_Nedelec(1) element, shape function 7 </td> </tr>
236 *
237 * <tr> <td align="center">
238 * @image html fe_nedelec_shape_function_1_08.png
239 * </td>
240 *
241 * <td align="center">
242 * @image html fe_nedelec_shape_function_1_09.png
243 * </td> </tr> <tr> <td align="center"> FE_Nedelec(1) element, shape function 8
244 * </td>
245 *
246 * <td align="center"> FE_Nedelec(1) element, shape function 9 </td> </tr>
247 *
248 * <tr> <td align="center">
249 * @image html fe_nedelec_shape_function_1_10.png
250 * </td>
251 * <td align="center">
252 * @image html fe_nedelec_shape_function_1_11.png
253 * </td> </tr> <tr> <td align="center"> FE_Nedelec(1) element, shape function 10
254 * </td>
255 *
256 * <td align="center"> FE_Nedelec(1) element, shape function 11 </td> </table>
257 *
258 * <h4>FE_Nedelec(2)</h4>
259 *
260 * For higher order N&eacute;d&eacute;lec cells, we have shape functions
261 * associated with the edges, faces, and the volume.
262 *
263 * In 2d, with FE_Nedelec(2), we have 3 shape functions associated with each
264 * edge, and 12 shape functions associated with the cell.
265 *
266 * These shape functions look
267 * as follows: <table> <tr> <td align="center">
268 * @image html fe_nedelec_shape_function_2_00.png
269 * </td>
270 *
271 * <td align="center">
272 * @image html fe_nedelec_shape_function_2_01.png
273 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 0
274 * </td>
275 *
276 * <td align="center"> FE_Nedelec(2) element, shape function 1 </td> </tr>
277 *
278 * <tr> <td align="center">
279 * @image html fe_nedelec_shape_function_2_02.png
280 * </td>
281 *
282 * <td align="center">
283 * @image html fe_nedelec_shape_function_2_03.png
284 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 2
285 * </td>
286 *
287 * <td align="center"> FE_Nedelec(2) element, shape function 3 </td> </tr>
288 *
289 * <tr> <td align="center">
290 * @image html fe_nedelec_shape_function_2_04.png
291 * </td>
292 *
293 * <td align="center">
294 * @image html fe_nedelec_shape_function_2_05.png
295 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 4
296 * </td>
297 *
298 * <td align="center"> FE_Nedelec(2) element, shape function 5 </td> </tr>
299 *
300 * <tr> <td align="center">
301 * @image html fe_nedelec_shape_function_2_06.png
302 * </td>
303 *
304 * <td align="center">
305 * @image html fe_nedelec_shape_function_2_07.png
306 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 6
307 * </td>
308 *
309 * <td align="center"> FE_Nedelec(2) element, shape function 7 </td> </tr>
310 *
311 * <tr> <td align="center">
312 * @image html fe_nedelec_shape_function_2_08.png
313 * </td>
314 *
315 * <td align="center">
316 * @image html fe_nedelec_shape_function_2_09.png
317 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 8
318 * </td>
319 *
320 * <td align="center"> FE_Nedelec(2) element, shape function 9 </td> </tr>
321 *
322 * <tr> <td align="center">
323 * @image html fe_nedelec_shape_function_2_10.png
324 * </td>
325 *
326 * <td align="center">
327 * @image html fe_nedelec_shape_function_2_11.png
328 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 10
329 * </td>
330 *
331 * <td align="center"> FE_Nedelec(2) element, shape function 11 </td> </tr>
332 *
333 * <tr> <td align="center">
334 * @image html fe_nedelec_shape_function_2_12.png
335 * </td>
336 *
337 * <td align="center">
338 * @image html fe_nedelec_shape_function_2_13.png
339 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 12
340 * </td>
341 *
342 * <td align="center"> FE_Nedelec(2) element, shape function 13 </td> </tr>
343 *
344 * <tr> <td align="center">
345 * @image html fe_nedelec_shape_function_2_14.png
346 * </td>
347 *
348 * <td align="center">
349 * @image html fe_nedelec_shape_function_2_15.png
350 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 14
351 * </td>
352 *
353 * <td align="center"> FE_Nedelec(2) element, shape function 15 </td> </tr>
354 *
355 * <tr> <td align="center">
356 * @image html fe_nedelec_shape_function_2_16.png
357 * </td>
358 *
359 * <td align="center">
360 * @image html fe_nedelec_shape_function_2_17.png
361 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 16
362 * </td>
363 *
364 * <td align="center"> FE_Nedelec(2) element, shape function 17 </td> </tr>
365 *
366 * <tr> <td align="center">
367 * @image html fe_nedelec_shape_function_2_18.png
368 * </td>
369 *
370 * <td align="center">
371 * @image html fe_nedelec_shape_function_2_19.png
372 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 18
373 * </td>
374 *
375 * <td align="center"> FE_Nedelec(2) element, shape function 19 </td> </tr>
376 *
377 * <tr> <td align="center">
378 * @image html fe_nedelec_shape_function_2_20.png
379 * </td>
380 *
381 * <td align="center">
382 * @image html fe_nedelec_shape_function_2_21.png
383 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 20
384 * </td>
385 *
386 * <td align="center"> FE_Nedelec(2) element, shape function 21 </td> </tr>
387 *
388 * <tr> <td align="center">
389 * @image html fe_nedelec_shape_function_2_22.png
390 * </td>
391 *
392 * <td align="center">
393 * @image html fe_nedelec_shape_function_2_23.png
394 * </td> </tr> <tr> <td align="center"> FE_Nedelec(2) element, shape function 22
395 * </td>
396 *
397 * <td align="center"> FE_Nedelec(2) element, shape function 23 </td> </table>
398 */
399 template <int dim>
400 class FE_Nedelec : public FE_PolyTensor<dim>
401 {
402 public:
403 /**
404 * Constructor for the Nedelec element of given @p order. The maximal
405 * polynomial degree of the shape functions is `order+1` (in each variable;
406 * the total polynomial degree may be higher). If `order = 0`, the element is
407 * linear and has degrees of freedom only on the edges. If `order >=1` the
408 * element has degrees of freedom on the edges, faces and volume. For example
409 * the 3d version of FE_Nedelec has 12 degrees of freedom for `order = 0`
410 * and 54 for `degree = 1`. It is important to have enough quadrature points
411 * in order to perform the quadrature with sufficient accuracy.
412 * For example
413 * [QGauss<dim>(order + 2)](@ref QGauss)
414 * can be used for the
415 * quadrature formula, where `order` is the order of FE_Nedelec.
416 */
417 FE_Nedelec(const unsigned int order);
418
419 /**
420 * Return a string that uniquely identifies a finite element. This class
421 * returns <tt>FE_Nedelec<dim>(degree)</tt>, with @p dim and @p degree
422 * replaced by appropriate values.
423 */
424 virtual std::string
425 get_name() const override;
426
427
428 /**
429 * This function returns @p true, if the shape function @p shape_index has
430 * non-zero function values somewhere on the face @p face_index.
431 */
432 virtual bool
433 has_support_on_face(const unsigned int shape_index,
434 const unsigned int face_index) const override;
435
436 /**
437 * Return whether this element implements its hanging node constraints in
438 * the new way, which has to be used to make elements "hp-compatible".
439 *
440 * For the <tt>FE_Nedelec</tt> class the result is always true (independent
441 * of the degree of the element), as it implements the complete set of
442 * functions necessary for hp-capability.
443 */
444 virtual bool
445 hp_constraints_are_implemented() const override;
446
447 /**
448 * @copydoc FiniteElement::compare_for_domination()
449 */
450 virtual FiniteElementDomination::Domination
451 compare_for_domination(const FiniteElement<dim> &fe_other,
452 const unsigned int codim = 0) const override final;
453
454 /**
455 * If, on a vertex, several finite elements are active, the hp-code first
456 * assigns the degrees of freedom of each of these FEs different global
457 * indices. It then calls this function to find out which of them should get
458 * identical values, and consequently can receive the same global DoF index.
459 * This function therefore returns a list of identities between DoFs of the
460 * present finite element object with the DoFs of @p fe_other, which is a
461 * reference to a finite element object representing one of the other finite
462 * elements active on this particular vertex. The function computes which of
463 * the degrees of freedom of the two finite element objects are equivalent,
464 * both numbered between zero and the corresponding value of
465 * n_dofs_per_vertex() of the two finite elements. The first index of each
466 * pair denotes one of the vertex dofs of the present element, whereas the
467 * second is the corresponding index of the other finite element.
468 */
469 virtual std::vector<std::pair<unsigned int, unsigned int>>
470 hp_vertex_dof_identities(const FiniteElement<dim> &fe_other) const override;
471
472 /**
473 * Same as hp_vertex_dof_indices(), except that the function treats degrees
474 * of freedom on lines.
475 */
476 virtual std::vector<std::pair<unsigned int, unsigned int>>
477 hp_line_dof_identities(const FiniteElement<dim> &fe_other) const override;
478
479 /**
480 * Same as hp_vertex_dof_indices(), except that the function treats degrees
481 * of freedom on lines.
482 */
483 virtual std::vector<std::pair<unsigned int, unsigned int>>
484 hp_quad_dof_identities(const FiniteElement<dim> &fe_other,
485 const unsigned int face_no = 0) const override;
486
487 /**
488 * Return the matrix interpolating from a face of one element to the face of
489 * the neighboring element. The size of the matrix is then
490 * <tt>source.dofs_per_face</tt> times <tt>this->dofs_per_face</tt>.
491 *
492 * Derived elements will have to implement this function. They may only
493 * provide interpolation matrices for certain source finite elements, for
494 * example those from the same family. If they don't implement interpolation
495 * from a given element, then they must throw an exception of type
496 * <tt>FiniteElement<dim>::ExcInterpolationNotImplemented</tt>.
497 */
498 virtual void
499 get_face_interpolation_matrix(const FiniteElement<dim> &source,
500 FullMatrix<double> &matrix,
501 const unsigned int face_no = 0) const override;
502
503 /**
504 * Return the matrix interpolating from a face of one element to the subface
505 * of the neighboring element. The size of the matrix is then
506 * <tt>source.dofs_per_face</tt> times <tt>this->dofs_per_face</tt>.
507 *
508 * Derived elements will have to implement this function. They may only
509 * provide interpolation matrices for certain source finite elements, for
510 * example those from the same family. If they don't implement interpolation
511 * from a given element, then they must throw an exception of type
512 * <tt>ExcInterpolationNotImplemented</tt>.
513 */
514 virtual void
515 get_subface_interpolation_matrix(
516 const FiniteElement<dim> &source,
517 const unsigned int subface,
518 FullMatrix<double> &matrix,
519 const unsigned int face_no = 0) const override;
520
521 /**
522 * Projection from a fine grid space onto a coarse grid space. If this
523 * projection operator is associated with a matrix @p P, then the
524 * restriction of this matrix @p P_i to a single child cell is returned
525 * here.
526 *
527 * The matrix @p P is the concatenation or the sum of the cell matrices @p
528 * P_i, depending on the #restriction_is_additive_flags. This distinguishes
529 * interpolation (concatenation) and projection with respect to scalar
530 * products (summation).
531 *
532 * Row and column indices are related to coarse grid and fine grid spaces,
533 * respectively, consistent with the definition of the associated operator.
534 */
535 virtual const FullMatrix<double> &
536 get_restriction_matrix(
537 const unsigned int child,
538 const RefinementCase<dim> &refinement_case =
539 RefinementCase<dim>::isotropic_refinement) const override;
540
541 /**
542 * Embedding matrix between grids.
543 *
544 * The identity operator from a coarse grid space into a fine grid space is
545 * associated with a matrix @p P. The restriction of this matrix @p P_i to a
546 * single child cell is returned here.
547 *
548 * The matrix @p P is the concatenation, not the sum of the cell matrices @p
549 * P_i. That is, if the same non-zero entry <tt>j,k</tt> exists in two
550 * different child matrices @p P_i, the value should be the same in both
551 * matrices and it is copied into the matrix @p P only once.
552 *
553 * Row and column indices are related to fine grid and coarse grid spaces,
554 * respectively, consistent with the definition of the associated operator.
555 *
556 * These matrices are used by routines assembling the prolongation matrix
557 * for multi-level methods. Upon assembling the transfer matrix between
558 * cells using this matrix array, zero elements in the prolongation matrix
559 * are discarded and will not fill up the transfer matrix.
560 */
561 virtual const FullMatrix<double> &
562 get_prolongation_matrix(
563 const unsigned int child,
564 const RefinementCase<dim> &refinement_case =
565 RefinementCase<dim>::isotropic_refinement) const override;
566
567 // documentation inherited from the base class
568 virtual void
569 convert_generalized_support_point_values_to_dof_values(
570 const std::vector<Vector<double>> &support_point_values,
571 std::vector<double> &nodal_values) const override;
572
573 /**
574 * Return a list of constant modes of the element.
575 */
576 virtual std::pair<Table<2, bool>, std::vector<unsigned int>>
577 get_constant_modes() const override;
578
579 virtual std::size_t
580 memory_consumption() const override;
581
582 virtual std::unique_ptr<FiniteElement<dim, dim>>
583 clone() const override;
584
585 /**
586 * For a finite element of degree larger than @p sub_degree, we return a
587 * vector which maps the numbering on an FE of degree @p sub_degree into the
588 * numbering on this element.
589 *
590 * Note that for the Nedelec element, by @p sub_degree,
591 * we refer to the maximal polynomial degree (in any coordinate direction) as
592 * opposed to the Nedelec degree.
593 */
594 std::vector<unsigned int>
595 get_embedding_dofs(const unsigned int sub_degree) const;
596
597 private:
598 /**
599 * Only for internal use. Its full name is @p get_dofs_per_object_vector
600 * function and it creates the @p dofs_per_object vector that is needed
601 * within the constructor to be passed to the constructor of @p
602 * FiniteElementData.
603 *
604 * If the optional argument <tt>dg</tt> is true, the vector returned will
605 * have all degrees of freedom assigned to the cell, none on the faces and
606 * edges.
607 */
608 static std::vector<unsigned int>
609 get_dpo_vector(const unsigned int degree, bool dg = false);
610
611 /**
612 * Initialize the @p generalized_support_points field of the FiniteElement
613 * class and fill the tables with interpolation weights (#boundary_weights
614 * and interior_weights). Called from the constructor.
615 */
616 void
617 initialize_support_points(const unsigned int order);
618
619 /**
620 * Initialize the interpolation from functions on refined mesh cells onto
621 * the parent cell. According to the philosophy of the Nédélec element,
622 * this restriction operator preserves the curl of a function weakly.
623 */
624 void
625 initialize_restriction();
626
627 /**
628 * These are the factors multiplied to a function in the
629 * #generalized_face_support_points when computing the integration.
630 *
631 * See the
632 * @ref GlossGeneralizedSupport "glossary entry on generalized support points"
633 * for more information.
634 */
635 Table<2, double> boundary_weights;
636
637 /**
638 * Mutex variables used for protecting the initialization of restriction
639 * and embedding matrices.
640 */
641 mutable Threads::Mutex restriction_matrix_mutex;
642 mutable Threads::Mutex prolongation_matrix_mutex;
643
644 /**
645 * Initialize the permutation pattern and the pattern of sign change.
646 *
647 * @note Currently this function is implemented for the finite elements of
648 * the order k < 5.
649 */
650 void
651 initialize_quad_dof_index_permutation_and_sign_change();
652
653 // Allow access from other dimensions.
654 template <int dim1>
655 friend class FE_Nedelec;
656 };
657
658 /* -------------- declaration of explicit specializations ------------- */
659
660 #ifndef DOXYGEN
661
662 template <>
663 void
664 FE_Nedelec<1>::initialize_restriction();
665
666 #endif // DOXYGEN
667
668 /** @} */
669
670 DEAL_II_NAMESPACE_CLOSE
671
672 #endif