Adaptive Spectral Galerkin Methods with Dynamic Marking
| Authors |
|
|---|---|
| Publication date | 2016 |
| Journal | SIAM journal on numerical analysis |
| Volume | Issue number | 54 | 6 |
| Pages (from-to) | 3193–3213 |
| Organisations |
|
| Abstract |
The convergence and optimality theory of adaptive Galerkin methods is almost exclusively based on the Dörfler marking. This entails a fixed parameter and leads to a contraction constant bounded below away from zero. For spectral Galerkin methods this is a severe limitation which affects performance. We present a dynamic marking strategy that allows for a superlinear relation between consecutive discretization errors, and show exponential convergence with linear computational complexity whenever the solution belongs to a Gevrey approximation class. |
| Document type | Article |
| Note | © 2016, Society for Industrial and Applied Mathematics |
| Language | English |
| Published at | https://doi.org/10.1137/15M104579X |
| Downloads |
Stevenson_Canuto_etal_SIAM JonNumAnalysis_54-6_2016
(Final published version)
|
| Permalink to this page | |
