arXiv Analytics

Sign in

arXiv:1903.10409 [math.NA]AbstractReferencesReviewsResources

Quasi-optimal convergence rate for an adaptive method for the integral fractional Laplacian

Markus Faustmann, Jens Markus Melenk, Dirk Praetorius

Published 2019-03-25Version 1

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.

Related articles: Most relevant | Search more
arXiv:2209.13366 [math.NA] (Published 2022-09-27)
Two-level error estimation for the integral fractional Laplacian
arXiv:math/9905003 [math.NA] (Published 1999-05-02)
A novel methodology of weighted residual for nonlinear computations
arXiv:1806.08048 [math.NA] (Published 2018-06-21)
Weighted Sobolev regularity and rate of approximation of the obstacle problem for the integral fractional Laplacian