Analysis-suitable adaptive T-mesh refinement with linear complexity
Analysis-suitable adaptive T-mesh refinement with linear complexity
View/Date of Publication
07.2014Publisher
Institut für Numerische Simulation (INS)Publisher Location
BonnMetadata
Show full item record
Citable Link (Handle URI) 
https://hdl.handle.net/20.500.11811/11914
Abstract
We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, this is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spaces, and linear computational complexity of the refinement procedure in terms of the number of marked and generated mesh elements.
Subjects
Isogeometric Analysis, T-Splines, Analysis-Suitability, Nestedness, Adaptive mesh refinement
Classification (DDC)
510 Mathematik 518 Numerische AnalysisFirst Publication
https://ins.uni-bonn.de/publication/preprintsRelated Publications
https://doi.org/10.1016/j.cagd.2015.02.003Part of Series
INS Preprints ; 1409Morgenstern, Philipp; Peterseim, Daniel: Analysis-suitable adaptive T-mesh refinement with linear complexity. In: INS Preprints, 1409.
Online-Ausgabe in bonndoc: https://hdl.handle.net/20.500.11811/11914
Online-Ausgabe in bonndoc: https://hdl.handle.net/20.500.11811/11914
@unpublished{handle:20.500.11811/11914,
author = {{Philipp Morgenstern} and {Daniel Peterseim}},
title = {Analysis-suitable adaptive T-mesh refinement with linear complexity},
publisher = {Institut für Numerische Simulation (INS)},
year = 2014,
month = jul,
INS Preprints},
volume = 1409,
note = {We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, this is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spaces, and linear computational complexity of the refinement procedure in terms of the number of marked and generated mesh elements.},
url = {https://hdl.handle.net/20.500.11811/11914}
}
author = {{Philipp Morgenstern} and {Daniel Peterseim}},
title = {Analysis-suitable adaptive T-mesh refinement with linear complexity},
publisher = {Institut für Numerische Simulation (INS)},
year = 2014,
month = jul,
INS Preprints},
volume = 1409,
note = {We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, this is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spaces, and linear computational complexity of the refinement procedure in terms of the number of marked and generated mesh elements.},
url = {https://hdl.handle.net/20.500.11811/11914}
}
The following license files are associated with this item:
