- A Remark on Newest Vertex Bisection in Any Space Dimension
- Computational methods in applied mathematics
- Volume | Issue number
- 14 | 3
- Pages (from-to)
- Document type
- Faculty of Science (FNWI)
- Korteweg-de Vries Institute for Mathematics (KdVI)
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′∈T′ and its ancestor T∈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.
Keywords: Newest-Vertex Bisection; Adaptive Mesh-Refinement; n-Simplices
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.