Dörfler marking with minimal cardinality is a linear complexity problem
Carl-Martin Pfeiler, Dirk Praetorius
Source abstract
Most adaptive finite element strategies employ the Dörfler marking strategy to single out certain elements M ⊆ T \mathcal {M} \subseteq \mathcal {T} of a triangulation T \mathcal {T} for refinement. In the literature, different algorithms have been proposed to construct M \mathcal {M} , where usually two goals compete. On the one hand, M \mathcal {M} should contain a minimal number of elements. On the other hand, one aims for linear costs with respect to the cardinality of T \mathcal {T} . Unlike expected in the literature, we formulate and analyze an algorithm, which constructs a minimal set M \mathcal {M} at linear costs. Throughout, pseudocodes are given.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.