Goal-oriented adaptive finite element methods with optimal computational complexity
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929206848389120 |
|---|---|
| author | Becker, Roland Gantner, Gregor Innerberger, Michael Praetorius, Dirk |
| author_facet | Becker, Roland Gantner, Gregor Innerberger, Michael Praetorius, Dirk |
| contents | We consider a linear symmetric and elliptic PDE and a linear goal functional. We design and analyze a goal-oriented adaptive finite element method, which steers the adaptive mesh-refinement as well as the approximate solution of the arising linear systems by means of a contractive iterative solver like the optimally preconditioned conjugate gradient method or geometric multigrid. We prove linear convergence of the proposed adaptive algorithm with optimal algebraic rates. Unlike prior work, we do not only consider rates with respect to the number of degrees of freedom but even prove optimal complexity, i.e., optimal convergence rates with respect to the total computational cost. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2101_11407 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Goal-oriented adaptive finite element methods with optimal computational complexity Becker, Roland Gantner, Gregor Innerberger, Michael Praetorius, Dirk Numerical Analysis We consider a linear symmetric and elliptic PDE and a linear goal functional. We design and analyze a goal-oriented adaptive finite element method, which steers the adaptive mesh-refinement as well as the approximate solution of the arising linear systems by means of a contractive iterative solver like the optimally preconditioned conjugate gradient method or geometric multigrid. We prove linear convergence of the proposed adaptive algorithm with optimal algebraic rates. Unlike prior work, we do not only consider rates with respect to the number of degrees of freedom but even prove optimal complexity, i.e., optimal convergence rates with respect to the total computational cost. |
| title | Goal-oriented adaptive finite element methods with optimal computational complexity |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2101.11407 |