A remark on newest vertex bisection in any space dimension

Dietmar Gallistl; Mira Schedensack; Rob P. Stevenson

doi:10.1515/cmam-2014-0013

A remark on newest vertex bisection in any space dimension

Dietmar Gallistl, Mira Schedensack, Rob P. Stevenson

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	317-320
Number of pages	4
Journal	Computational Methods in Applied Mathematics
Volume	14
Issue number	3
DOIs	https://doi.org/10.1515/cmam-2014-0013
Publication status	Published - 1 Jul 2014
Externally published	Yes

Keywords

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

Access to Document

10.1515/cmam-2014-0013

Cite this

@article{8cd743ab0ae444dea60388a7b6d10bb5,

title = "A remark on newest vertex bisection in any space dimension",

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.",

keywords = "Adaptive mesh-refinement, n-Simplices, Newest-vertex bisection, n/a OA procedure",

author = "Dietmar Gallistl and Mira Schedensack and Stevenson, \{Rob P.\}",

year = "2014",

month = jul,

day = "1",

doi = "10.1515/cmam-2014-0013",

language = "English",

volume = "14",

pages = "317--320",

journal = "Computational Methods in Applied Mathematics",

issn = "1609-4840",

publisher = "Walter de Gruyter GmbH",

number = "3",

}

TY - JOUR

T1 - A remark on newest vertex bisection in any space dimension

AU - Gallistl, Dietmar

AU - Schedensack, Mira

AU - Stevenson, Rob P.

PY - 2014/7/1

Y1 - 2014/7/1

N2 - 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.

AB - 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.

KW - Adaptive mesh-refinement

KW - n-Simplices

KW - Newest-vertex bisection

KW - n/a OA procedure

UR - https://www.scopus.com/pages/publications/84903942925

U2 - 10.1515/cmam-2014-0013

DO - 10.1515/cmam-2014-0013

M3 - Article

SN - 1609-4840

VL - 14

SP - 317

EP - 320

JO - Computational Methods in Applied Mathematics

JF - Computational Methods in Applied Mathematics

IS - 3

ER -

A remark on newest vertex bisection in any space dimension

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this