A remark on newest vertex bisection in any space dimension

Dietmar Gallistl, Mira Schedensack, Rob P. Stevenson

Research output: Contribution to journalArticleAcademicpeer-review

16 Citations (Scopus)

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 languageEnglish
Pages (from-to)317-320
Number of pages4
JournalComputational Methods in Applied Mathematics
Volume14
Issue number3
DOIs
Publication statusPublished - 1 Jul 2014
Externally publishedYes

Keywords

  • Adaptive mesh-refinement
  • n-Simplices
  • Newest-vertex bisection
  • n/a OA procedure

Fingerprint

Dive into the research topics of 'A remark on newest vertex bisection in any space dimension'. Together they form a unique fingerprint.

Cite this