Name
Abstract | ||
|---|---|---|
Most adaptive finite element strategies employ the Dorfler marking strategy to single out certain elements M subset of 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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1090/mcom/3553 | MATHEMATICS OF COMPUTATION |
Keywords | DocType | Volume |
Dorfler marking criterion, adaptive finite element method, optimal complexity | Journal | 89 |
Issue | ISSN | Citations |
326 | 0025-5718 | 3 |
PageRank | References | Authors |
0.45 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carl-Martin Pfeiler | 1 | 3 | 0.45 |
| Dirk Praetorius | 2 | 121 | 22.50 |