Adaptive Mesh Refinement for arbitrary initial Triangulations
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913564441182208 |
|---|---|
| author | Diening, Lars Gehring, Lukas Storn, Johannes |
| author_facet | Diening, Lars Gehring, Lukas Storn, Johannes |
| contents | We introduce a simple initialization of the Maubach bisection routine for adaptive mesh refinement which applies to any conforming initial triangulation and terminates in linear time with respect to the number of initial vertices. We show that Maubach's routine with this initialization generates meshes that preserve shape regularity and satisfy the closure estimate needed for optimal convergence of adaptive schemes. Our ansatz allows for the intrinsic use of existing implementations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_02674 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Adaptive Mesh Refinement for arbitrary initial Triangulations Diening, Lars Gehring, Lukas Storn, Johannes Numerical Analysis 65N50, 65Y20 We introduce a simple initialization of the Maubach bisection routine for adaptive mesh refinement which applies to any conforming initial triangulation and terminates in linear time with respect to the number of initial vertices. We show that Maubach's routine with this initialization generates meshes that preserve shape regularity and satisfy the closure estimate needed for optimal convergence of adaptive schemes. Our ansatz allows for the intrinsic use of existing implementations. |
| title | Adaptive Mesh Refinement for arbitrary initial Triangulations |
| topic | Numerical Analysis 65N50, 65Y20 |
| url | https://arxiv.org/abs/2306.02674 |