dune-fem 2.8-git
|
Classes | |
struct | Marker |
Functions | |
template<class Grid , class Indicator > | |
static std::pair< int, int > | mark (Grid &grid, Indicator &indicator, const double refineTolerance, const double coarsenTolerance, int minLevel=0, int maxLevel=-1, const bool markNeighbors=false) |
template<class Grid , class Indicator > | |
static std::pair< int, int > | doerflerMarking (Grid &grid, const Indicator &indicator, const double theta, int maxLevel=-1) |
doerflerMarking More... | |
template<class Grid , class Indicator > | |
static std::pair< int, int > | layeredDoerflerMarking (Grid &grid, const Indicator &indicator, const double tolerance, int maxLevel=-1, double nu=0.05) |
|
inlinestatic |
doerflerMarking
Mark a minimal set of elements in a grid
such that $[ \sum_{T \in \mathcal{A}} \eta_t \ge \theta\,\sum_{T \in \mathcal{G}} \eta_T. $]
See also: W. Dörfler, A Convergent Adaptive Algorithm for Poisson's Equation, SIAM J. Numer. Anal. 33 (3), 1106-1124, 1996
For the sake of simplicity, this algorithm assumes disjoint local errors . Otherwise, too more elements may be marked.
[in] | localError | function modelling ![]() |
[in] | theta | factor of total error to mark |
[in,out] | grid | grid ![]() |
|
inlinestatic |
|
inlinestatic |