Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.18800 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929331481083904 |
|---|---|
| author | Avancini, Giovane Shauer, Nathan Orlandini, Francisco T. Lucci, Paulo Cesar A. Devloo, Philippe R. B. |
| author_facet | Avancini, Giovane Shauer, Nathan Orlandini, Francisco T. Lucci, Paulo Cesar A. Devloo, Philippe R. B. |
| contents | This contribution introduces the idea of refinement patterns for the generation of optimal meshes in the context of the Finite Element Method. The main idea is to generate a library of possible patterns on which elements can be refined and use this library to inform an h adaptive code on how to handle complex refinements in regions of interest. There are no restrictions on the type of elements that can be refined, and the patterns can be generated for any element type. The main advantage of this approach is that it allows for the generation of optimal meshes in a systematic way where, even if a certain pattern is not available, it can easily be included through a simple text file with nodes and sub-elements. The contribution presents a detailed methodology for incorporating refinement patterns into h adaptive Finite Element Method codes and demonstrates the effectiveness of the approach through mesh refinement of problems with complex geometries. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_18800 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Extending h adaptivity with refinement patterns Avancini, Giovane Shauer, Nathan Orlandini, Francisco T. Lucci, Paulo Cesar A. Devloo, Philippe R. B. Numerical Analysis This contribution introduces the idea of refinement patterns for the generation of optimal meshes in the context of the Finite Element Method. The main idea is to generate a library of possible patterns on which elements can be refined and use this library to inform an h adaptive code on how to handle complex refinements in regions of interest. There are no restrictions on the type of elements that can be refined, and the patterns can be generated for any element type. The main advantage of this approach is that it allows for the generation of optimal meshes in a systematic way where, even if a certain pattern is not available, it can easily be included through a simple text file with nodes and sub-elements. The contribution presents a detailed methodology for incorporating refinement patterns into h adaptive Finite Element Method codes and demonstrates the effectiveness of the approach through mesh refinement of problems with complex geometries. |
| title | Extending h adaptivity with refinement patterns |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2404.18800 |