Error Estimates and Graded Mesh Refinement for Isogeometric Analysis on Polar Domains with Corners
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916737511849984 |
|---|---|
| author | Apel, Thomas Zilk, Philipp |
| author_facet | Apel, Thomas Zilk, Philipp |
| contents | Isogeometric analysis (IGA) enables exact representations of computational geometries and higher-order approximation of PDEs. In non-smooth domains, however, singularities near corners limit the effectiveness of IGA, since standard methods typically fail to achieve optimal convergence rates. These constraints can be addressed through local mesh refinement, but existing approaches require breaking the tensor-product structure of splines, which leads to increased implementation complexity.
This work introduces a novel local refinement strategy based on a polar parameterization, in which one edge of the parametric square is collapsed into the corner. By grading the standard mesh toward the collapsing edge, the desired locality near the singularity is obtained while maintaining the tensor-product structure. A mathematical analysis and numerical tests show that the resulting isogeometric approximation achieves optimal convergence rates with suitable grading parameters.
Polar parameterizations, however, suffer from a lack of regularity at the polar point, making existing standard isogeometric approximation theory inapplicable. To address this, a new framework is developed for deriving error estimates on polar domains with corners. This involves the construction of polar function spaces on the parametric domain and a modified projection operator onto the space of $C^0$-smooth polar splines. The theoretical results are verified by numerical experiments confirming both the accuracy and efficiency of the proposed approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_10095 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Error Estimates and Graded Mesh Refinement for Isogeometric Analysis on Polar Domains with Corners Apel, Thomas Zilk, Philipp Numerical Analysis 65N30, 65N50, 65N25, 65D07, 35A21 Isogeometric analysis (IGA) enables exact representations of computational geometries and higher-order approximation of PDEs. In non-smooth domains, however, singularities near corners limit the effectiveness of IGA, since standard methods typically fail to achieve optimal convergence rates. These constraints can be addressed through local mesh refinement, but existing approaches require breaking the tensor-product structure of splines, which leads to increased implementation complexity. This work introduces a novel local refinement strategy based on a polar parameterization, in which one edge of the parametric square is collapsed into the corner. By grading the standard mesh toward the collapsing edge, the desired locality near the singularity is obtained while maintaining the tensor-product structure. A mathematical analysis and numerical tests show that the resulting isogeometric approximation achieves optimal convergence rates with suitable grading parameters. Polar parameterizations, however, suffer from a lack of regularity at the polar point, making existing standard isogeometric approximation theory inapplicable. To address this, a new framework is developed for deriving error estimates on polar domains with corners. This involves the construction of polar function spaces on the parametric domain and a modified projection operator onto the space of $C^0$-smooth polar splines. The theoretical results are verified by numerical experiments confirming both the accuracy and efficiency of the proposed approach. |
| title | Error Estimates and Graded Mesh Refinement for Isogeometric Analysis on Polar Domains with Corners |
| topic | Numerical Analysis 65N30, 65N50, 65N25, 65D07, 35A21 |
| url | https://arxiv.org/abs/2505.10095 |