Reference documentation for deal.II version Git ede8f93e86 2020-12-03 14:59:20 -0700
Collaboration diagram for hp Collections:


This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.

## Classes

class  hp::FECollection< dim, spacedim >

class  hp::FEValues< dim, spacedim >

class  hp::FEFaceValues< dim, spacedim >

class  hp::FESubfaceValues< dim, spacedim >

class  hp::MappingCollection< dim, spacedim >

class  hp::QCollection< dim >

## Detailed Description

In the implementation of the hp finite element method, each cell might have a different finite element associated with it. To handle this, the hp::DoFHandler must have a whole set of finite element classes associated with it. This concept is represented by the hp::FECollection class: Objects of this type act as containers that hold a whole set of finite element objects. Instead of storing pointers to finite element objects on each cell, we then only store an index for each cell that identifies the finite element object within the collection that should be used by this cell. The DoFHandler object associated with the given cell can then assign degrees of freedom to each cell in accordance with the finite element used for it.

A similar situation arises when integrating terms on a cell: one may want to use different quadrature formulas for different finite elements. For example, on cells where we use a Q1 element, a QGauss(2) object (i.e. a quadrature formula with two points in each space direction) may be sufficient, but on another cell where a Q3 element is used, this would lead to underintegration and we should use a QGauss(4) formula instead. Just as above, there exists a class hp::QCollection that acts as a collection of quadrature formulas.

Finally, one may want to use different orders for the boundary approximation for cells with different orders for the finite element. The hp::MappingCollection class allows to do this.

All of these three classes, the hp::FECollection, hp::QCollection, and hp::MappingCollection classes, implement an interface very similar to that of std::vector. They have functions push_back() to add a finite element, quadrature formula, or mapping to the collection. They have an operator[] (unsigned int) function that allows to retrieve a reference to a given element of the collection. And they have a size() function that returns the number of elements in the collection. Some of the classes, in particular that holding finite element objects, also implement other functions specific to their purpose.

The similarity goes beyond the interface: When adding an element to the collection, all of the classes create a copy of the argument. This allows to pass a temporary object to the function adding the element. For example, the following works:

*   FECollection<dim> fe_collection;
*   for (unsigned int degree=1; degree<5; ++degree)
*     fe_collection.push_back (FE_Q<dim>(degree));
* 

This way, one can add elements of polynomial degree 1 through 4 to the collection. It is not necessary to retain the added object: the collection makes a copy of it, it does not only store a pointer to the given finite element object. This same observation also holds for the other collection classes.

It is customary that within an hp finite element program, one keeps collections of finite elements and quadrature formulas with the same number of elements, each element of the one collection matching the element in the other. This is not necessary, but it often makes coding a lot simpler. If a collection of mappings is used, the same holds for hp::MappingCollection objects as well.

Whenever p adaptivity is considered in an hp finite element program, a hierarchy of finite elements needs to be established to determine succeeding finite elements for refinement and preceding ones for coarsening. Typically, this hierarchy considers how finite element spaces are nested: for example, a $$Q_1$$ element describes a sub-space of a $$Q_2$$ element, and so doing $$p$$ refinement usually means using a larger (more accurate) finite element space. In other words, the hierarchy of finite elements is built by considering whether some elements of the collection are sub- or super-spaces of others.

By default, we assume that finite elements are stored in an ascending order based on their polynomial degree. If the order of elements differs, a corresponding hierarchy needs to be supplied to the collection via the hp::FECollection::set_hierarchy() member function.