pith. sign in

arxiv: 1903.10409 · v2 · pith:4XI2XBU7new · submitted 2019-03-25 · 🧮 math.NA

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

classification 🧮 math.NA
keywords adaptiveerrorestimatorfractionallaplacianresidualalgorithmconvergence
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.