Abstract
With newest vertex bisection, there is no uniform bound on the number of n-simplices that need to be refined to arrive at the smallest conforming refinement T' of a conforming partition T in which one simplex has been bisected. In this note, we show that the difference in levels between any T' and its ancestor T is uniformly bounded. This result has been used in Lemma 4.2 of [SIAM J. Numer. Anal. 51 (2013), 2935-2955] by Carstensen and the first two authors.
Original language | English |
---|---|
Pages (from-to) | 317-320 |
Number of pages | 4 |
Journal | Computational Methods in Applied Mathematics |
Volume | 14 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1 Jul 2014 |
Externally published | Yes |
Keywords
- Adaptive mesh-refinement
- n-Simplices
- Newest-vertex bisection
- n/a OA procedure