Analysis-suitable adaptive T-mesh refinement with linear complexity

dc.contributor.author	Morgenstern, Philipp
dc.contributor.author	Peterseim, Daniel
dc.date.accessioned	2024-08-21T13:11:07Z
dc.date.available	2024-08-21T13:11:07Z
dc.date.issued	07.2014
dc.identifier.uri	https://hdl.handle.net/20.500.11811/11914
dc.description.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.	en
dc.format.extent	26
dc.language.iso	eng
dc.relation.ispartofseries	INS Preprints ; 1409
dc.rights	In Copyright
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/
dc.subject	Isogeometric Analysis
dc.subject	T-Splines
dc.subject	Analysis-Suitability
dc.subject	Nestedness
dc.subject	Adaptive mesh refinement
dc.subject.ddc	510 Mathematik
dc.subject.ddc	518 Numerische Analysis
dc.title	Analysis-suitable adaptive T-mesh refinement with linear complexity
dc.type	Preprint
dc.publisher.name	Institut für Numerische Simulation (INS)
dc.publisher.location	Bonn
dc.rights.accessRights	openAccess
dc.relation.doi	https://doi.org/10.1016/j.cagd.2015.02.003
ulbbn.pubtype	Zweitveröffentlichung
dcterms.bibliographicCitation.url	https://ins.uni-bonn.de/publication/preprints

Die folgenden Nutzungsbestimmungen sind mit dieser Ressource verbunden: