Adaptive Mesh Refinement for Arbitrary Initial Triangulations.
Saved in:
| Title: | Adaptive Mesh Refinement for Arbitrary Initial Triangulations. |
|---|---|
| Authors: | Diening, Lars1 (AUTHOR) lars.diening@uni-bielefeld.de, Gehring, Lukas2 (AUTHOR) lukas.gehring@uni-jena.de, Storn, Johannes3 (AUTHOR) johannes.storn@uni-leipzig.de |
| Source: | Foundations of Computational Mathematics. Jun2026, Vol. 26 Issue 3, p1193-1218. 26p. |
| Subjects: | Numerical grid generation (Numerical analysis) |
| Abstract: | 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 always terminates and 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Foundations of Computational Mathematics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | 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 always terminates and 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. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 16153375 |
| DOI: | 10.1007/s10208-025-09698-7 |
