D\"orfler marking with minimal cardinality is a linear complexity problem
Abstract
Most adaptive finite element strategies employ the D\"orfler marking strategy to single out certain elements M ⊂eq 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.