![]() |
Reference documentation for deal.II version 9.6.0
|
Functions | |
template<int dim, int spacedim, typename value_type > | |
value_type | check_equality (const typename ::Triangulation< dim, spacedim >::cell_iterator &parent, const std::vector< value_type > &children_values) |
template<int dim, int spacedim, typename value_type > | |
value_type | sum (const typename ::Triangulation< dim, spacedim >::cell_iterator &parent, const std::vector< value_type > &children_values) |
template<int dim, int spacedim, typename value_type > | |
value_type | l2_norm (const typename ::Triangulation< dim, spacedim >::cell_iterator &parent, const std::vector< value_type > &children_values) |
template<int dim, int spacedim, typename value_type > | |
value_type | mean (const typename ::Triangulation< dim, spacedim >::cell_iterator &parent, const std::vector< value_type > &children_values) |
template<int dim, int spacedim, typename value_type > | |
value_type | max (const typename ::Triangulation< dim, spacedim >::cell_iterator &parent, const std::vector< value_type > &children_values) |
For coarsening, all strategies take the parent cell and a vector of data that belonged to its former children. They return the value that will be assigned to the parent cell.
The ordering of values in the vector for children data corresponds to the index when calling TriaAccessor::child_index.
value_type AdaptationStrategies::Coarsening::check_equality | ( | const typename ::Triangulation< dim, spacedim >::cell_iterator & | parent, |
const std::vector< value_type > & | children_values ) |
Check if data on all children match, and return value of the first child.
\[ d_{K_p} = d_{K_c} \qquad \forall K_c \text{ children of } K_p \]
value_type AdaptationStrategies::Coarsening::sum | ( | const typename ::Triangulation< dim, spacedim >::cell_iterator & | parent, |
const std::vector< value_type > & | children_values ) |
Return sum of data on all children.
\[ d_{K_p} = \sum d_{K_c} \qquad \forall K_c \text{ children of } K_p \]
This strategy preserves the \(l_1\)-norm of the corresponding global data vector before and after adaptation.
value_type AdaptationStrategies::Coarsening::l2_norm | ( | const typename ::Triangulation< dim, spacedim >::cell_iterator & | parent, |
const std::vector< value_type > & | children_values ) |
Return \( l_2 \)-norm of data on all children.
\[ d_{K_p}^2 = \sum d_{K_c}^2 \qquad \forall K_c \text{ children of } K_p \]
This strategy preserves the \(l_2\)-norm of the corresponding global data vector before and after adaptation.
value_type AdaptationStrategies::Coarsening::mean | ( | const typename ::Triangulation< dim, spacedim >::cell_iterator & | parent, |
const std::vector< value_type > & | children_values ) |
Return mean value of data on all children.
\[ d_{K_p} = \sum d_{K_c} / n_\text{children} \qquad \forall K_c \text{ children of } K_p \]
value_type AdaptationStrategies::Coarsening::max | ( | const typename ::Triangulation< dim, spacedim >::cell_iterator & | parent, |
const std::vector< value_type > & | children_values ) |
Return maximum value of data on all children.
\[ d_{K_p} = \max \left( d_{K_c} \right) \qquad \forall K_c \text{ children of } K_p \]