$hp$-Finite Elements for Fractional Diffusion
Dominik Meidner, Johannes Pfefferer, Klemens Sch\"urholz, Boris Vexler

TL;DR
This paper introduces an $hp$-finite element numerical scheme for efficiently solving boundary value problems involving the spectral fractional Laplacian, reducing computational complexity and improving convergence.
Contribution
It presents a novel $hp$-finite element discretization approach on a truncated semi-infinite cylinder for spectral fractional Laplacian problems, enhancing efficiency and accuracy.
Findings
Significant reduction in degrees of freedom needed for computation
Slightly improved convergence properties over linear finite element methods
Validated effectiveness through numerical experiments
Abstract
The purpose of this work is to introduce and analyze a numerical scheme to efficiently solve boundary value problems involving the spectral fractional Laplacian. The approach is based on a reformulation of the problem posed on a semi-infinite cylinder in one more spatial dimension. After a suitable truncation of this cylinder, the resulting problem is discretized with linear finite elements in the original domain and with -finite elements in the extended direction. The proposed approach yields a drastic reduction of the computational complexity in terms of degrees of freedom and even has slightly improved convergence properties compared to a discretization using linear finite elements for both the original domain and the extended direction. The performance of the method is illustrated by numerical experiments.
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.
-Finite Elements for Fractional Diffusion
Dominik Meidner222Technical University of Munich, Department of Mathematics, Chair of Optimal Control, Garching / Germany ([email protected], [email protected], [email protected], [email protected])
Johannes Pfefferer222Technical University of Munich, Department of Mathematics, Chair of Optimal Control, Garching / Germany ([email protected], [email protected], [email protected], [email protected])
Klemens Schürholz222Technical University of Munich, Department of Mathematics, Chair of Optimal Control, Garching / Germany ([email protected], [email protected], [email protected], [email protected])
Boris Vexler222Technical University of Munich, Department of Mathematics, Chair of Optimal Control, Garching / Germany ([email protected], [email protected], [email protected], [email protected])
Abstract
The purpose of this work is to introduce and analyze a numerical scheme to efficiently solve boundary value problems involving the spectral fractional Laplacian. The approach is based on a reformulation of the problem posed on a semi-infinite cylinder in one more spatial dimension. After a suitable truncation of this cylinder, the resulting problem is discretized with linear finite elements in the original domain and with -finite elements in the extended direction. The proposed approach yields a drastic reduction of the computational complexity in terms of degrees of freedom and even has slightly improved convergence properties compared to a discretization using linear finite elements for both the original domain and the extended direction. The performance of the method is illustrated by numerical experiments.
keywords:
Fractional Laplace operator, nonlocal operators, finite elements, -finite elements, discretization error estimates, anisotropic meshes
\minisec
AMS subject classification 35S15, 65R20, 65N12, 65N30
1 Introduction
In this work, we are concerned with boundary value problems involving the fractional Laplacian, being the prototype of a nonlocal operator. To be more specific: Let for be a bounded, convex, polygonal or polyhedral domain. We are interested in the solution of the boundary value problem
[TABLE]
where denotes the spectral fractional Laplacian of order defined by the eigenvalues and eigenfunctions of the standard Laplacian, precisely introduced in Section 2. The main purpose of this paper is to introduce and analyze a numerical scheme to efficiently solve problem (1.1).
Our approach is based on the following equivalent reformulation of problem (1.1) posed on the semi-infinite cylinder : Let be the weak solution of the extended problem
[TABLE]
see Section 2 for more details. Then, the trace is the solution of the fractional boundary value problem (1.1).
In contrast to the nonlocal problem (1.1), the extended problem is localized. However, a direct application of a finite element method to the extended problem is not feasible because of the semi-infinite domain. As remedy, the exponential decay of in direction towards infinity (see Proposition 2.9) can be employed such that a truncation of the semi-infinite cylinder to becomes reasonable. The extended problem posed on the truncated cylinder can be discretized using finite elements. However, due to the degenerate/singular nature of the extended problem, anisotropic meshes are favorable in order to obtain an optimally convergent numerical scheme. Moreover, the height of the truncated cylinder needs to be chosen dependent on the mesh parameter to ensure the aforementioned convergence. This approach was already pursued in [27] using a discretization with first degree tensor product finite elements on graded meshes in the extended direction, see also [14, 15, 26, 28] for related results. If denotes the mesh parameter and the number of degrees of freedom in then the approach from [27] yields a discretization error of order in the corresponding energy norm associated with (1.1) while solving problems with degrees of freedom.
In this work, we introduce and analyze a discretization of the truncated problem with linear finite elements in the original domain and with -finite elements on a geometric mesh in the extended direction. This drastically reduces the computational complexity to degrees of freedom and even yields a slightly better convergence rate of order . Especially, when is large, the difference between the factor and becomes clearly perceptible. For instance, in our numerical experiments we could reduce the number of degrees of freedom by a factor of about to obtain an error of less than in the case , see Section 5 for more details. We also notice that our approach and results are not limited to the spectral fractional Laplacian. They naturally extend by only minor modifications to fractional powers of general second order elliptic operators.
Let us briefly give an overview on other numerical approaches from the literature to solve boundary value problems involving the fractional Laplacian: Due to the spectral definition of the operator, it seems to be natural to compute an approximating, discrete spectral decomposition of the standard Laplacian in order to get an approximation of the solution of (1.1), see [21, 22, 31]. However, this may result in solving a large number of discrete eigenvalue problems. Another approach to determine an approximation to the solution of problem (1.1) is analyzed in [8], see also [6, 7, 9] for related results. In that reference, is represented in terms of Bochner integrals involving for . Subsequently, different quadrature formulas to approximate this integral are analyzed which require multiple evaluations of with being a quadrature point and denoting a finite element discretization to . Numerical approaches for the integral definition of the fractional Laplacian, which is not equivalent to the spectral definition considered in the present paper, can be found in [2, 3, 4, 5, 10, 16, 18, 19, 20].
This paper is organized as follows: In Section 2, we state the definition of the fractional Laplacian, formulate the extended problem in detail, and introduce the functional framework needed for the subsequent error analysis. Moreover, in this section, we are concerned with several properties of the solution of the extended problem such as a series representation and corresponding regularity results. The discrete, extended problem posed on the truncated cylinder is formulated at the beginning of Section 3. In the extended direction, we distinguish between graded meshes and -FEM, and geometric meshes and -FEM, see Sections 3.1 and 3.2. The error analysis is given in Section 4. Thereby, in Section 4.1, we mainly recover the results of [27]. The reason for doing this is twofold. First, we are able to slightly improve the mesh grading condition used in [27]. However, the main reason to analyze the -FEM on graded meshes before developing the analysis for the -method considered in Section 4.2 is, that the techniques we use are almost identical for both cases, but the details are simpler for -FEM. Implementation aspects and numerical experiments, which underline the efficiency of our approach, are presented in Section 5. In the appendix, we collect different results for special functions defined by the modified Bessel functions of second kind. These are especially needed in Section 2 for the discussion of the solution of the extended problem.
Finally, we notice that, in the following, denotes a generic constant which will always be independent of the mesh parameter when we analyze the discretization error.
2 Continuous Problem
Let be the realization of the Laplacian with homogeneous Dirichlet boundary conditions. It is well-known that has a compact resolvent and its eigenvalues form a non-decreasing sequence satisfying . We denote by the orthonormal eigenfunctions associated with fulfilling
[TABLE]
For any , we introduce the fractional order Sobolev space
[TABLE]
Moreover, we denote by the dual space of . Then, the spectral fractional Laplacian is defined for on the space as the limit
[TABLE]
Due to the Cauchy-criterion the limit exists for any . Thus, problem (1.1) has to be understood as: Given , find such that
[TABLE]
Proposition 2.1**.**
For any , problem (1.1) admits a unique solution fulfilling . Moreover, there is the series representation
[TABLE]
Proof.
The existence of an unique solution and the equality of the norms is a consequence of the Riesz representation theorem. The series representation of is obtained by testing (2.1) with and using the orthogonality of the eigenfunctions. ∎
Remark 2.2*.*
Due to the definition of the fractional Laplacian and the previous result, we observe that problem (1.1) is already meaningful without additionally imposing the homogeneous Dirichlet boundary conditions since these are already included in the definition of the operator. Moreover, we notice that the regularity of can be described in classical fractional Sobolev spaces as well, since
[TABLE]
For more details we refer to, e.g., [27].
Problem (1.1) can equivalently be posed on a semi-infinite cylinder. In , this is due to Caffarelli and Silvestre [12]. The restriction to bounded domains was considered by Stinga and Torrea in [30], see also [11, 13]. This kind of extension is the basis for the computational approaches in the subsequent sections.
In order to state the extended problem, we first introduce the required notation. We denote by the aforementioned semi-infinite cylinder and by its lateral boundary. We also need to define a truncated cylinder: for , the truncated cylinder is given by with its lateral boundary . As and are objects in , we use to denote the extended variable, such that a vector admits the representation . Similarly, the gradient in has the representation .
Next we introduce weighted Sobolev spaces with a weight function for . In this regard, let be an open set, such as or . Then, we define the weighted space as the space of all measurable functions on with finite norm . Similarly, the space denotes the space of all functions whose weak derivatives of first order belong to .
To study the extended problems, we introduce the space
[TABLE]
The space is defined analogously, but endowed with zero Dirichlet boundary conditions also on :
[TABLE]
For , we denote by the trace of onto , i.e., .
Proposition 2.3**.**
For , it holds
[TABLE]
Proof.
See [11, Proposition 1.8] for and [13, Proposition 2.1] for . ∎
Now, we are able to state the extended problem: Given , find such that
[TABLE]
with and . That is, the function is a weak solution of
[TABLE]
where we have set . Note that subsequently, the parameter will always be equal to for the considered .
In the remainder of this section, we discuss several properties of the solution to (2.2). Due to the following proposition, it is reasonable to determine the solution of (2.2) in order to get the solution of (1.1).
Proposition 2.4**.**
For , the extended problem (2.2) admits a unique solution . Furthermore, solves (1.1).
Proof.
See [13, Lemma 2.1]. ∎
We have the following regularity result.
Proposition 2.5**.**
Let be the solution of (2.2) and . Then, it holds
[TABLE]
Proof.
[27, Theorem 2.7] yields
[TABLE]
with given above. Convexity of then implies the assertion. ∎
For a series expansion of the solution to (2.2), we introduce the function given by
[TABLE]
Here, denotes the modified Bessel function of second kind, see, e.g., [1, Section 9.6] and denotes the gamma function.
Proposition 2.6**.**
For , let be the solution of (1.1) and be the solution of (2.2). Then, it holds
[TABLE]
where and .
Proof.
For , see [13, Proposition 2.1]. For , the result was proved with in [11, Proposition 2.2]. However, by [1, 9.6.23] and the relation , it holds
[TABLE]
Hence, holds also in the case . ∎
We state an estimate of the derivatives of which we will use later. The result is based on properties of which are analyzed in the appendix.
Corollary 2.7**.**
Let . There exists a constant depending only on , such that for any and it holds
[TABLE]
Proof.
Simple calculations yield
[TABLE]
Consequently, we obtain by means of Lemma A.3
[TABLE]
Next, we state a result about the exponential decay of and its derivative. It is based on corresponding results for and its derivative, proved in the appendix.
Corollary 2.8**.**
Let , and . Then, there exists a constant only depending on , , and and a constant only depending on , , and such that
[TABLE]
Proof.
Let . According to [25, Theorem 5], we get for that is a decreasing function. Consequently, we obtain
[TABLE]
since the sequence is non-decreasing. Moreover, due to the definition of , we deduce
[TABLE]
Thus, by setting and in Lemma A.4 (a), we obtain the validity of the first inequality of the assertion by means of (2.4). The second inequality can be deduced in the same manner employing Lemma A.4 (b). ∎
As already mentioned, for computational reasons, the semi-infinite cylinder will be truncated to for some later on. Because of this, the behavior of for will play a role. It can be estimated as follows:
Proposition 2.9**.**
For , let be the solution of (2.2). Then, there exists a constant such that for every , it holds
[TABLE]
Proof.
The result can be found in [27, Proposition 3.1]. For the sake of completeness, we state a (slightly different) proof here. According to Proposition 2.6, we obtain by using the definition of the eigenfunctions and its orthogonality
[TABLE]
where we employed Corollary 2.8 in the last step with . Calculating the integral and using that is a non-decreasing sequence, yields
[TABLE]
where we used Proposition 2.1 in the last step. ∎
3 Discretization
Let be a conforming and quasi-uniform triangulation of which is admissible in the sense of Ciarlet. For each , let be an element that is isoparametrically equivalent either to the unit cube or to the unit simplex in . We introduce the global mesh parameter with respect to the triangulation of by . We always assume that . On , we define a finite element space as
[TABLE]
In case that is a simplex then , the set of polynomials on the element of degree at most . If is a cube then equals , the set of polynomials on of degree at most 1 in each variable. The number of degrees of freedom in is denoted by . It holds .
Furthermore, let be a triangulation of the interval in the sense that with and exactly specified below in the Sections 3.1 and 3.2. Moreover, let . Next, we introduce a polynomial degree vector which will assign to each element a maximal polynomial degree . It will be exactly specified in the Sections 3.1 and 3.2. On , we define the finite element space as
[TABLE]
where denotes the space of polynomials up to degree on .
Now, the triangulations of the cylinder are constructed as tensor product triangulations by means of and , i.e., with for and . By means of the previous considerations, we define the finite element space posed on the tensor product mesh by
[TABLE]
Note, that each function vanishes on the lateral boundary of and on its top. As a consequence, the extension by zero of to the semi-infinite cylinder belongs to . Without further mention, we consider this type of extension for each whenever needed.
With the just introduced notation, we define approximations to the solution of (2.2) as follows: Find satisfying
[TABLE]
where we recall that and . Note that will be used as an approximation of .
We distinguish two possible types of discretization in the artificial direction, which will be defined in the following two sections.
3.1 Graded meshes and -FEM
In this section, let to be determined later. We set
[TABLE]
where represents the grading parameter in direction . Hence, for the triangulation is anisotropic. Moreover, due to the choice of the polynomial degree vector , the discrete space consists of globally continuous and piecewise multilinear functions on .
We start with a result regarding the diameter of the elements .
Lemma 3.1**.**
It holds
[TABLE]
Proof.
The first equality is obvious due to the definition of . For the second, we observe that there exists a such that
[TABLE]
due to the mean value theorem. Since for , the result follows. ∎
Since we consider a discretization with linear polynomials in direction , the number of degrees of freedom in is proportional to , i.e., it holds .
3.2 Geometric meshes and -FEM
For the second possibility of discretization presented here, the mesh in direction is chosen as a geometric mesh. That is, for chosen and to be determined later, the nodes are given by
[TABLE]
Further, we define to be a linear degree vector with slope . That is, there exists a constant such that for all the following relation is fulfilled:
[TABLE]
We start with collecting some basic results for the discretization considered in this subsection.
Lemma 3.2**.**
For a geometric mesh given by (3.2), there holds for
[TABLE]
Proof.
The first equation of the assertion is obvious due to the definition of the geometric mesh. For , we obtain
[TABLE]
As a consequence, we get
[TABLE]
Lemma 3.3**.**
For a geometric mesh given by (3.2) and a linear degree vector in the sense of (3.3), it holds and there is a constant such that
[TABLE]
for all .
Proof.
Since , there obviously holds . According to Lemma 3.2, we get for
[TABLE]
which shows the second assertion. ∎
Lemma 3.4**.**
Let be a geometric triangulation of given by (3.2) and let be a linear degree vector as defined in (3.3). Then, for the number of degrees of freedom in , it holds
[TABLE]
Proof.
On each interval we locally have degrees of freedom. Moreover, two neighboring intervals always share one degree of freedom. Thus, we have
[TABLE]
which proves the assertion having in mind Lemma 3.3. ∎
4 Error Estimates
We start with providing a general error estimate between the solutions of (2.2) and of (3.1) in weighted norms.
Lemma 4.1**.**
Let be the solution of (2.2) and be the solution of (3.1). Then, it holds
[TABLE]
Proof.
Testing (2.2) with and then subtracting (3.1) from this equation yields
[TABLE]
Based on this, we deduce for all
[TABLE]
Dividing by ends the proof. ∎
Whereas the last term in the estimate of Lemma 4.1 can be treated by means of Proposition 2.9, we have to estimate the first term. To this end, we introduce the following approximation operators separately for the and variables:
By , we denote the projection with respect to the variable on . For the interpolation with respect to the direction, we consider each interval separately. For fixed , let and be the Gauss-Lobatto points in and let denote the corresponding Lagrange polynomials of order . Then, we define the Gauss-Lobatto interpolant by
[TABLE]
Further, we define an interpolant which admits given by
[TABLE]
Based on this, we define the interpolation for a linear degree vector by
[TABLE]
In particular, it holds that is constant on and . For any function , we set
[TABLE]
Moreover, for the solution of (2.2), the application of is defined as
[TABLE]
which is well-defined because . Thus, by construction, we have .
For the first term on the right-hand side of the estimate in Lemma 4.1, we have the following result.
Lemma 4.2**.**
Let be the solution of (2.2). Then, it holds
[TABLE]
Proof.
First, we set . Then, by introducing as an intermediate function, we deduce
[TABLE]
According to the definition of , we have almost everywhere in . As a consequence, we deduce by well known stability estimates for the projection
[TABLE]
which shows the assertion. ∎
Lemma 4.3**.**
For , let be the solution of (2.2). Then, it holds
[TABLE]
Proof.
Analogously to the foregoing proof, by classical estimates for the projection , we obtain
[TABLE]
Then, Proposition 2.5 yields the assertion. ∎
Next, we are concerned with estimates for the second term in Lemma 4.2. To this end, we consider the interpolation error on each subinterval . Employing the decomposition from Proposition 2.6 and the definition of the eigenfunctions , we obtain
[TABLE]
By using this identity in the following two subsections, we will estimate the terms
[TABLE]
for the two types of triangulations and polynomial spaces introduced in the Section 3.1 and 3.2.
Thereby, in Section 4.1, we will mainly recover the results of [27]. The reason for doing this is twofold. First, we are able to slightly improve the grading condition from (in our notation) of [27, Section 5.2] to . However, the main reason to analyze the -FEM on graded meshes before developing the analysis for the considered -method is, that the techniques we use are almost identical for both cases, but the details are simpler for -FEM, of course.
Later, in Section 4.2, we will analyze the -method introduced in Section 3.2, which yields a slightly improved rate of convergence ( vs. ) compared to -FEM but a drastic reduction of the computational complexity in terms of degrees of freedom from to .
Note that in the following estimates, we will track the dependence on explicitly since as a last step will be chosen -dependent.
4.1 Graded meshes and -FEM
As announced, we are concerned with estimates for (4.4) for the discretization defined in Section 3.1. For simplicity, in this subsection, we will write for , since we have here.
Lemma 4.4** (Estimate on ).**
For , let be the solution of (2.2) and let . Then, it holds
[TABLE]
Proof.
First, we observe that the interpolant is constant on . By its definition (4.2), it holds (i_{y}\psi_{s,k})\bigr{\rvert}_{I_{1}}=\psi_{s,k}(y_{1}). Integration by parts and noting that y^{\alpha+1}(\psi_{s,k}-\psi_{s,k}(y_{1}))^{2}\bigr{\rvert}_{0}^{y_{1}}=0 yields
[TABLE]
Then, dividing by implies
[TABLE]
with . By means of Corollary 2.7 with and , we obtain
[TABLE]
Hence, we get by Lemma 3.1 together with the assumption on that
[TABLE]
In a similar fashion, we obtain by Corollary 2.7 with and the relation
[TABLE]
where we again used Lemma 3.1 in the last step.
The previous estimates together with (4.4) and Proposition 2.1 yield
[TABLE]
which implies the assertion. ∎
Lemma 4.5** (Estimates on for ).**
For , let be the solution of (2.2). Moreover, let and . Then, it holds
[TABLE]
Proof.
For , we have that . It holds such that we conclude with standard estimates for the linear Lagrange interpolant , Lemma 3.1, and the assumption on that
[TABLE]
By using Corollary 2.7 with and , this implies
[TABLE]
Similarly, using Corollary 2.7 with and , we obtain for the term involving the derivative
[TABLE]
The previous estimates in combination with (4.4) yield
[TABLE]
Finally, applying Proposition 2.1, we get
[TABLE]
which states the assertion. ∎
Lemma 4.6** (Estimate on ).**
For , let be the solution of (2.2). Moreover, let , , and
[TABLE]
Then, it holds
[TABLE]
Proof.
We recall that and on . We introduce the Lagrange interpolation on as an intermediate function such that
[TABLE]
where we used that in the last step. As in the proof of Lemma 4.5, we deduce
[TABLE]
Since by assumption, we obtain using Corollary 2.8 with together with the monotonicity of
[TABLE]
where we notice that is a non-decreasing sequence. Combining the previous results yields
[TABLE]
Similarly, we deduce
[TABLE]
where we used that in the last step. The first term can again be estimated as in the proof Lemma 4.5 such that
[TABLE]
Employing Corollary 2.8 with together with the monotonicity of yields for
[TABLE]
where we used once again that the sequence is non-decreasing. Due to the previous results, we arrive at
[TABLE]
By combining (4.4), (4.5) and (4.6), we obtain
[TABLE]
where we used (see Proposition 2.1) and the definition of . According to Lemma 3.1, there holds . Since
[TABLE]
by assumption, we obtain
[TABLE]
which ends the proof. ∎
Corollary 4.7**.**
For , let be the solution of (2.2). Moreover, let , , and
[TABLE]
Then, it holds
[TABLE]
Proof.
By the Lemmas 4.4, 4.5, and 4.6, we obtain
[TABLE]
where we have used and the upper bound on . ∎
Now, we are able to state the main result for this subsection analyzing the -FEM on graded meshes.
Theorem 4.8**.**
For , let and be the solutions of (1.1) and (2.2), respectively, and let be the solution of (3.1). Moreover, let , , and
[TABLE]
Then, it holds
[TABLE]
Proof.
The first inequality of the assertion is due to Propositions 2.3 and 2.4. Using the Lemmas 4.1 and 4.2, we get
[TABLE]
The three terms on the right-hand side are estimated in Lemma 4.3, Corollary 4.7, and Proposition 2.9. Hence, we get
[TABLE]
Then, the lower bound on yields , which implies the assertion. ∎
Theorem 4.9**.**
The total number degrees of freedom in to achieve the order of convergence given in Theorem 4.8 behaves like
[TABLE]
where denotes the dimension of .
Proof.
For the number of degrees of freedom of the discretization considered in this section, it holds . Then, the assertion follows from . ∎
4.2 Geometric meshes and -FEM
In this section, we derive discretization error estimates for the -method described in Section 3.2, which results in a slightly improved rate of convergence of compared to the previous subsection. However, we will have a drastically reduced computational complexity in terms of the number of degrees of freedom. To this end, we do neither fix the number of elements in direction nor the slope of the linear degree vector yet. These will be set below. As before, we start with estimates for based on (4.4).
Lemma 4.10** (Estimate on ).**
For , let be the solution of (2.2) and let
[TABLE]
for some . Then, it holds
[TABLE]
Proof.
Notice that on the first interval as in the previous section. Thus, as in the proof of Lemma 4.4 but using
[TABLE]
from Lemma 3.2 and the assumption on , we get
[TABLE]
Hence, we obtain
[TABLE]
As in the proof of Lemma 4.4, this yields the assertion. ∎
In order to derive estimates on for , we recall the following result which is a direct consequence of [24, Lemma 3.2.6].
Proposition 4.11**.**
Let be analytic on and satisfy for some the estimate
[TABLE]
Then, there are constants depending only on such that the Gauss-Lobatto interpolant of degree on satisfies
[TABLE]
Lemma 4.12** (Estimates on for ).**
For , let be the solution of (2.2). Moreover, let be a linear degree vector as in (3.3) with some and let
[TABLE]
for some , where is a constant depending on only. Then, it holds
[TABLE]
Proof.
For it holds . By transforming to the reference element , we obtain for (i_{y}^{p}\psi_{s,k})\bigr{\rvert}_{I_{m}}=i_{p_{m}}\psi_{s,k}\bigr{\rvert}_{I_{m}} that
[TABLE]
By means of Corollary 2.7, applied with , and Lemma 3.2, we have
[TABLE]
Moreover, due to well known series representations of from [1, 9.6.2 and 9.6.10], we directly conclude that is analytic on . Hence, Proposition 4.11 implies with that
[TABLE]
Then, we get by Lemma 3.2
[TABLE]
Analogously, we obtain
[TABLE]
By means of Corollary 2.7 with and Lemma 3.2, we have
[TABLE]
Consequently, Proposition 4.11 yields with that
[TABLE]
This implies
[TABLE]
Collecting the previous results yields
[TABLE]
Relation (3.3) implies
[TABLE]
Thus, we deduce
[TABLE]
Let us now distinguish two cases:
- •
: Since , we then obtain
[TABLE]
As before, the relation together with Lemma 3.2 implies . Hence, we get
[TABLE]
- •
: With , we get from (4.7) that
[TABLE]
Similarly as before, the relation together with Lemma 3.2 implies . Thus, we get
[TABLE]
The previous results in combination with (4.4) imply
[TABLE]
Finally, applying Proposition 2.1 yields the assertion. ∎
Lemma 4.13** (Estimate on ).**
For , let be the solution of (2.2). Moreover, let be a linear degree vector as in (3.3) with some and let
[TABLE]
for some , where is a constant depending on only. Then, it holds
[TABLE]
Proof.
We proceed as in the proof of Lemma 4.6 and recall that and . Moreover, according to [17], the Lagrange basis functions of order on have the property
[TABLE]
As a consequence, we obtain by means of an inverse inequality (see, e.g., [24, Lemma 3.2.2])
[TABLE]
Noting that on , we introduce the Gauss-Lobatto interpolant on as an intermediate function such that
[TABLE]
where we used (4.8) in the last step. As in the proof of Lemma 4.12, we deduce for that
[TABLE]
Since by assumption, we obtain using Corollary 2.8 with together with the monotonicity of
[TABLE]
where we notice that is a non-decreasing sequence. Combining the previous results yields
[TABLE]
Similarly, we deduce by means of (4.9)
[TABLE]
Using , the first term can again be estimated as in the proof Lemma 4.12 such that
[TABLE]
Employing Corollary 2.8 with together with the monotonicity of yields for
[TABLE]
where we used once again that the sequence is non-decreasing. Due to the previous results, we arrive at
[TABLE]
By combining (4.4), (4.10) and (4.11), we obtain as in the proof of Lemma 4.6
[TABLE]
According to Lemma 3.3, there holds . Since
[TABLE]
by assumption, we obtain
[TABLE]
which ends the proof. ∎
Corollary 4.14**.**
For , let be the solution of (2.2). Moreover, let be a linear degree vector as in (3.3) with some and let
[TABLE]
for some , where is a constant depending on only. Then, it holds
[TABLE]
Proof.
By the Lemmas 4.10, 4.12, and 4.13, we obtain
[TABLE]
where we have used the upper bounds on and and the boundedness of for . ∎
Now, we are able to state the main result for this subsection analyzing the -FEM on geometric meshes.
Theorem 4.15**.**
For , let and be the solutions of (1.1) and (2.2), respectively, and let be the solution of (3.1). Moreover, let be a linear degree vector as in (3.3) with some and let
[TABLE]
for some , where is a constant depending on only. Then, it holds
[TABLE]
Proof.
The first inequality of the assertion is due to Propositions 2.3 and 2.4. Using Lemmas 4.1 and 4.2, we get
[TABLE]
The three terms on the right-hand side are estimated in Lemma 4.3, Corollary 4.14, and Proposition 2.9. Hence, we get
[TABLE]
Then, the lower bound on yields , which implies the assertion. ∎
Theorem 4.16**.**
The total number degrees of freedom in to achieve the order of convergence given in Theorem 4.15 behaves like
[TABLE]
Proof.
As a direct consequence of Lemma 3.4, we obtain that the number of degrees of freedom of the discretization considered in this section fulfills . Then, the assertion follows from . ∎
5 Numerical Experiments
5.1 Implementation
For the discretization with respect to in -FEM and -FEM, we use hierarchical Lobatto polynomials (see, e.g., [29]) as local shape functions on which then are transformed onto each interval . Without the weight, i.e., for , this would result in a very sparse structure of the local stiffness matrix, since those shape functions are orthogonal. For the latter does not hold; nevertheless the global matrix is of course still sparse.
Let for be the ansatz functions for the discretization of and for ansatz functions for the discretization of . On the cylinder we then use ansatz functions of the form with and .
Due to this special structure, the system matrix for solving (3.1) can be expressed by means of the Kronecker product as
[TABLE]
Here, denotes matrices arising from discretization of and denotes matrices arising from discretization of given as
[TABLE]
We observe that one can assemble the matrices and completely independent from each other. This is advantageous since the weight only affects the matrices, while the matrices are standard FEM matrices, which can be computed by any FEM software.
Using the special structure of , one can implement a memory efficient solvers for the algebraic systems without ever fully assembling . This will be the topic of a forthcoming paper.
5.2 Numerical Results
We take the following configuration from [27, Section 6.1]. For the eigenfunctions of the Dirichlet-Laplacian are known to be with corresponding eigenvalues for . For the right-hand side , the solution of (1.1) and of (2.2) are then given by
[TABLE]
For the discretization by means of -FEM (cf. the Section 3.1 and 4.1), we choose the parameters
[TABLE]
whereas for the discretization by means of -FEM (cf. the Section 3.2 and 4.2), we choose the following parameters:
[TABLE]
The orders of convergence stated by the Theorems 4.8 and 4.15 in terms of are confirmed by the results of the numerical computations given in Figure 1. Note, that the error is evaluated by means of the identity
[TABLE]
which holds due to the Galerkin orthogonality (4.1).
In Figure 2, we depict the errors for both types of discretizations over the total numbers of degrees of freedom . Thereby, the slower growth of for the -discretization given by Theorem 4.16 in comparison to Theorem 4.9 clearly leads to a drastic reduction of the number of degrees of freedom compared to -FEM on a graded mesh. For instance the number of degrees of freedom to achieve an error of less than in the case reduces from for -FEM to for -FEM, which is a factor of about .
Appendix A Estimates for and its derivatives
We begin with a representation of the derivatives of the expression , where are the modified Bessel functions of second kind. It which will be used in the sequel to derive estimates for the derivatives of .
Lemma A.1**.**
The derivatives of of order can be calculated as
[TABLE]
where the coefficients are given by
[TABLE]
Proof.
We prove this assertion by induction. To this end, we first collect some basic results for the modified Bessel function of second kind. In [1, 9.6.28], we find for all
[TABLE]
As a consequence, there holds
[TABLE]
Using the latter result, we get the following formula for :
[TABLE]
By means of this, we obtain for with by setting
[TABLE]
These elementary results build the basis for the induction: The hypothesis (A.1) clearly holds for .
Assuming that (A.1) holds for some , we deduce
[TABLE]
Employing (A.6), we continue with
[TABLE]
It remains to show that
[TABLE]
The first and third equation are obvious due to (A.2) and (A.4). Thus, we only elaborate on the second. We distinguish three cases for :
- •
m\geq\bigl{\lfloor}\frac{n+1}{2}\bigr{\rfloor}+2: Again due to (A.4), we have , since m,m-1>\bigl{\lfloor}\frac{n}{2}\bigr{\rfloor}. Hence, it holds
[TABLE]
- •
m=\bigl{\lfloor}\frac{n+1}{2}\bigr{\rfloor}+1: Here, it holds m>\bigl{\lfloor}\frac{n}{2}\bigr{\rfloor} and we already know that . Moreover, in case that is even, we deduce and
[TABLE]
If is odd, we obtain since m-1=\frac{n+1}{2}>\bigl{\lfloor}\frac{n}{2}\bigr{\rfloor}. As a consequence, we get
[TABLE]
- •
m\leq\bigl{\lfloor}\frac{n+1}{2}\bigr{\rfloor}: Here, we again distinguish between even and odd. In the first case, we have \bigl{\lfloor}\frac{n+1}{2}\bigr{\rfloor}=\bigl{\lfloor}\frac{n}{2}\bigr{\rfloor}. Hence, it holds m-1,m\leq\bigl{\lfloor}\frac{n}{2}\bigr{\rfloor} and by means of (A.3), we get
[TABLE]
In case that is odd, we have that \bigl{\lfloor}\frac{n+1}{2}\bigr{\rfloor}=\bigl{\lfloor}\frac{n}{2}\bigr{\rfloor}+1. Thus, for m\leq\bigl{\lfloor}\frac{n+1}{2}\bigr{\rfloor}-1, we can reuse the calculations from before. If m=\bigl{\lfloor}\frac{n+1}{2}\bigr{\rfloor}=\frac{n+1}{2}, we have such that
[TABLE]
This ends the proof. ∎
We next analyze defined in (2.3) and its derivatives with respect to its boundedness properties.
Lemma A.2**.**
For , it holds
[TABLE]
Proof.
Since for all and , see, e.g., [1, 9.6.1], and due to (A.5), the function is positive and monotone decreasing such that for all .
In [1, 9.6.9] one can find for the following behavior of the modified Bessel function of the second kind for :
[TABLE]
As a consequence, we obtain by (2.3)
[TABLE]
which yields together with the foregoing observations the assertion. ∎
Lemma A.3**.**
Let . There exists a constant depending only on , such that for any and it holds
[TABLE]
Proof.
In order to deduce the bounds for the derivatives of , we continue with collecting some auxiliary results. As before in the proof of Lemma A.2, we have that is positive for all and . Let \nu_{0}=\min\bigl{(}\nu,\frac{1}{2}\bigr{)}. From [25, Theorem 5], we obtain for that is a decreasing function for all . To employ this, we consider the product
[TABLE]
and note that
[TABLE]
Hence, admits its maximum in the interval . Due to Lemma A.2, we consequently get by (2.3)
[TABLE]
Next, we are concerned with the bounds for the derivatives of . Employing Lemma A.1 and the relation for , see [1, 9.6.6], we obtain by (2.3)
[TABLE]
where the coefficients are given by Lemma A.1. Let . We observe that since m\leq\bigl{\lfloor}\frac{n}{2}\bigr{\rfloor}. Consequently, (A.8) yields
[TABLE]
with \nu_{0}(m,n)=\min\bigl{(}\nu(m,n),\frac{1}{2}\bigr{)}. Since , it holds
[TABLE]
Further, using
[TABLE]
from [23, estimate (8)], which holds for all and , we get by choosing and
[TABLE]
with a constant depending only on . Using (A.9) and (A.10), we get
[TABLE]
Estimating each summand separately, yields by means of Lemma A.1
[TABLE]
For the last step, notice that
[TABLE]
Finally, (A.11) and (A.12) yield the assertion since \bigl{\lfloor}\frac{n}{2}\bigr{\rfloor}+1\leq 2^{n}. ∎
Finally, we state a result about the exponential decay of and its derivative.
Lemma A.4**.**
The following assertions hold:
- (a)
Let . Moreover, let and . Then there exists a constant only depending on and such that
[TABLE] 2. (b)
Let . Moreover, let and . Then there exists a constant only depending on and such that
[TABLE]
Proof.
We start as in the proof of Lemma A.3. According to [25, Theorem 5], we get for that is a decreasing function. Consequently, having in mind the definition of and that for all and , see the proof of Lemma A.2, we obtain
[TABLE]
This is already the desired result for noticing that for . For , we observe that
[TABLE]
where we used that
[TABLE]
Combining the previous results yields the first inequality of the assertion. Next, we deduce by means of the definition of and (A.5)
[TABLE]
such that the second inequality of the assertion follows from the first one noting that by the assumption on . ∎
Acknowledgement
The authors acknowledge Christian Kahle’s and Martin Stoll’s support in the efficient solution of the arising linear systems.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Abramowitz and I. Stegun. Handbook of Mathematical Functions: With Formulas, Graphs, and Mathematical Tables . Applied mathematics series. Dover Publications, 1964.
- 2[2] G. Acosta, F. M. Bersetche, and J. P. Borthagaray. A short FE implementation for a 2d homogeneous Dirichlet problem of a fractional Laplacian. ar Xiv preprint ar Xiv:1610.05558 , 2016.
- 3[3] G. Acosta, F. M. Bersetche, and J. P. Borthagaray. Finite element approximations for fractional evolution problems. ar Xiv preprint ar Xiv:1705.09815 , 2017.
- 4[4] G. Acosta and J. P. Borthagaray. A fractional Laplace equation: regularity of solutions and finite element approximations. SIAM Journal on Numerical Analysis , 55(2):472–495, 2017.
- 5[5] G. Acosta, J. P. Borthagaray, O. Bruno, and M. Maas. Regularity theory and high order numerical methods for the (1d)-fractional Laplacian. ar Xiv preprint ar Xiv:1608.08443 , 2016.
- 6[6] A. Bonito, W. Lei, and J. E. Pasciak. The approximation of parabolic equations involving fractional powers of elliptic operators. Journal of Computational and Applied Mathematics , 315:32–48, 2017.
- 7[7] A. Bonito, W. Lei, and J. E. Pasciak. Numerical approximation of space-time fractional parabolic equations. ar Xiv preprint ar Xiv:1704.04254 , 2017.
- 8[8] A. Bonito and J. Pasciak. Numerical approximation of fractional powers of elliptic operators. Mathematics of Computation , 84(295):2083–2110, 2015.
