Rate-optimal higher-order adaptive conforming FEM for biharmonic eigenvalue problems on polygonal domains
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911803454259200 |
|---|---|
| author | Carstensen, Carsten Gräßle, Benedikt |
| author_facet | Carstensen, Carsten Gräßle, Benedikt |
| contents | The a posteriori error analysis of the classical Argyris finite element methods dates back to 1996, while the optimal convergence rates of associated adaptive finite element schemes are established only very recently in 2021. It took a long time to realise the necessity of an extension of the classical finite element spaces to make them hierarchical. This paper establishes the novel adaptive schemes for the biharmonic eigenvalue problems and provides a mathematical proof of optimal convergence rates towards a simple eigenvalue and numerical evidence thereof. This makes the suggested algorithm highly competitive and clearly justifies the higher computational and implementational costs compared to low-order nonconforming schemes. The numerical experiments provide overwhelming evidence that higher polynomial degrees pay off with higher convergence rates and underline that adaptive mesh-refining is mandatory. Five computational benchmarks display accurate reference eigenvalues up to 30 digits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_12577 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Rate-optimal higher-order adaptive conforming FEM for biharmonic eigenvalue problems on polygonal domains Carstensen, Carsten Gräßle, Benedikt Numerical Analysis 65N12, 65N30, 65Y20 The a posteriori error analysis of the classical Argyris finite element methods dates back to 1996, while the optimal convergence rates of associated adaptive finite element schemes are established only very recently in 2021. It took a long time to realise the necessity of an extension of the classical finite element spaces to make them hierarchical. This paper establishes the novel adaptive schemes for the biharmonic eigenvalue problems and provides a mathematical proof of optimal convergence rates towards a simple eigenvalue and numerical evidence thereof. This makes the suggested algorithm highly competitive and clearly justifies the higher computational and implementational costs compared to low-order nonconforming schemes. The numerical experiments provide overwhelming evidence that higher polynomial degrees pay off with higher convergence rates and underline that adaptive mesh-refining is mandatory. Five computational benchmarks display accurate reference eigenvalues up to 30 digits. |
| title | Rate-optimal higher-order adaptive conforming FEM for biharmonic eigenvalue problems on polygonal domains |
| topic | Numerical Analysis 65N12, 65N30, 65Y20 |
| url | https://arxiv.org/abs/2403.12577 |