Dörfler marking with minimal cardinality is a linear complexity problem

07/30/2019

∙

by   Carl-Martin Pfeiler, et al.

∙

0

∙

share

Most adaptive finite element strategies employ the Dörfler marking strategy to single out certain elements M⊆T of a triangulation T for refinement. In the literature, different algorithms have been proposed to construct M, where usually two goals compete: On the one hand, M should contain a minimal number of elements. On the other hand, one aims for linear costs with respect to the cardinality of T. Unlike expected in the literature, we formulate and analyze an algorithm, which constructs a minimal set M at linear costs. Throughout, pseudocodes are given.