Quasi-optimal convergence rate for an adaptive method for the integral fractional Laplacian
Faustmann, Markus ; Melenk, Jens Markus ; Praetorius, Dirk
arXiv, Tome 2019 (2019) no. 0, / Harvested from
For the discretization of the integral fractional Laplacian $(-\Delta)^s$, $0 < s < 1$, based on piecewise linear functions, we present and analyze a reliable weighted residual a posteriori error estimator. In order to compensate for a lack of $L^2$-regularity of the residual in the regime $3/4 < s < 1$, this weighted residual error estimator includes as an additional weight a power of the distance from the mesh skeleton. We prove optimal convergence rates for an $h$-adaptive algorithm driven by this error estimator. Key to the analysis of the adaptive algorithm are local inverse estimates for the fractional Laplacian.
Publié le : 2019-03-25
Classification:  Mathematics - Numerical Analysis
@article{1903.10409,
     author = {Faustmann, Markus and Melenk, Jens Markus and Praetorius, Dirk},
     title = {Quasi-optimal convergence rate for an adaptive method for the integral
  fractional Laplacian},
     journal = {arXiv},
     volume = {2019},
     number = {0},
     year = {2019},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1903.10409}
}
Faustmann, Markus; Melenk, Jens Markus; Praetorius, Dirk. Quasi-optimal convergence rate for an adaptive method for the integral
  fractional Laplacian. arXiv, Tome 2019 (2019) no. 0, . http://gdmltest.u-ga.fr/item/1903.10409/