Optimal convergence rates of an adaptive finite element method for unbounded domains
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908647906344960 |
|---|---|
| author | Chaumont-Frelet, Théophile Gantner, Gregor |
| author_facet | Chaumont-Frelet, Théophile Gantner, Gregor |
| contents | We consider linear reaction-diffusion equations posed on unbounded domains, and discretized by adaptive Lagrange finite elements. To obtain finite-dimensional spaces, it is necessary to introduce a truncation boundary, whereby only a bounded computational subdomain is meshed, leading to an approximation of the solution by zero in the remainder of the domain. We propose a residual-based error estimator that accounts for both the standard discretization error as well as the effect of the truncation boundary. This estimator is shown to be reliable and efficient under appropriate assumptions on the triangulation. Based on this estimator, we devise an adaptive algorithm that automatically refines the mesh and pushes the truncation boundary towards infinity. We prove that this algorithm converges and even achieves optimal rates in terms of the number of degrees of freedom. We finally provide numerical examples illustrating our key theoretical findings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_09145 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimal convergence rates of an adaptive finite element method for unbounded domains Chaumont-Frelet, Théophile Gantner, Gregor Numerical Analysis 65N12, 65N30, 65N50 We consider linear reaction-diffusion equations posed on unbounded domains, and discretized by adaptive Lagrange finite elements. To obtain finite-dimensional spaces, it is necessary to introduce a truncation boundary, whereby only a bounded computational subdomain is meshed, leading to an approximation of the solution by zero in the remainder of the domain. We propose a residual-based error estimator that accounts for both the standard discretization error as well as the effect of the truncation boundary. This estimator is shown to be reliable and efficient under appropriate assumptions on the triangulation. Based on this estimator, we devise an adaptive algorithm that automatically refines the mesh and pushes the truncation boundary towards infinity. We prove that this algorithm converges and even achieves optimal rates in terms of the number of degrees of freedom. We finally provide numerical examples illustrating our key theoretical findings. |
| title | Optimal convergence rates of an adaptive finite element method for unbounded domains |
| topic | Numerical Analysis 65N12, 65N30, 65N50 |
| url | https://arxiv.org/abs/2511.09145 |