Complexity of hierarchical refinement for a class of admissible mesh configurations
被引:25
作者:
Buffa, Annalisa
论文数: 0引用数: 0
h-index: 0
机构:
CNR, Ist Matemat Applicata & Tecnol Informat E Magenes, Via Ferrata 1, I-27100 Pavia, ItalyCNR, Ist Matemat Applicata & Tecnol Informat E Magenes, Via Ferrata 1, I-27100 Pavia, Italy
Buffa, Annalisa
[1
]
Giannelli, Carlotta
论文数: 0引用数: 0
h-index: 0
机构:
Univ Firenze, Dipartimento Matemat & Informat U Dini, Viale Morgagni 67-A, I-50134 Florence, ItalyCNR, Ist Matemat Applicata & Tecnol Informat E Magenes, Via Ferrata 1, I-27100 Pavia, Italy
Giannelli, Carlotta
[2
]
Morgenstern, Philipp
论文数: 0引用数: 0
h-index: 0
机构:
Univ Bonn, Inst Numer Simulat, Wegelerstr 6, D-53115 Bonn, GermanyCNR, Ist Matemat Applicata & Tecnol Informat E Magenes, Via Ferrata 1, I-27100 Pavia, Italy
Morgenstern, Philipp
[3
]
Peterseim, Daniel
论文数: 0引用数: 0
h-index: 0
机构:
Univ Bonn, Inst Numer Simulat, Wegelerstr 6, D-53115 Bonn, GermanyCNR, Ist Matemat Applicata & Tecnol Informat E Magenes, Via Ferrata 1, I-27100 Pavia, Italy
Peterseim, Daniel
[3
]
机构:
[1] CNR, Ist Matemat Applicata & Tecnol Informat E Magenes, Via Ferrata 1, I-27100 Pavia, Italy
[2] Univ Firenze, Dipartimento Matemat & Informat U Dini, Viale Morgagni 67-A, I-50134 Florence, Italy
An adaptive isogeometric method based on d-variate hierarchical spline constructions can be derived by considering a refine module that preserves a certain class of admissibility between two consecutive steps of the adaptive loop (Buffa and Giannelli, 2016). In this paper we provide a complexity estimate, i.e., an estimate on how the number of mesh elements grows with respect to the number of elements that are marked for refinement by the adaptive strategy. Our estimate is in the line of the similar ones proved in the context of adaptive finite element methods. (C) 2016 Elsevier B.V. All rights reserved.