For the Poisson problem in two dimensions, we consider the standard adaptive finite element loop solve, estimate, mark, refine, with estimate being implemented using the p-robust equilibrated flux estimator, and, mark being Dörfler marking. As a refinement strategy we employ p-refinement. We investigate the question by which amount the local polynomial degree on any marked patch has to be incremented in order to achieve a p-independent error reduction. We show that the analysis can be transferred from the patches to a reference triangle, and therein we provide clear-cut computational evidence that any increment proportional to the polynomial degree (for any fixed proportionality constant) yields the desired reduction. The resulting adaptive method can be turned into an instance optimal hp-adaptive method by the addition of a coarsening routine.
On p-robust saturation for hp-AFEM
CANUTO, CLAUDIO;Nochetto, Ricardo H.;Verani, Marco
2017-01-01
Abstract
For the Poisson problem in two dimensions, we consider the standard adaptive finite element loop solve, estimate, mark, refine, with estimate being implemented using the p-robust equilibrated flux estimator, and, mark being Dörfler marking. As a refinement strategy we employ p-refinement. We investigate the question by which amount the local polynomial degree on any marked patch has to be incremented in order to achieve a p-independent error reduction. We show that the analysis can be transferred from the patches to a reference triangle, and therein we provide clear-cut computational evidence that any increment proportional to the polynomial degree (for any fixed proportionality constant) yields the desired reduction. The resulting adaptive method can be turned into an instance optimal hp-adaptive method by the addition of a coarsening routine.File | Dimensione | Formato | |
---|---|---|---|
2017-Canuto-Nochetto-Stevenson-Verani-CAMWA.pdf
Accesso riservato
:
Publisher’s version
Dimensione
463.27 kB
Formato
Adobe PDF
|
463.27 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.