Quasi-optimal convergence rate for an adaptive method for the integral fractional Laplacian
Markus Faustmann, Jens Markus Melenk, Dirk Praetorius

TL;DR
This paper develops and analyzes an adaptive finite element method with a novel weighted residual error estimator for the integral fractional Laplacian, achieving quasi-optimal convergence rates even in challenging regularity regimes.
Contribution
It introduces a weighted residual a posteriori error estimator for the fractional Laplacian and proves its effectiveness in driving an adaptive algorithm with optimal convergence rates.
Findings
The error estimator is reliable and effective for $0<s<1$.
The adaptive algorithm achieves quasi-optimal convergence rates.
The analysis includes new local inverse estimates for the fractional Laplacian.
Abstract
For the discretization of the integral fractional Laplacian , , 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 -regularity of the residual in the regime , 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 -adaptive algorithm driven by this error estimator. Key to the analysis of the adaptive algorithm are local inverse estimates for the fractional Laplacian.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Quasi-optimal convergence rate for an adaptive method for the integral fractional Laplacian
**Markus Faustmann, Jens Markus Melenk, Dirk Praetorius
**Institute for Analysis and Scientific Computing
TU Wien
Wiedner Hauptstr. 8-10, 1040 Wien, Austria
[email protected], [email protected], [email protected]
Abstract
For the discretization of the integral fractional Laplacian , , 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 -regularity of the residual in the regime , 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 -adaptive algorithm driven by this error estimator. Key to the analysis of the adaptive algorithm are local inverse estimates for the fractional Laplacian.
††Acknowledgement. The research of JMM and DP is funded by the Austrian Science Fund (FWF) by the special research program Taming complexity in PDE systems (grant SFB F65). Additionally, DP acknowledges support through the FWF research project Optimal adaptivity for BEM and FEM-BEM coupling (grant P27005).
1 Introduction
Fractional differential operators such as the fractional Laplacian , , are an increasingly important modeling tool in, e.g., physics, finance, or image processing. In contrast to classical (integer order) differential operators, these fractional operators are nonlocal, which makes both the analysis and the analysis of numerical methods challenging.
The numerical treatment of such non-local operators is currently a very active research field. A variety of approaches for the different versions of the fractional Laplacian in multi-d, or, more generally, fractional powers of differential operators are available: we mention Galerkin/finite element methods (FEMs) (see, e.g., [NOS15, AB17, ABH18, BMN*+*19] and references therein), techniques that exploit the connection of the fractional Laplacian with semigroup theory, [BP15, BP17], and techniques that rely on the connection with eigenfunction expansions, [SXK17, AG18]; for more details, we refer the reader to the recent surveys [BBN*+*18, LPG*+*18]. The vast majority of the numerical analysis literature focuses on a priori error analyses, and few results on a posteriori error analysis are available in spite of the fact that solutions to fractional differential equations typically have singularities (even for smooth input data), which naturally calls for using locally refined meshes; work on a posteriori error estimation in a Galerkin setting includes [NvPZ10, CNOS15, AG17, BBN*+*18, CNOS15] and on gradient recovery [ZHCK17]. One challenge in devising a posteriori error estimators are poor properties of the residual, namely, it is not necessarily in . One can overcome this lack of -regularity by measuring the residual in appropriate -spaces, [NvPZ10, BBN*+*18] (some restrictions on apply); an alternative route, which is taken in the present work, is to measure the residual in weighted -spaces, where the weight is given by a power of the distance from the mesh skeleton. The resulting a posteriori error estimator is shown to be reliable in Theorem 2.3 in the full range . This a posteriori error estimator is a basic building block of the adaptive Algorithm 2.5 that we analyze. We show in Theorem 2.6 that it yields a sequence of approximations that converge at the optimal algebraic rate (with respect to an appropriate nonlinear approximation class). Such an optimal convergence result is well-known for adaptive FEMs for linear second-order elliptic equations (see, e.g., [BDD04, Ste07, CKNS08, FFP14]) or the classical BEM (see [Gan13, FKMP13, FFK*+*14, FFK*+*15]), and the present work extends these results to the integral fractional Laplacian. Our convergence result is obtained using the abstract, general framework of [CFPP14] for proving such optimal convergence results, which reduces the proof of optimal algebraic convergence to verifying four properties ((A1))—((A4)) of the error estimator (cf. Proposition 3.1). A key ingredient to establish the properties (A1)—(A4) in the case of the BEM are local inverse estimates for the nonlocal boundary integral operators, [Gan13, FKMP13, AFF*+*17]. Also in the present case of the fractional Laplacian underlying our analysis is the inverse estimate
[TABLE]
where is a piecewise polynomial and is the local mesh width function (modified by some additional weight function for ; cf. (2.13)), and is essentially sufficient for proving optimal convergence of the adaptive algorithm. In this work, such an inverse estimate for the nonlocal fractional Laplacian is provided in Theorem 2.7. We highlight that such an inverse estimate proves useful in other applications such as the analysis of multilevel preconditioning for the fractional Laplacian on locally refined meshes.
The present paper is structured as follows: In Section 2, we provide the continuous model problem and its Galerkin discretization by piecewise linears. Moreover, both the classical weighted residual a posteriori error indicators (for ) and our modified weighted error estimator (for ) are presented. The adaptive algorithm, the optimal convergence of the algorithm, as well as the inverse inequality, which plays the key role in our proofs, are stated. In Section 3, the four essential properties (A1)—(A4) of the error estimator from [CFPP14] are recalled and verified with the aid of the inverse inequality. The inverse inequality is then proved in Section 4. Finally, Section 5 provides numerical examples that illustrate the optimal convergence of the proposed adaptive method.
Concerning notation: For bounded, open sets integer order Sobolev spaces , , are defined in the usual way. For , fractional Sobolev spaces are given in terms of the seminorm and the full norm by
[TABLE]
where we denote the Euclidean distance in by . Moreover, for bounded Lipschitz domains , we define the spaces
[TABLE]
of -functions with zero extension, equipped with the norm
[TABLE]
where is the distance of a point to the boundary .
2 Main Results
2.1 The fractional Laplacian and the Caffarelli-Silvestre extension
There are several different ways to define the fractional Laplacian . A classical definition on the full space is in terms of the Fourier transformation , i.e., . A consequence of this definition is the mapping property, (see, e.g., [BBN*+*18])
[TABLE]
where the Sobolev spaces , , are defined in terms of the Fourier transformation, [McL00, (3.21)]. Alternative, equivalent definitions of exist, e.g., via semi-group or operator theory, [Kwa17]. For our purposes, a convenient representation of the fractional Laplacian is as the principal value integral
[TABLE]
where denotes the Gamma function. An important observation made in [CS07] is that the fractional Laplacian can be understood as a Dirichlet-to-Neumann operator of a degenerate elliptic PDE, the so-called extension problem on a half space. In order to describe this degenerated elliptic PDE, we need weighted Sobolev spaces. For
[TABLE]
and measurable subsets , we define the weighted -norm
[TABLE]
and denote by the space of square-integrable functions with respect to the weight . The Caffarelli-Silvestre extension is conveniently described in terms of the Beppo-Levi space . Elements of are in fact in and one can give meaning to their trace at , which is denoted . Recalling , one has in fact (see, e.g., [MK18]). The extension problem by Caffarelli-Silvestre [CS07] reads as follows: For and , let solve
[TABLE]
Then, the fractional Laplacian can be recovered as the Neumann data of the extension problem in the sense of distributions, [CS14, Thm. 3.1]:
[TABLE]
Remark 2.1**.**
*For , the extension given by (2.4) can also be characterized as . *
2.2 The model problem
For a bounded Lipschitz domain , we consider the problem
[TABLE]
where is a given right-hand side. The fractional Laplacian is defined by formula (2.2) for . The weak formulation of (2.6) reads as follows [Kwa17, Thm. 1.1 (e),(g)]: Find such that
[TABLE]
Existence and uniqueness of follow from the Lax–Milgram lemma.
2.3 Discretization
Henceforth, we assume to be polyhedral111This is not essential but allows us to work with affine elements.. Let be a regular (in the sense of Ciarlet) triangulation of consisting of open simplices that is -shape regular in the sense of \max_{T\in\mathcal{T}_{\ell}}\big{(}\operatorname*{diam}(T)/|T|^{1/d}\big{)}\leq\gamma<\infty. Here, denotes the Euclidean diameter of , whereas is the -dimensional Lebesgue volume. To ease notation, we define the piecewise constant mesh size function by
[TABLE]
Moreover, for all elements , we define the element patch
[TABLE]
consists of and all of its neighbors. \Omega_{\ell}^{k}(T):={\rm interior}\big{(}\bigcup\big{\{}T^{\prime}\in\mathcal{T}_{\ell}\,:\,\overline{T^{\prime}}\cap\overline{\Omega_{\ell}^{k-1}(T)}\neq\emptyset\big{\}}\big{)} is the -th order patch of (and ). Later on, the index indicates the step of an adaptive algorithm, where the triangulations are obtained by local mesh refinement based on newest vertex bisection (NVB). We refer, e.g., to [KPP13] for the NVB algorithm in or to [Ste08] for .
For , let denote the space of all affine functions on . We define spaces of -piecewise affine and globally continuous functions
[TABLE]
For the discretization of (2.7), we consider the Galerkin method based on . The Lax–Milgram lemma provides existence and uniqueness of such that
[TABLE]
Throughout the present work, we will need a weight function that measures the distance from the mesh skeleton: For a mesh we introduce
[TABLE]
2.4 A posteriori error estimation
Let . For , due to the mapping properties of the fractional Laplacian given in (2.1), we have . For , the function is (generically) no longer in as it has singularities at the mesh skeleton. Its blow-up can be measured in terms of the distance from the mesh skeleton as has been noticed in [BBN*+*18] and is made precise in the following lemma, which is proved in Section 4 below.
Lemma 2.2**.**
*Let be given by (2.12). Given , fix , e.g., . For any , we then have . *
To control the discretization error of (2.11), we study the weighted residual error estimator
[TABLE]
Since the -norm is local, the error estimator can be written as a sum of local contributions
[TABLE]
If is the solution of (2.11), we abbreviate as well as for all .
Theorem 2.3**.**
For , the weighted residual error estimator (2.13) is reliable:
[TABLE]
Moreover, for with and , the estimator is efficient in the sense that
[TABLE]
The constants depend only on , , , and the -shape regularity of .
Remark 2.4**.**
*The efficiency result (2.16) is weaker than classical efficiency, where the sum on the right-hand side does not appear. However, as this term scales with the correct powers of the mesh width, there is not a large gap between (2.16) and classical efficiency, as for discrete functions the right-hand side of (2.16) can be bounded by the energy norm with an inverse estimate. *
2.5 Adaptive mesh refinement
Based on the local contributions of the weighted residual error estimator (2.13), we consider the following standard approach for adaptive mesh refinement of the type SOLVE – ESTIMATE – MARK – REFINE, where the Dörfler criterion (2.17) from [Dör96] is used to select elements for refinement.
Algorithm 2.5**.**
*Input: Initial triangulation , adaptivity parameters , .
For all , iterate the following steps (i)–(iv):*
- (i)
Compute the solution of (2.11). 2. (ii)
Compute refinement indicators from (2.14) for all . 3. (iii)
Determine a set of, up to the multiplicative factor , minimal cardinality such that
[TABLE] 4. (iv)
Generate the coarsest NVB refinement of such that all marked elements have been bisected.
Analogous to the works [Ste07, CKNS08, FFP14, CFPP14] for FEM and BEM, the following Theorem 2.6 states linear convergence (2.18) of Algorithm 2.5 with optimal algebraic convergence rates (2.19).
Theorem 2.6**.**
Let and . Then, there exist constants and such that the sequence generated by Algorithm 2.5 satisfies
[TABLE]
Moreover, if is sufficiently small and , and if the initial triangulation satisfies the admissibility condition [Ste08, Section 4] for , then the error estimator converges with the best possible algebraic rate: For each , there exist , such that
[TABLE]
where is the (infinite) set of all NVB refinements of the initial triangulation and is the weighted residual error estimator corresponding to the triangulation .
2.6 Inverse estimates for the nonlocal operator
A key piece in the axiomatic approach of [CFPP14], which generalizes ideas and techniques developed in [FKMP13, Gan13, FFK*+*14, FFK*+*15] for the convergence analysis of adaptive algorithms involving nonlocal operators, are inverse inequalities for the pertinent operators. The following Theorem 2.7 establishes this inverse estimate for the fractional Laplacian. We mention that the case for the fractional Laplacian is closely related to the hyper-singular integral operator in the BEM [Gan13, FFK*+*15], for which the appropriate inverse estimate is established in [AFF*+*17].
Theorem 2.7**.**
- (i)
Let with . Then, there holds for
[TABLE] 2. (ii)
For and all , there holds
[TABLE]
The constant depends only on , , , and the -shape regularity of .
3 Proof of Theorem 2.3 and Theorem 2.6
3.1 Axioms of adaptivity
The following Proposition 3.1 yields validity of the axioms of adaptivity from [CFPP14], where we recall that the present conforming discretization guarantees that if the triangulation is a refinement of (i.e., is obtained from by finitely many steps of newest vertex bisection).
Proposition 3.1**.**
There exist constants , and depending solely on , , , and the -shape regularity of the initial triangulation such that the following properties ((A1))–((A4)) hold for any refinement of the initial triangulation and any refinement of :
- (A1)
**Stability: **For all and any , there holds
[TABLE] 2. (A2)
**Reduction: **For all , there holds
[TABLE] 3. (A3)
**Discrete reliability: **The Galerkin approximations and satisfy that
[TABLE] 4. (A4)
**Quasi-orthogonality: **For all , and , it holds that
[TABLE]
Proof of ((A4)).
The quasi-orthogonality follows directly from the fact that the bilinear form of the fractional Laplacian (2.7) is bilinear, elliptic, and symmetric; see [CFPP14, Section 3.6] for details. ∎
Proof of ((A1)).
Let \omega:=\operatorname*{interior}\big{(}\bigcup_{T\in\mathcal{U}_{\bullet}}\overline{T}\big{)}\subseteq\Omega. With Theorem 2.7, we obtain that
[TABLE]
This proves ((A1)) with . ∎
Proof of ((A2)).
Bisection ensures that for all and its children/descendants with . Note that . For , this proves ((A2)) with , since
[TABLE]
For , we note that and . Moreover, we have pointwise . Hence, it follows that
[TABLE]
Arguing as before, we prove ((A2)) with . This concludes the proof. ∎
The proof of discrete reliability ((A3)) relies on the Scott–Zhang projection [SZ90] for quasi-interpolation in . While the original work [SZ90] is concerned with the integer-order Sobolev space , the approach is generalized in [AFF*+*15] to fractional-order Sobolev spaces for . Since the precise construction will matter, we briefly sketch it: Let be the set of all nodes of and let be the set of nodes of , which lie inside (and not on the boundary ). For each element , let be the dual basis for the nodal basis of with respect to . these functions may be viewed as elements of by zero extension outside . For each choose an arbitrary element with . (This freedom will be exploited later on.) Let denote the hat function associated with . For the element , let be such that for all . Then, the Scott–Zhang projector is defined by
[TABLE]
Since the summation is over the interior nodes , we have . The following lemma collects some of its properties:
Lemma 3.2**.**
For , there holds for some constant depending only on and the -shape regularity of and :
- (i)
* as well as for all and all .* 2. (ii)
* for all .* 3. (iii)
* for all .* 4. (iv)
For each refinement of , the Scott-Zhang operator can be chosen such that additionally
[TABLE]
Proof.
(i)–(ii) are proved in [AFF*+*15, Lemma 4]. With replaced by , (iii) is proved in [FFK*+*15, Lemma 3.2], where the estimate
[TABLE]
is established for any as well. Hence, it only remains to prove (iii) for , where .
With being the reference element, let be the corresponding weight function. Let be an affine parametrization of . For each , let . Let with . Then,
[TABLE]
and consequently
[TABLE]
According to [Gri85, Thm. 1.4.4.3], we have for all , since . Let and . A scaling argument thus proves that
[TABLE]
Hence, by summation over all elements
[TABLE]
This concludes the proof of (iii).
We prove (iv). To ensure the additional property (3.1), we use the freedom still available in the definition of the Scott-Zhang operator . To that end, let be the nodes of the elements in . For each , select an element such is a node of ; for the remaining nodes , the element merely needs to be such that is a node of . This defines the Scott-Zhang operator . This particular choice ensures
[TABLE]
and (3.1) follows from (3.3). ∎
Proof of ((A3)).
Since is elliptic on , we have
[TABLE]
In particular, the Cauchy–Schwarz inequality and Lemma 3.2 (iv) show with
[TABLE]
[TABLE]
The combination of the last two estimates concludes the proof. ∎
3.2 Proof of Theorem 2.3
For reliability (2.15), we sketch the proof from [CFPP14, Section 3.3]. Let be a given triangulation. Recall that uniform refinement leads to convergence. Given , we may hence choose a refinement of such that . Therefore, the triangle inequality and ((A3)) prove that
[TABLE]
As , we prove (2.15).
To prove the weak efficiency (2.16), we employ the inverse estimates (2.21)–(2.22) from Theorem 2.7. Since with , this yields that
[TABLE]
First, Lemma 3.2 (i) guarantees that
[TABLE]
Next, we observe that with . Lemma 3.2 (ii) and an interpolation argument yield that
[TABLE]
Since newest vertex bisection is used to generate , only a finite number of shapes of patches can occur. In particular, the hidden constant in the last estimate does not depend on , but only on . This concludes the proof. ∎
3.3 Proof of Theorem 2.6
We note that reduction from [CFPP14] is a consequence of conformity and ((A1))–((A2)), since
[TABLE]
Therefore, Theorem 2.6 immediately follows from [CFPP14, Theorem 4.1].∎
4 Proof of Theorem 2.7
4.1 Proof of Lemma 2.2
For , we split the fractional Laplacian into a principal value part and a smoother, integrable part
[TABLE]
Using polar coordinates , , where is the -dimensional unit sphere, and exploiting that , we may compute the principal value part
[TABLE]
where the last equality follows from interchanging the integration in and . For the second part in the decomposition of in (4.1) a similar computation using the Lipschitz continuity of provides
[TABLE]
Since is square-integrable in view of , Lemma 2.2 follows. ∎
4.2 Proof of Theorem 2.7
As in [AFF*+*17], which provides inverse estimates for the classical boundary integral operators, the main idea of the proof of Theorem 2.7 is a splitting of the operator into a smoother far-field part and a localized near-field part. The near-field and the far-field are treated separately in the following subsections.
The proofs for both statements (2.21)–(2.22) are fairly similar and only differ in the use of the inverse inequality of Lemma 4.2 below.
Let . We start by a localization and a splitting into near-field and far-field. The -norm in the error estimator can be written as a sum over all elements
[TABLE]
For any constant , we have that , which implies .
Due to the nonlocality of the fractional Laplacian, we need to split the operator into two contributions, a localized near-field part and a smoother far-field part. To this end, we select, for each element , a cut-off function with the following properties: i) , where is the patch of defined in (2.9); ii) there is a set with and ; iii) in ; iv) as well as with constants , depending only on the -shape regularity of and .
Then, for each element , we have the splitting into the near-field and a far-field given by
[TABLE]
We choose
[TABLE]
If , we write , for the near-field and far-field to emphasize that the fields are related to discrete functions. For the near-field for with and , Lemma 4.2 below provides the estimate
[TABLE]
and for discrete and
[TABLE]
For any , Lemma 4.4 gives
[TABLE]
Combining (4.7), (4.9), we prove the inverse inequality (2.21); the estimate (2.22) is obtained from (4.8) and (4.9). ∎
4.2.1 The near-field
In this subsection, we treat the near-field . We start with a Poincaré inequality:
Lemma 4.1**.**
Let be given by (4.6) and . Then, for a constant depending solely on , , the -shape regularity of , and the fact that NVB is used, we have
[TABLE]
Proof.
If , then the Poincaré inequality (4.10) is shown in [AFF*+*17, Lemma 5.1] and [AB17]. For elements at the boundary, we have chosen . Due to the boundary condition satisfied by , we have the Poincaré inequality . To see this, one makes four observations: a) the power is obtained by scaling; b) implies that at least one face of lies on ; c) only finitely many shapes are possible for since the meshes are created by NVB; d) the Poincaré inequality for the patch scaled to size holds with constant by the compactness of the embedding of in . ∎
Lemma 4.2**.**
There is a constant depending only on , , , and the -shape regularity of such that the following holds:
- (i)
For with and , let the near-field be given by (4.4). Then,
[TABLE] 2. (ii)
For and arbitrary , the near-field satisfies that
[TABLE]
Proof.
Before proving this lemma, we point out that we will frequently use in sums the shorthand to mean that the summation is over all satisfying .
Proof of (i): The mapping properties (2.1) of the fractional Laplacian as a pseudo-differential operator of order as well as the additional assumption imply
[TABLE]
where the last inequality follows from a Hardy inequality that is valid provided that , see, e.g., [Gri85, Thm. 1.4.4.4].
For , we have the local -norm on the right-hand side of (4.11), and we can directly estimate this by . We note that this case coincides with the result for the hypersingular integral operator in the boundary element method, [AFF*+*17].
The -norm is nonlocal for , but it has a localized upper-bound, cf. [Fae00, Fae02],
[TABLE]
Step 1: (Estimate of ) As , the last term sums up to a -norm on the patch . Since the size of neighboring elements differ only by a constant multiplicative factor, we can estimate for all . The Poincaré inequality on the patch given in Lemma 4.1 then gives
[TABLE]
Step 2: (Estimate of ) To estimate , we use that . Therefore, only elements appear. With a hidden constant depending on the -shape regularity of , this leads to
[TABLE]
The first term is just the -seminorm so that we may concentrate on the second term. Since , the denominator in the second integrand can be directly estimated by powers of . For arbitrary , this immediately leads to
[TABLE]
After summation over , the desired estimate follows from the Poincaré inequality of Lemma 4.1.
Step 3: (Estimate of ) Since the integrand vanishes if , we may split the sum as in Step 2 into a smooth part and a part defined on the patch , i.e.,
[TABLE]
Using the Lipschitz continuity of , we obtain
[TABLE]
Since we assume , a direct calculation reveals
[TABLE]
so that can be estimate in the required way. To estimate one uses again the Lipschitz continuity of , the observation , as well as a Poincaré inequality of Lemma 4.1 so that can be estimated using the same arguments as in (4.2.1). Putting the estimates for , , and into (4.12) and summing over all elements using the -shape regularity of , we obtain
[TABLE]
Proof of (ii) in the case : For and we have the classical inverse estimate (e.g., [SS11, Thm. 4.4.2])
[TABLE]
Hence, for and a , we may directly combine the result of (i) with the inverse estimate (4.17) to get the desired estimate. To obtain the case , we note that in the above proof of (i), the assumption entered only through the estimate (4.12). However, the bound is still valid for .
Proof of (ii) in the case : Here, we cannot use the mapping properties of the fractional Laplacian since may not be in for . However, we can directly estimate the fractional Laplacian using that due to the function vanishes at infinity, which does not hold for the case . We write
[TABLE]
The definition of the fractional Laplace leads to
[TABLE]
We treat the integrals , on the right-hand side separately, starting with . We split the integral further into two parts, a principal value integral containing the singularity and a smoother, integrable part:
[TABLE]
In fact, . To see this, we use that, for , , we have , where is constant. Using polar coordinates, the principal value integral can be computed and is equal to zero as in (4.1). To bound we note that our assumption implies that vanishes at infinity. With the Lipschitz continuity of , we estimate as in (4.1) as
[TABLE]
where the last two estimates follow from a direct computation of the integral over the distance function and an inverse inequality, where we used that the ratio of neighboring elements is bounded by a constant.
It remains to estimate in (4.2.1), which is similar to the integral above. Since on , we get
[TABLE]
Using the Lipschitz continuity of , polar coordinates, and the Poincaré inequality, we therefore may estimate as in (4.2.1)
[TABLE]
Putting the bounds for and together and summing over all elements, leads to the claimed inverse estimate. ∎
4.2.2 The far-field
In order to treat the far-field part in the proof of the inverse estimate of Theorem 2.7, we utilize the interpretation of the fractional Laplacian as the Dirichlet-to-Neumann map for the extension problem (2.4). This leads us to the problem of controlling second derivatives of the solution to the extension problem. This is done in the following Lemma 4.3, which is proved with the techniques of tangential difference quotients, typical for elliptic PDEs, see, e.g., [Eva98].
Lemma 4.3**.**
Let and with and . Let satisfy (2.4a) and . Then,
[TABLE]
Proof.
With the unit-vector in the -th coordinate and , we define the difference quotient
[TABLE]
We use the test-function in the weak formulation of (2.4). Noting that due to the assumption , we therefore obtain
[TABLE]
Therefore, with Young’s inequality, we have the estimate
[TABLE]
Absorbing the first term and taking the limit , we obtain the sought inequality for all second derivatives in . ∎
The following Lemma 4.4 provides the required estimate for the far-field.
Lemma 4.4**.**
Let and the far-field be given by (4.5). Let for and for . Then, the estimate
[TABLE]
holds with a constant depending only on , , , and the -shape regularity of .
Proof.
Since , we have so that it suffices to show the estimate (4.21) with replaced with .
Since the fractional Laplacian is the Dirichlet-to-Neumann map for the extension problem (2.4), we need to control the Neumann data of the extension problem, i.e., the trace of at , where is the solution of (2.4) with boundary data . We note that the definition of the cut-off function and the constant (in particular: if ) imply . Moreover, implies that .
Given , the -shape regularity of implies the existence of sets with and implied constant depending solely on the -shape regularity. Additionally, we may require that . Setting , , we may select a cut-off function with on , and , where again the implied constant depends solely on the -shape regularity of . The multiplicative trace inequality from [MK18, Lemma 3.7] applied with provides
[TABLE]
The equation implies that , so we obtain with
[TABLE]
It remains to control in the weighted -norm. This is done with Lemma 4.3, and we get
[TABLE]
With a standard a priori estimate, the energy norm on the right-hand side can be estimated by the Dirichlet data , and this finally implies
[TABLE]
where the last estimate can be found in the proof of Lemma 4.2. This proves the estimate for the far-field. ∎
5 Numerics
We illustrate our theoretical results of the previous sections with some numerical examples in two dimensions. For more numerical examples about adaptive methods for fractional diffusion, we refer to [AG17].
5.1 Implementational Issues
We implement the crucial steps SOLVE (step (i)) and ESTIMATE (step (ii)) in Algorithm 2.5 in MATLAB R2018a as follows:
- •
SOLVE: To obtain the lowest-order discrete solution , we use the existing MATLAB-code from [ABB17], where the unbounded domain is replaced by a (large) circle around the computational domain . The integrals of the system matrix are computed with high precision quadrature rules. For domains with curved boundary , the boundary is approximated by a piecewise linear interpolant, which introduces a variational crime. Nevertheless, this approximation improves as the mesh size near is reduced.
- •
ESTIMATE: For the error estimator, we need to compute the local contributions
[TABLE]
with for and for . In Section 2, we noted that may blow up as tends to the mesh skeleton. The integral on the triangle is transformed to an integral on a square by means of the Duffy transformation. There, the integral is approximated by a quadrature on a tensor product composite Gauss rule on meshes that are refined geometrically towards the edges of the square. Evaluating the residual requires evaluating the fractional Laplacian applied to the discrete solution in each quadrature point. For , this is done with the pointwise evaluation formula from [AG17, Lemma 4]
[TABLE]
Here, only integrals over the boundary of each element appear, which are approximated using the standard 1D-MATLAB quadrature function.
As two contributions , are independent for , the computation of the error estimator is easily parallelized, which leads to considerable speed-up in the computations.
Remark 5.1**.**
The computation of the error estimator is fairly expensive due to the need for an accurate quadrature rule for the residual. One way to circumvent this is to use a different error estimator inspired by the near-field and far-field splitting from Section 4, as well as the observation that the near-field behaves like a power of the distance to the skeleton. We illustrate our ideas in the one dimensional case: As in formula (4.1), the principal value integral over one element can be computed exactly for as
[TABLE]
For all other elements a similar computation can be made. However, only elements in the patch of are truly of interest, since the integrand is smooth for all other elements. For the elements in the patch, again, only the terms containing are relevant, which leads to the splitting
[TABLE]
where denotes the jump of the derivative across the elements and . Similarly as in Theorem 2.3, the residual can then be bounded by
[TABLE]
*The advantage of this approach is that the far-field, written in terms of formula (• ‣ 5.1), can be cheaply computed using standard Gaussian quadrature and for the near-field only the jumps across the elements need to be computed. *
We present convergence plots in the energy norm, where we use that — due to the Galerkin orthogonality and symmetry of — the error can be computed as
[TABLE]
5.2 Example 1 – Circle
We start with an example on the unit circle and choose a constant right-hand side with exact solution given by (see, e.g., [AG17, BBN*+*18])
[TABLE]
Using polar coordinates, we can easily compute the exact energy as
[TABLE]
The exact solution is smooth inside the unit circle, but non-smooth towards the whole boundary, which is typical for solutions of our model problem (2.6). Therefore, we expect that the adaptive algorithm refines the mesh towards the whole boundary, which is indeed the case as shown in Figure 1.
Figure 2 shows the values of the error estimator (2.13) (brown triangles, blue squares) as well as the error (black diamonds, red stars) in the energy norm for uniform and adaptive mesh refinement by Algorithm 2.5 steered by the estimator (2.13) for (with ) and (with ).
As expected, uniform mesh refinement leads to a reduced rate of due to the singularity of the solution at the boundary of the circle. However, adaptive refinement restores the optimal algebraic rate of both for the error and the estimator as predicted by Theorem 2.6.
In Figure 3, we vary the adaptivity parameter for fixed . The dashed lines indicate the values of the error estimator and the solid ones the true errors in the energy norm. We observe optimal algebraic rates for all choices that are smaller than 1. leads to uniform refinement and therefore non-optimal convergence. As the error and estimator curves are not distinguishable for , this experiment suggests, that the condition in Theorem 2.6 is not necessary.
5.3 Example 2 – L-shaped domain
As a second example, we consider the L-shaped domain depicted in Figure 1. We prescribe a constant right-hand side . As the exact solution is unknown, we extrapolate the energy from the computed discrete energy.
Again, the adaptive algorithm refines the meshes towards the whole boundary due to the singularity of the solution at the whole boundary. This is in contrast to the known results for the integer Laplacian (), where only refinement towards the reentrant corner is observed.
Figure 4 shows the convergence of the error estimator and the error for the cases () and (). We observe optimal convergence rates for the adaptive method and reduced rates for uniform refinement just as in Example 1.
5.4 Example 3 - Circle, discontinuous right-hand side
As a final example, we again consider the unit circle , but choose a discontinuous right-hand side
[TABLE]
For this problem, again an exact solution is known, see, e.g., [AG17]. The energy of this solution can be computed using the Meijer G-function as
[TABLE]
In Figure 5, an adaptively generated mesh and the discrete solution are plotted. In contrast to the previous examples, the adaptive algorithm does not only refine the mesh at the boundary, but also along the discontinuity of at the line . However, the refinement towards the boundary tends to be stronger than towards the singularity of the right-hand side.
In Figure 5, convergence rates for the error estimator and the error are depicted. The empirical results are the same as for the previous two examples.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AB 17] G. Acosta and J.P. Borthagaray, A fractional Laplace equation: regularity of solutions and finite element approximations , SIAM J. Numer. Anal. 55 (2017), no. 2, 472–495.
- 2[ABB 17] G. Acosta, F.M. Bersetche, and J.P. Borthagaray, A short FE implementation for a 2d homogeneous Dirichlet problem of a fractional Laplacian , Comput. Math. Appl. 74 (2017), no. 4, 784–816.
- 3[ABH 18] G. Acosta, J.P. Borthagaray, and N. Heuer, Finite element approximations of the nonhomogeneous fractional Dirichlet problem , IMA Journal of Numerical Analysis (2018), dry 023.
- 4[AFF + 15] M. Aurada, M. Feischl, T. Führer, M. Karkulik, and D. Praetorius, Energy norm based error estimators for adaptive BEM for hypersingular integral equations , Appl. Numer. Math. 95 (2015), 15–35.
- 5[AFF + 17] M. Aurada, M. Feischl, T. Führer, M. Karkulik, J.M. Melenk, and D. Praetorius, Local inverse estimates for non-local boundary integral operators , Math. Comp. 86 (2017), no. 308, 2651–2686.
- 6[AG 17] M. Ainsworth and C. Glusa, Aspects of an adaptive finite element method for the fractional Laplacian: a priori and a posteriori error estimates, efficient implementation and multigrid solver , Comput. Methods Appl. Mech. Engrg. 327 (2017), 4–35.
- 7[AG 18] , Hybrid finite element–spectral method for the fractional Laplacian: approximation theory and efficient solver , SIAM J. Sci. Comput. 40 (2018), no. 4, A 2383–A 2405. MR 3835597
- 8[BBN + 18] A. Bonito, J.P. Borthagaray, R.H. Nochetto, E. Otárola, and A.J. Salgado, Numerical methods for fractional diffusion , Comput. Vis. Sci. 19 (2018), no. 5-6, 19–46.
