Complexity of hierarchical refinement for a class of admissible mesh configurations
Complexity of hierarchical refinement for a class of admissible mesh configurations
Dokument öffnen (167.1KB)Datum der Veröffentlichung
09.2015Verlag / herausgebende Einrichtung
Institut für Numerische Simulation (INS)Verlagsort
BonnMetadaten
Zur Langanzeige
Zitierbarer Link (Handle URI) 
https://hdl.handle.net/20.500.11811/11900
Inhalt
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 [6].
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 finite element context, [3, 24].
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 finite element context, [3, 24].
Schlagwörter
isogeometric analysis, hierarchical splines, THB-splines, adaptivity
Klassifikation (DDC)
510 Mathematik 518 Numerische AnalysisErstpublikation
https://ins.uni-bonn.de/publication/preprintsZugehörige Publikation(en)
https://doi.org/10.1016/j.cagd.2016.04.003Reihe, Nummer
INS Preprints ; 1519Buffa, Annalisa; Giannelli, Carlotta; Morgenstern, Philipp; Peterseim, Daniel: Complexity of hierarchical refinement for a class of admissible mesh configurations. In: INS Preprints, 1519.
Online-Ausgabe in bonndoc: https://hdl.handle.net/20.500.11811/11900
Online-Ausgabe in bonndoc: https://hdl.handle.net/20.500.11811/11900
@unpublished{handle:20.500.11811/11900,
author = {{Annalisa Buffa} and {Carlotta Giannelli} and {Philipp Morgenstern} and {Daniel Peterseim}},
title = {Complexity of hierarchical refinement for a class of admissible mesh configurations},
publisher = {Institut für Numerische Simulation (INS)},
year = 2015,
month = sep,
INS Preprints},
volume = 1519,
note = {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 [6].
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 finite element context, [3, 24].},
url = {https://hdl.handle.net/20.500.11811/11900}
}
author = {{Annalisa Buffa} and {Carlotta Giannelli} and {Philipp Morgenstern} and {Daniel Peterseim}},
title = {Complexity of hierarchical refinement for a class of admissible mesh configurations},
publisher = {Institut für Numerische Simulation (INS)},
year = 2015,
month = sep,
INS Preprints},
volume = 1519,
note = {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 [6].
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 finite element context, [3, 24].},
url = {https://hdl.handle.net/20.500.11811/11900}
}
Die folgenden Nutzungsbestimmungen sind mit dieser Ressource verbunden:
