![]() |
Reference documentation for deal.II version 9.6.0
|
Classes | |
struct | Implementation |
Functions | |
template<int dim, int spacedim> | |
void | communicate_future_fe_indices (DoFHandler< dim, spacedim > &dof_handler) |
template<int dim, int spacedim = dim> | |
unsigned int | dominated_future_fe_on_children (const typename DoFHandler< dim, spacedim >::cell_iterator &parent) |
static ::ExceptionBase & | ExcNoDominatedFiniteElementOnChildren () |
void internal::hp::DoFHandlerImplementation::communicate_future_fe_indices | ( | DoFHandler< dim, spacedim > & | dof_handler | ) |
Given a DoFHandler object in hp-mode, make sure that the future FE indices that a user has set for locally owned cells are communicated to all other relevant cells as well.
For parallel::shared::Triangulation objects, this information is distributed on both ghost and artificial cells.
In case a parallel::distributed::Triangulation is used, indices are communicated only to ghost cells.
Public wrapper of Implementation::communicate_future_fe_indices().
Definition at line 1686 of file dof_handler.cc.
unsigned int internal::hp::DoFHandlerImplementation::dominated_future_fe_on_children | ( | const typename DoFHandler< dim, spacedim >::cell_iterator & | parent | ) |
Return the index of the finite element from the entire hp::FECollection that is dominated by those assigned as future finite elements to the children of parent
.
We find the corresponding finite element among the future finite elements on the children of this cell. If none of them qualify, we extend our search on the whole hp::FECollection, which is the element that describes the smallest finite element space that includes all future finite elements assigned to the children. If the function is not able to find a finite element at all, an assertion will be triggered.
In this way, we determine the finite element of the parent cell in case of h-coarsening in the hp-context.
Public wrapper of Implementation::dominated_future_fe_on_children().
Definition at line 1699 of file dof_handler.cc.