Volltext-Downloads (blau) und Frontdoor-Views (grau)

Curved Domain Adaptive Mesh Refinement with Hexahedra

  • In tree-based adaptive mesh refinement (AMR) we store refinement trees in the cells of an unstructured coarse mesh. This lets us combine the speed and simpler management of structured refinement trees with the more flexible mesh generation of the unstructured coarse mesh. But this creates a conflict between performance and geometrical accuracy. If we favor speed we reduce the cells in our coarse mesh and hence reduce the accuracy of our geometrical representation. If we want more accurate results we generate a finer coarse mesh and lose performance by managing more cells in our unstructured coarse mesh. To mitigate this conflict we present the prototype of an geometry description which we implement in an already existing library. With this description we build geometry adapted hexahedral refinement trees, which also support high-order curved boundary cells. We also present examples on how to use this description. Moreover, we test the speedup of this new algorithm compared with coarse meshes with different geometrical errors.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Check availability

Statistics

Show usage statistics
Metadaten
Document Type:Study Thesis
Language:English
Author:Sandro Elsweijer
Pagenumber:18
URL:https://elib.dlr.de/143537/
Referee:Dirk Reith
Advisor:Jan Kleinert, Johannes Holke
Publisher:Deutsches Zentrum für Luft- und Raumfahrt e.V. (DLR)
Place of publication:Köln
Date of first publication:2021/07/19
Keyword:Adaptive mesh refinement; Geometry; High-performance computing; Software; h-refinement; high order; p-refinement
Dewey Decimal Classification (DDC):6 Technik, Medizin, angewandte Wissenschaften / 62 Ingenieurwissenschaften / 620 Ingenieurwissenschaften und zugeordnete Tätigkeiten
Theses, student research papers:Fachbereich / Elektrotechnik, Maschinenbau, Technikjournalismus
Entry in this database:2021/09/11