Abstract
We propose in this paper an efficient and accurate numerical method for the spectral fractional Laplacian equation using the Caffarelli–Silvestre extension. In particular, we propose several strategies to deal with the singularity and the additional dimension associated with the extension problem: (i) reducing the \(d+1\) dimensional problem to a sequence of d-dimension Poisson-type problems by using the matrix diagonalizational method; (ii) resolving the singularity by applying the enriched spectral method in the extended dimension. We carry out rigorous analysis for the proposed numerical method, and provide abundant numerical examples to verify the theoretical results and illustrate effectiveness of the proposed method.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
We consider in this paper the fractional Laplacian equation
where \(0<s<1\), \(\Omega \) is an open subset of \({\mathbb {R}}^d,~d\ge 1\) and \((-\Delta )^s\) is defined through the spectral decomposition of \(-\Delta \) with homogeneous Dirichlet boundary conditions. A main difficulty for solving the above equation is that \((-\Delta )^s\) is a non-local operator (see [5, 6]), so analytical and numerical techniques developed for the regular PDEs with locally defined derivatives can not be directly applied. To circumvent the nonlocal difficulty of the fractional Laplacian, Caffarelli and Silvestre [6] (cf. also [4, 7, 25]) showed that the solution of the fractional Laplacian equation u(x) can be obtained through an extension problem on \({\mathbb {R}}^d\times [0,\infty )\), i.e. \(u(x)=U(x,0)\) where U(x, y) solves:
where \(\alpha =1-2s\) and \(d_s=2^{1-2s}{\Gamma (1-s)}/{\Gamma (s)}\). Hence, we only have to solve (1.2) which only involves regular derivatives. However, there are two main difficulties w.r.t. (1.2): (i) it involves a degenerate/singular weight \(y^\alpha \) and the solution is weakly singular at \(y=0\), and (ii) it is of \(d+1\)-dimension while the original problem is of d-dimension.
In a series of papers, Nochetto et al. [21, 22] made a systematical study on the finite-element approximation of Caffarelli–Silvestre extension (1.2), and proposed an adaptive finite-element method for solving the \(d+1\)-dimensional extended problems and derived rigorous error estimates. Chen et al. [8] developed an efficient solver via multilevel techniques to deal with the extension problem, see also a related work in [3, sect.2.7] and references therein. However, achievable accuracy is limited by the low-order finite-element approximations used in these work. Note also that an interesting hybrid FEM-spectral method based on a clever approximation of Laplace eigenvalues for the extension problem is developed in [2]. Some alternative approaches for the spectral fractional Laplacian problem (1.1) include: through the Dunford–Taylor integral [3, 17, 27] and through model reduction using Kato’s formula [11].
The aim of this paper is to develop an efficient and accurate numerical method for the Caffarelli–Silvestre extension (1.2). In particular, we will develop suitable strategies to overcome the two main difficulties outlined above:
Since \(y^\alpha \) is exactly the weight associated with the generalized Laguerre functions, it is natural to use generalized Laguerre functions as basis functions in the y-direction. This will lead to sparse stiffness and mass matrices in the y-direction. However, expansion by the generalized Laguerre functions can not accurately approximate the weakly singular solution at \(y=0\). Therefore, we first determine the singular behavior at \(y=0\) for the solution of (1.2), and then enrich the approximation space by adding a few leading singular terms of the solution. We will show that convergence rate of the enriched spectral method will increase by one for each additional singular term in the approximation space.
Since the extended domain is of tensor-product type, we shall use the matrix diagonalization method [16, 18, 23] to reduce the \(d+1\)-dimensional problem to a sequence of d-dimensional Poisson type equations that can be solved by your favorite method in the original domain. Due to the high accuracy of the discretization in the y-direction, the number of d-dimensional Poisson type equations needed to be solved is relatively small, making the total algorithm accurate as well as efficient.
More precisely, our enriched spectral method in the extended direction coupled with one’s favorite discretization in the original domain for (1.2) enjoys the following advantages: (i) accuracy it can achieve high-order convergence rate in the extended y-direction despite the weak singularity at \(y=0\); (ii) efficiency it only requires solving a small number of Poisson type equation in the original domain ; (iii) flexibility it can be used with any approximation method in the original domain. We will present ample numerical results to show that this method is very effective in dealing with the fractional Laplacian problem. Note that the numerical techniques proposed in this work can also be applied to solving more general fractional elliptical problems through the Cafarelli–Silvestre extension (see [3, 4, 21]).
The paper is organized as follows. In the next section, we introduce some notations, describe the Caffarelli–Silvestre extension, and recall basic properties of generalized Laguerre function and its approximation results. In Sect. 3, we develop a fast spectral Galerkin method using the generalized Laguerre functions for the extension problem, conduct error analysis, and present some supporting numerical results. In Sect. 4, we construct an efficient enriched spectral method to deal with the weak singularity at \(y=0\) for (1.2), carry out a detailed analysis, and present numerical results to validate our analysis. We conclude with a few remarks in Sect. 5.
2 Preliminaries
2.1 Some Functional Spaces and Weak Formulation of the Caffarelli–Silvestre Extension
Let \(\Omega \) be an open, bounded and connected domain in \({\mathbb {R}}^d~(d\ge 1)\) with Lipschitz boundary \(\partial \Omega \), and \( \Lambda :=(0,\infty )\). We denote the semi-infinite cylinder in \({\mathbb {R}}^{d+1}\) and its lateral boundary by
We denote a vector in \({\mathbb {R}}^{d+1}\) by
Let \({\mathcal {Z}}\) be either \(\Lambda \) or \(\Omega \) or \({\mathcal {D}}\), and \(\omega \) be a positive weight function. We denote
and
equipped with norm and semi-norm
We will omit the weight \(\omega \) from the notations when \(\omega \equiv 1\).
In order to study the extension problem (1.2), we define
with the norm
Denote the trace of any function \(v\in {{\mathcal {H}}}^{1,b}_{y^\alpha }({\mathcal {D}})\) by
We recall the following result [22, Proposition 2.5]:
Lemma 2.1
Let \(\Omega \subset {\mathbb {R}}^d\) be a bounded Lipschitz domain and \(\alpha =1-2s\). The trace operator \(\mathbf {tr}\) satisfies \(\mathbf {tr}{{\mathcal {H}}}^{1,b}_{y^\alpha }({\mathcal {D}})={\mathbb {H}}^s(\Omega )\) and
Then, the weak formulation of (1.2) is: Given \(f\in {\mathbb {H}}^{-s}(\Omega )\), find \(U\in {{\mathcal {H}}}^{1,b}_{y^\alpha }({\mathcal {D}})\) such that
The wellposedness of the above weak formulation is a direct consequence of Lax–Milgram lemma and Lemma 2.1.
2.2 Fractional Laplace Operator (Fractional Laplacian)
There are essentially two ways to define the fractional Laplacian operator \((-\Delta )^s\) in a bounded domain, one is defined in the integral form and the other in spectral form [4, 20]. In this paper, we will consider the latter. More precisely, let \(\{\lambda _n,\varphi _n\}\) be the eigenvalues and orthonormal eigenfunctions of the Laplacian with homogeneous Dirichlet boundary conditions, i.e.,
It is well-known that \(0<\lambda _1\le \lambda _2\le \cdots \le \lambda _n\rightarrow +\infty \), and \(\{\varphi _n\}\) forms an orthonormal basis in \(L^2(\Omega )\) space (see [12]). Then, the fractional Laplacian is defined by:
We aslo define the Hilbert space associated with the spectrum of the Laplacian:
Obviously, for any \(s<r\), there exists
2.3 Generalized Laguerre Functions
Since (2.7) involves a singular weight function \(y^\alpha \), it is natural to use the generalized Laguerre function \(\{\widehat{{\mathscr {L}}}^{(\alpha )}_n(y)\}\) which are orthogonal with respect to the weight \(y^\alpha \).
We start by reviewing some basic properties of the generalized Laguerre functions \(\widehat{{\mathscr {L}}}^{(\alpha )}_n(y):=e^{-\frac{y}{2}}{\mathscr {L}}^{(\alpha )}_n(y)\), where \({\mathscr {L}}^{(\alpha )}_n(y)\) is the generalized Laguerre polynomial [1, 24, 26]. It is clear that \(\{\widehat{{\mathscr {L}}}^{(\alpha )}_n(y)\}\) forms a complete basis in \(L^2_{y^\alpha }(\Lambda )\), and they are mutually orthogonal with respect to the weight \(y^\alpha \):
The generalized Laguerre functions can be efficiently and stably computed by the three-term recurrence formula
Denote \(\widehat{{\mathcal {P}}}^y_N=\text {span}\{\widehat{{\mathscr {L}}}_n^{(\alpha )}(y), 0\le n\le N\}\). For any \(u\in L^2_{y^\alpha }(\Lambda )\), we define
Next, we define a generalized derivative by \({\widehat{\partial }}_y={\partial }_y+\frac{1}{2}\) and the corresponding non-uniformly weighted Sobolev space
Lemma 2.2
[24, Theorem 7.9] For any \(u\in {\widehat{B}}^m_\alpha (\Lambda )\) and \(0\le m\le N+1\),
3 A First Galerkin Approximation
In this section, we investigate the Galerkin approximation to (2.7) with generalized Laguerre functions as basis functions in the extended dimension. We shall first derive a fast algorithm for solving the resultant linear system, and then derive an error analysis which reveals, in particular, how the convergence rate is affected by the singularity at \(y=0\).
3.1 Galerkin Approximation
Since the domain \({\mathcal {D}}\) is a tensor-product domain, it is natural to use a tensor-product approximation. Let \(X_h\) be a suitable approximation space in the x-direction,
and
Then, the Galerkin method for (2.7) is to find \(U^h_{N}\in X_{h}\times Y_{N}\) such that
We denote
where \(\mathbf {M}^{x}\) and \(\mathbf {S}^{x}\) are the mass and stiffness matrices in x-direction(s), and \(\mathbf {M}^{y}\) and \(\mathbf {S}^{y}\) are the mass and stiffness matrices in the extended y-direction. We start by deriving explicit formula for \(\mathbf {M}^y\) and \(\mathbf {S}^y\).
Using the relation [24, (7.26)], we find
which implies
Hence,
Then, by the orthogonality (2.11), we find that both \(\mathbf {M}^y\) and \(\mathbf {S}^y\) are symmetric tridiagonal with non-zero entries given by
where \(\gamma ^{(\alpha )}_{-1}=0\) and \(\gamma ^{(\alpha )}_{k}=\Gamma (k+\alpha +1)/\Gamma (k+1)\).
Setting in (3.3)
and taking, successively, \(V(x,y)=\phi ^{x}_i(x) \phi ^y_j(y)\), the equation (3.3) is reduced to the matrix system
3.2 Fast Algorithm with Diagonalization in the Extended Direction
The linear system (3.7) can be efficiently solved by the matrix decomposition method [18], which is also known in the field of spectral methods as the matrix diagonalization method (cf. [16, 23]), as follows.
We first precompute the generalized eigenvalue problem
where \({{\varvec{\Lambda }}}\) is a diagonal matrix whose diagonal entries are eigenvalues \(\{\lambda _i\}\), and the i-th column of \(\mathbf {E}\) is the eigenvector \(\mathbf {e}_i\). Then, setting \(\mathbf{U} =\mathbf{VE} ^{T}\) and using (3.8), we can rewrite (3.7) as
which, thanks to the fact \(\mathbf {E}^T\mathbf {E}=I\), is equivalent to
Let \(\mathbf {v}_i\) and \(\mathbf {g}_i\) be the i-th row of \(\mathbf {V}\) and \(\mathbf {G}\), respectively, we find
We observe that for each i, (3.11) is simply the linear system resulted from the Galerkin approximation in \(X_h\) of the Poisson type equation
which can be efficiently solved by your favorite method at a cost of C(M) flops, where, for instance, \(C(M)=O(M)\) with a multigrid finite-element method, or \(C(M)=O(M^{(d+1)})\) with a spectral method with d being the spatial dimension.
To summarize, we can solve (3.7) with the following procedure:
- Step 1
Compute \(\mathbf {G}=\mathbf {F}(\mathbf {S}^{y})^{-1} \mathbf {E}\) (\(O(N^2M)\) flops since \(\mathbf {S}^{y}\) is tridiagonal );
- Step 2
Solve \(\mathbf {v}_i\) from (3.11) for \(i=1,\ldots , N\) (NC(M) flops);
- Step 3
Set \(\mathbf {U}=\mathbf {V}\mathbf {E}^T\), (\(O(N^2M)\) flops).
We hope that \(N\ll M\) so the cost is dominated by the second step, which is a small number N times the cost for solving one regular Poisson type equation in \(\Omega \).
3.3 Error Estimate
To better describe the error, we introduce the weighted Hilbert space
The results in Lemma 2.2 does not provide a projection error in the \(H^1_{y^\alpha }(\Lambda )\) norm. It has to be derived separately as follows.
Lemma 3.1
For any \(u\in H^1_{y^\alpha }(\Lambda )\cap {\widehat{B}}^{m}_\alpha (\Lambda )\) and \(\partial _yu\in {\widehat{B}}^{m-1}_\alpha (\Lambda )\), \(m\ge 2\), we have
where generalized derivative operator \({\widehat{\partial }}_y= \partial _y+1/2\) is defined in (3.4).
Proof
For any \(u\in L^2_{y^\alpha } (\Lambda )\), we can expand u and its projection as follows
We denote \({\tilde{u}}_k^s=\sum \limits _{n=k+1}^{\infty }{\tilde{u}}_n\). Applying (3.4) and the definition \({\widehat{\partial }}_y=\partial _y+1/2\) into the above expansion leads to
Similarly, we have
Combing the above identities, we derive
For any \({\widehat{\partial }}_y u\in {\widehat{B}}^{m-1}_\alpha (\Lambda ),~\alpha >-1\), we have
Moreover, thanks to [15, (3.8)–(3.10)], there exist a positive constant c such that
Then, using the triangle inequality
and combing (3.14)–(3.16) and Lemma 2.2, we arrive at
\(\square \)
The following result is now a direct consequence of the above lemma and Lemma 2.2 with \(l=0\).
Theorem 3.1
For any \(u\in H^1_{y^\alpha }(\Lambda )\cap {\widehat{B}}^{m}_\alpha (\Lambda )\) and \(\partial _yu\in {\widehat{B}}^{m-1}_\alpha (\Lambda )\), \(2\le m\le N+1\),
We are now in position to derive error estimate for our Galerkin approximation (3.3).
Theorem 3.2
Let U and \(U^h_N\) be the solutions to the weak problem (2.7) and the numerical problem (3.3), respectively. If \(U(x,\cdot )\in H^1_{y^\alpha }(\Lambda )\cap {\widehat{B}}^{m}_\alpha (\Lambda )\) and \(\partial _yU(x,\cdot )\in {\widehat{B}}^{m-1}_\alpha (\Lambda )\), \(2\le m\le N+1\), then there exists
Proof
which implies that
namely,
Next, let \(\pi _N^y\) be the Laguerre orthogonal projection defined in (2.13) and \(\pi ^{x}_h\) be a projection operator defined by
Substituting \(V=\pi _N^y\pi ^{x}_h~U\) in (3.19) results in
Let \({\mathcal {I}}\) be the identity operator, then
Thanks to Lemmas 2.2 and 3.1, the first term on the right hand side satisfies
Furthermore, via (2.14) and (3.12), the second term can be estimated that
Finally we end the proof by combing the above estimates. \(\square \)
3.4 Numerical Examples
The result (3.18) indicates that the error estimate for the extension problem consists of two parts: the first two terms are the approximation errors of \(X_h\) in the x-direction; the last term is a typical Laguerre-spectral approximation result in the extended direction y, whose convergence rate only depends on the solution’s regularity in the specified norms, with the potential of being faster than any algebraic rate should the solution in the specified norms be bounded for any m. Unfortunately, unless with \(s=0.5\), solutions of the extension problem do not have enough regularity in the specified norm as we show below.
Consider, for example, the following one-dimension fractional Laplacian problem
The associated Caffarelli–Silvestre extension problem can be read as
where \(d_s=2^{1-2s}\frac{\Gamma (1-s)}{\Gamma (s)}\) and \(\alpha =1-2s,~0<s<1,~s\ne \frac{1}{2}\). Then, we have the following numerical scheme: Find \(U^h_{N}\in X_h\times Y_{N}\) such that
We select the generalized Jacobi polynomials [10, 13, 14, 26]
as the basis in x direction to derive the corresponding stiffness matrix \(\mathbf {S}^{x}\) and mass matrix \(\mathbf {M}^{x}\). Indeed, via the relations
their entries can be calculated out exactly that
For the resource term \(f(x)=\pi ^{2s} \sin (\pi x)\), the solution \(u(x)=\sin (\pi x)\) can be detected from the definition of the fractional Laplace operator. We first test the efficiency of the numerical method to the extension problem (3.22) with smooth solution with \(s=0.5\). Figure 1 exhibits the high accuracy and efficiency (exponential decay) of the spectral scheme (3.23), in which M and N are degrees of the freedom in x direction and y direction respectively, the ’error’ is the difference between \(U_N^h(x,0)\) and u(x).
The approximation result (3.18) showed that the convergence rate doesn’t only rely on the regularity in the x direction, the regularity of the y direction also can determine the efficiency of the spectral method. In fact, we will provide a detail in the next section that the regularity of the solution U(x, y) is quite low in y direction except the special case \(s=0.5\). Hence, the convergence rate is slow even though we choose the smooth function \(u=\sin (\pi x)\) as the solution of the fractional Laplacian problem (3.21). Figure 2 verified the theoretical result of Theorem 3.2, in which we test the numerical method with different parameter s. Besides the case \(s=0.5\), the others converge to the solution u inefficiently due to the low regularity of solutions in y direction.
4 Galerkin Approximation with Enriched Space in Extended Direction
The Caffarelli–Silvestre extension transformed the complicated d-dimension fractional Laplacian problem into a simple \(d+1\)-dimension second order differential equation which provided a new strategy to deal with problems involving fractional Laplacian. The Galerkin method proposed in the previous section shows the convenience of the fast algorithm. However, as stated in the numerical examples of the previous section, the low regularity in y direction seriously deteriorates the convergence rate of the usual numerical method. To overcome this, we will use the enriched spectral method (see [9]) to improve the numerical method and enhance its convergence rate in this section.
4.1 Enriched Spectral Method for a Sturm–Liouville Problem
We are concerned with the implementation of the enriched spectral method to the following Sturm–Liouville problem
where \(\lambda >0\) and \(\alpha =1-2s,~s\in (0,1).\) The solution \(\psi (y)\) with different parameter \(\lambda >0\) coincides with the basis arisen in the solution of the Caffarelli–Silvestre extension. So It’s absolutely necessary to figure out the above Sturm–Liouville problem for designing efficient and accurate numerical method to solve the \(d+1\) dimensional extension problem.
Thanks to [7, Proposition 2.1], the solution of the above problem could be written as
where Bessel functions
In detail, for \(s\in (0,1)/\{\frac{1}{2}\},\)
Furthermore, it can be detected that
That results in
4.1.1 Laguerre Spectral Method
Now we are ready to construct the variational formula of the Sturm–Liouville problem (4.1), it can be read as to find \(\psi \in { H}^1_{y^\alpha }(\Lambda )\) such that
It’s evident that for any \(\lambda >0\),
Moreover, for any \(-1<\alpha <1\),
Then, owe to Lax–Milgram Lemma, the variational problem admits an unique solution.
In accordance with the variational formulation (4.4), the related Laguerre-spectral scheme is to find \(\psi _N\in Y_N\) such that
where \(0<s<1\), \(\lambda >0\) and \(d_s=2^{1-2s}{\Gamma (1-s)}/{\Gamma (s)}\) are the same as before. By elliptic condition (4.5), it’s easy to obtain by following classical Galerkin method that
Then, by taking \(v=\pi ^{y}_N \psi \), it can be derived from Theorem 3.1 that
The convergence rate index m strictly relies on the regularity of the solution \(\psi \). It’s easy to observe from (4.3) that the regularity of the function \(\psi \) is quite low near \(y=0\) and behaves as
where g(y) is smooth near the origin \(y=0\).
Remark 4.1
Via the expression (4.3), the coefficient \(s_1\) can be exactly calculated out that
in which the second equality owes to Euler reflection formula \(\pi /\sin (s\pi )=\Gamma (s)\Gamma (1-s)\).
Remark 4.2
The above singularity analysis near \(y=0\) is indispensable for subsequent error analysis of the Caffarelli–Silvestre extension in the next section.
In fact, for any \(\alpha \in (-1,1)/\{0\}\), in order to bound \(\Vert {\widehat{\partial }}^m_y \psi \Vert _{y^{\alpha +m},\Lambda }\) and \(\Vert {\widehat{\partial }}^m_y \psi \Vert _{y^{\alpha +m-1},\Lambda }\), the index m must be less than \(2-\alpha \). This is a quite low convergence rate which leads to low-efficiency of the Laguerre-spectral method, so we need to design a more efficient numerical method for solving Sturm–Liouville problem (4.1).
A reasonable attack is to split several low regular terms from the solution \(\psi \) as the basis adding into the original smooth basis space \(Y_N\). In reality, near the origin \(y=0\), function \(\psi (y)\) can be expanded by Taylor formula as
Moreover, functions \(\psi \) is completely monotonic (see [19]), which implies that the solution \(\psi \) exponentially converges to zero as \(y\rightarrow \infty \). Hence, the solution \(\psi \) can be split into
where constants \(s_i=s_1c_i,~i=2,\ldots ,k\) and \({\tilde{g}}(y)\) is a smooth function defined on \(\Lambda \cup \{0\}\). For the sake of simplicity, we denote
4.1.2 Enriched Laguerre Spectral Method
Our new numerical method can be read as: find \(\psi ^k_N\in {Y}^{k}_{N}\) such that
Following the same way as the spectral method results in the estimate below
Due to
then, by taking
and applying Theorem 3.1, we have
in which m is the largest integer such that \(\Vert {\widehat{\partial }}^m_y {\widetilde{\psi }}\Vert _{y^{\alpha +m-1}}<\infty \), \({\widehat{\partial }}^m_y=(\partial _y+1/2)^m\).
Hence, the approximate estimate of the enriched spectral method can be concluded as a theorem as follows
Theorem 4.1
Let \(\psi ^k_N\) and \(\psi \) be solutions of the enriched spectral scheme (4.11) and the variational form (4.4), respectively. Then it holds
where \(m=2k+1+[1-\alpha ]\) and \([1-\alpha ]\) is the integer part of \(1-\alpha =2s\).
Remark 4.3
Since \(\psi \) is monotonic (see [19]), function \({\tilde{\psi }}(y)=\psi (y)-\sum _{i=1}^{k} s_i\, {\mathcal {S}}_i(y)\) is smooth in \(\Lambda \) except at the origin \(y=0\). Moreover, we can detect from the above analysis that: i) the range of the function \({\tilde{\psi }}\) relies on parameter \(\sqrt{\lambda }\); ii) the singularity near \(y=0\) behaves as \(y^{k+1-\alpha }\).
Remark 4.4
In view of the expression of functions
it can be shown that for \(\lambda \gg 1\),
In fact, via the derivative relation \(\partial _y^m=\lambda ^{\frac{m}{2}}\partial _z^m,\,z=\sqrt{\lambda }y\) and \({\widehat{\partial }}_y=\partial _y+1/2\), the above relations are the direct consequence.
4.1.3 Numerical Implementation
In order to derive a fast algorithm for enriched spectral method, we choose the basis and test functions as follows
The numerical solution of the enriched spectral method can be expanded as
Then, by taking \(v=\phi ^y_n(y),~{\mathcal {S}}_i(y),~n=1,2,\ldots ,N,~i=1,2,\ldots ,k\) successively, the enriched Laguerre-spectral scheme (4.11) is equivalent to matrix system below
where the coefficient vectors \(\mathbf {\mathbf {c}}=[{\tilde{c}}_{1} ~{\tilde{c}}_{2} ~\ldots ~{\tilde{c}}_{N} ]^T\) and \(\mathbf {\mathbf {s}}=[{\tilde{s}}_{1} ~{\tilde{s}}_{2}~\ldots ~{\tilde{s}}_{k}]^T\) and
The reader undoubtedly has already found that \(\mathbf {S}_{A}^e\) and \(\mathbf {M}_{A}^e\) are the same as the y directional matrixes \(\mathbf {S}^y\) and \(\mathbf {M}^y\) defined in the previous section.
Since the low regularity (when \(y\rightarrow 0^+\)) severely deteriorates the convergence rate of spectral scheme (4.6), we prefer to use enriched spectral scheme (4.11) to improve the computional efficiency. However, matrixes
are ill-conditional due to combining two distinct basis groups \(\{\phi ^y_n\}_{n=1}^N\) and \(\{{\mathcal {S}}_i\}_{i=1}^k\) in the same numerical scheme. To circumvent this barrier, we apply Schur complement method in the practical implementation. Indeed, we can rewrite the matrix system (4.13) as
Alternatively,
where
Then, the coefficient vectors \(\mathbf {\mathbf {s}}\) and \(\mathbf {\mathbf {c}}\) can be derived from Schur complement
Owe to \(\mathbf {A}=\mathbf {S}_{A}^e+\lambda \mathbf {M}_{A}^e\) is tridiagonal, matrixes \(\mathbf {A}^{-1}\mathbf {B}\), \(\mathbf {A}^{-1}\mathbf {\mathbf {f}}\) and vector \(\mathbf {\mathbf {c}}\) can be obtained in O(N) operations instead of \(O(N^{3})\) required by Gaussian elimination.
4.1.4 Numerical Results
From the observation of the exact solution (4.2), we know that \(\psi (y)=e^{-\sqrt{\lambda }y}\) is a smooth function when \(s=0.5\), i.e. \(\alpha =1-2s=0\), so the spectral scheme (4.6) is efficient to approximate the solution, which can be verified by the numerical experiment in the left of the Fig. 3. However, the cases with \(s=0.31\) and \(s=0.82\) show that the same method does not work well for \(s\in (0,1)/\{0.5\}\) due to the low regularity of the solution \(\psi (y)=\frac{2^{1-s}}{\Gamma (s)}(\sqrt{\lambda }y)^s K_s(\sqrt{\lambda }y)\).
Theorem 4.1 showed that the enriched spectral method (4.11) can enhance the computational efficiency and improve the numerical results. We apply this method to the singular case with \(s=0.31\). The results are shown in the right of the Fig. 3 which exhibits that the enriched spectral method does enhance the convergence rate significantly by adding k leading singular terms. However, since the singular terms are not orthogonal, they lead to very ill conditioned system as k increases. we observe in Fig. 3 that, if adding too many singular terms, the convergence rate may deteriorate due to the ill-conditioning.
From Remark 4.1, we have the exact value of the coefficient of the singular term \({\mathcal {S}}_1(y)\) that \(s_1=\frac{-\Gamma (1-s)}{4^s\Gamma (1+s)}\lambda ^s\). The corresponding approximate value \({\tilde{s}}_1\) can be derived from the Schur complement method (4.17). In Table 1, we fix parameters \(\lambda =10,~s=0.3\) and \(k=3\), and test the accuracy of the approximate value of the coefficient \(s_1\). In Table 2, we test the accuracy for different values of the parameter \(\lambda \) with fixed \(N=80\). The numerical results show that the accuracy is lower for the two extremes ( \(\lambda =1000\) or \(\lambda =10^{-5}\)). This verifies the result of Theorem 4.1 that the error estimate relies on \({\max \{1,\lambda ^{-1}\}}\), and function \({\widehat{\partial }}^m_y {\widetilde{\psi }}\) involving the parameter \(\lambda \).
Theorem 4.1 showed that the error \(\Vert \psi ^k_N-\psi \Vert _{1,y^\alpha ,\Lambda }\) enjoys the convergence rate \({N^{-\frac{[1+2s]}{2}-k}}\). In order to further verify the theoretical result, we plot the error curves and their theoretical convergence rate in Fig. 4.
4.2 Enriched Spectral Method for the Caffarelli–Silvestre Extension
The solution of the fractional Laplacian problem (1.1) can be derived from the Caffarelli–Silvestre extension (1.2), i.e. \(u(x)=U(x,0)\). Indeed, owe to [4, Lemma 2.2] and [7, Proposition 2.1],
where \(\psi _n(y),~n=1,2,\ldots \) are the eigenfunctions of the Sturm–Liouville problem (4.1) with some determined eigenvalues \(\lambda _n\). That implies that there exists singularity in y direction affects the convergence rate, we need to apply enriched spectral method in y-axis.
4.2.1 Enriched Spectral Scheme
The enriched spectral approximation is to find \(U^h_{N,k}\in X_{h}\times Y^{k}_{N}\) such that
Obviously, the numerical solution can be expanded as
where \( \phi ^y_n(y)\) and \({\mathcal {S}}_i(y)\) are the same as the basis in the Sturm–Liouville case. By taking
successively, we obtain the matrix system
where \(\mathbf {U}:=({\tilde{u}}_{mn})_{M\times N}\) and \(\mathbf {U}^s:=({\tilde{u}}^s_{mj})_{M\times k}\) are the coefficients matrixes and
The y-directional matrixes
are the same as (4.15) arose in the case of the Sturm–Liouville problem. The notation \(\otimes \) represents the Kronecker product and \({\overrightarrow{{\mathbf {X}}}}\) is the vectorization of the matrix \(\mathbf {X}\) formed by stacking the columns of \(\mathbf{X} \) into a single column vector.
We further denote
then there exists a equivalent form of the matrix system (4.20) below,
Using the fast algorithm provided in Sect. 3.2, the above matrix system can be resolved efficiently by matrix diagonalization method in y direction.
4.3 Error Estimate
Combing variational formulation (2.7) and numerical scheme (4.19) leads to
Then, via Cauchy–Schwarz inequality, we have that for any \(\Phi \in X_{h}\times Y^k_{N}\)
namely,
As shown in (4.18) that the solutions of the Caffarelli–Silvestre extension problem and the related fractional Laplacian problem could be respectively expressed as
where the orthonormal basis \(\phi _n(x)\) is the eigenfunction of the classical Laplace eigenvalue problem (2.8) with the corresponding eigenvalue \(\lambda _n\); the function \(\psi _n(y)\) is the solution of the Sturm–Liouville problem (4.1) with parameter \(\lambda =\lambda _n\).
Owe to the analysis of Sturm–Liouville problem in previous section, the function \(\psi _n(y)\) can be split as
where constants \(\{c^i_n\}_{i=1}^k\) are the coefficients of the weak singular terms \(\{{\mathcal {S}}_i(y)=y^{i-\alpha }e^{-\frac{y}{2}}\}_{i=1}^k\). So function \({\tilde{\psi }}_n(y)\) is a smooth function in \(\Lambda \) with regularity behaves as \(y^{k+1-\alpha }\) near \(y=0\). Similar to the analysis in Remark 4.4, it holds that for \(\lambda \gg 1\),
Without loss of generality, we denote \(\pi ^{x}_h\) an efficient approximation operator in x directions and assume that for \(\sigma =0,1\) and positive integer r
where operator \(\nabla ^{2k} :=\Delta ^k\) and \(\nabla ^{2k+1} :=\nabla \Delta ^k\) for any integer k.
Then, by taking \(\Phi \in X_{h}\times Y^k_{N}\) such that
we have the following error estimate.
Theorem 4.2
Let U and \(U^h_{N,k}\) be the solutions to the weak problem (2.7) and the numerical problem (4.19), respectively. If \(f\in {\mathbb {H}}^{l-s}(\Omega ),~l=\max \{\frac{m}{2},r+\frac{1}{2}\}\), then it holds
where \(\alpha =1-2s\) and \(m=2k+1+[2s]\).
Proof
Owe to the inequality (4.22) and the triangle inequality, we have
where
First of all, Thanks to Lemmas 2.2 and 3.1 and the equation (4.25), we can derive that
Then, via the relation \({\tilde{f}}_n={\tilde{u}}_n(\lambda _n)^{s}={\tilde{u}}_n(\lambda _n)^{\frac{1-\alpha }{2}},\) it holds
Next, for notational simplicity, we denote \({\tilde{U}}_N:=\sum _{n=1}^\infty ~{\tilde{u}}_n\phi _n(x)\,\pi _N^y{\widetilde{\psi }}_n(y)\), then
The last inequality of the above equation holds due to \(f\in {\mathbb {H}}^{r+\alpha /2}(\Omega )\) implies the boundedness of the above norms \(\Vert \nabla _x^r{\tilde{U}}_N\Vert ^2_{y^\alpha ,{\mathcal {D}}}\) and \(\Vert \nabla _x^r\partial _y{\tilde{U}}_N)\Vert ^2_{y^\alpha ,{\mathcal {D}}}\). In fact, owe to Lemmas 2.2, 3.1 and relation (4.23), we have
and
In addition,
Then, via the above relations, it can be shown that
Using the relation \({\tilde{f}}_n={\tilde{u}}_n(\lambda _n)^{s}={\tilde{u}}_n(\lambda _n)^{\frac{1-\alpha }{2}}\) again, we have
Finally, we end the proof by combing (4.27)–(4.29). \(\square \)
Thanks to Lemma 2.1, we have the error estimate for the original fractional Laplacian problem below
Theorem 4.3
Let u and \(U^h_{N,k}\) be the solutions to the fractional Laplacian problem (1.1) and the numerical problem (4.19), respectively. If
then it holds
Remark 4.5
One can selects a preferred method to deal with x directions, the operator \(\pi ^{x}_h\) is determined by the related numerical method. What we are concerned with in the above consequence is to remove the effect of the y directional singularity caused by the Caffarelli–Silvestre extension.
4.4 Numerical Examples
By following the procedure (4.19)–(4.20), we can solve the Caffarelli–Silvestre extension by the enriched spectral method. To complete the implementation, it remains to select the basis defined on \(\Omega \) to obtain the corresponding stiffness matrix \(\mathbf {S}^{x}\) and mass matrix \(\mathbf {M}^{x}\). For the sake of simplicity, we will only consider the rectangular domains \(\Omega =(-1,1)^d\), although one can easily deal with general domains with finite elements.
For each \(i=1,\cdots ,d\), let \(\{\phi _{m}(x_i)\}_{m=1}^{M_i}\) be a set of basis functions in the direction \(x_i\) satisfying \(\phi _{m}(\pm 1)=0\), and set
Then we define our d-dimensional approximation space by
Let \(\mathbf {M}_i^{x}\) and \(\mathbf {S}_i^{x}\) be respectively the one dimensional mass and stiffness matrices, then the d-dimensional mass and stiffness matrices can be written as the following Kroneck product form
Then our enriched Jacobi–Laguerre spectral scheme is to find \(U^h_{N,k}\in X_h\times Y^{k}_{N}\) such that
where \(Y^{k}_{N}\) is the same as (4.10). We recall that the above enriched spectral method can be reduced to a sequence of Poisson type problem (3.11) which can then be solved efficiently by using a matrix diagonalization approach.
We shall consider two specific choices for \(\phi _{m}(x_i)\) below.
Piecewise linear finite elements We choose \(\phi _{m}(x_i)\) to be the usual hat function.
Spectral methods We take \(\phi _{m}(x_i)=P_{m+1}^{-1,-1}(x_i)\) where \(\{P_j^{-1,-1}(x)\}\) are the generalized Jacobi function of index \((-1,-1)\).
Since the exact solution u is usually not available for general f, so a reasonable approach is to take a reference solution \(u_K,\,K\gg 1\) via the definition of the fractional Laplacian (2.9). In fact, the eigenvalues and eigenfunctions of the problem (2.8) to our case are
we have the reference solution \(u_K=\sum _{n=1}^K \lambda _n^{-s} {\tilde{f}}_n \varphi _n(x)\), where \(\{{\tilde{f}}_n\}_{n=1}^\infty \) are the coefficients such that \(f(x)=\sum _{n=1}^\infty {\tilde{f}}_n \varphi _n(x).\)
As the first example, we take \(f=(1-x^2)^r\) and compute a reference resolution as described above. We use the piecewise linear finite element method in the x-direction, and plot the numerical convergence rates with \(r=0, 1\) and \(s=0.7\) in Fig. 5. We observe that the usual spectral method (in the y-direction) barely converges, but the enriched spectral method improves the convergence rate significantly.
Next, we consider a two-dimensional example with
Thanks to the definition of the fractional Laplacian (2.9), we can easily find the exact solution to be \(u(x_1,x_2)=\sin (\pi x_1)\sin (\pi x_2).\) This example was also considered in [22].
We first use the finite element method in the spatial directions and plot the convergence rates in Fig. 6. We observe that even though the exact solution is smooth, the usual spectral method in the extended direction still barely converges due to the singularity of the extension problem. However, the enriched spectral method improves the convergence rate significantly.
Note also that for both examples, the convergence rates with respect to \(h=1/M\) are essentially second order, which is the expected rate for the \(L^2\)-error by the piecewise linear finite-elements, until the errors are dominated by the errors in the extended direction.
Then, we use the spectral method in the spatial directions, and plot the results in Fig. 7. On the left of Fig. 7, we fix the number of modes in each spatial direction at \(M=20\) which is enough since the exact solution is smooth, and plot the convergence rates with respect to N for various s with \(k=2\). As expected, the convergence rate is algebraic due to the singularity at \(y=0\). On the right of Fig. 7, we fix \(N=80\) and \(k=2\) so that for the range of M considered, the dominating error is in the spatial direction. We observe that the error converges exponentially with respect to the number of modes in each spatial direction.
We also observe in these examples that only very few degrees of freedom, \(N+k\), in the extended direction y are needed to achieve high accuracy in the y direction. So the enriched spectral method with the matrix diagonalization method allows us to solve the fractional Laplacian problem by solving only a relative small number of Poisson type equations in the original domain.
5 Concluding Remarks
We proposed in this paper an efficient numerical method for the spectral fraction Laplacian problem through the Caffarelli–Silvestre extension. The method combines a generalized Laguerre approximation with an enriched spectral method in the extended direction to deal with the singularity at \(y=0\), and uses a diagonalization approach to decouple the \(d+1\) dimensional extension problem into a sequence of Poisson type equations in the original domain which can be solved with one’s favorite method. The new method enjoys high-order accuracy, efficiency and flexibility. We also derived error estimates which show that we can achieve arbitrary high-order accuracy in the extended direction using the enriched spectral method, although the enriched method leads to very ill conditioned system which effectively limits the number of enriched terms that can be added, but our numerical results indicate that only a few (usually less than three) singular functions would dramatically improve the accuracy to a satisfactory level.
References
Abramowitz, M., Stegun, I.A., Miller, D.: Handbook of Mathematical Functions With Formulas. Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55). US GPO (1965)
Ainsworth, M., Glusa, C.: Hybrid finite element-spectral method for the fractional Laplacian: approximation theory and efficient solver. SIAM J. Sci. Comput. 40(4), A2383–A2405 (2018)
Bonito, A., Borthagaray, J.P., Nochetto, R.H., Otárola, E., Salgado, A.J.: Numerical methods for fractional diffusion. Comput. Vis. Sci. 19, 1–28 (2018)
Brändle, C., Colorado, E., de Pablo, A., Sánchez, U.: A concave convex elliptic problem involving the fractional Laplacian. Proc. R. Soc. Edinb. 143(01), 39–71 (2013)
Cabre, X., Sire, Y.: Nonlinear equations for fractional Laplacians II: existence, uniqueness, and qualitative properties of solutions. Trans. Am. Math. Soc. 367(2), 911–941 (2014)
Caffarelli, L., Silvestre, L.: An extension problem related to the fractional Laplacian. Commun. Part. Differ. Equ. 32(8), 1245–1260 (2007)
Capella, A., Dávila, J., Dupaigne, L., Sire, Y.: Regularity of radial extremal solutions for some non-local semilinear equations. Commun. Part. Differ. Equ. 36(8), 1353–1384 (2011)
Chen, L., Nochetto, R.H., Otárola, E., Salgado, A.J.: Multilevel methods for nonuniformly elliptic operators and fractional diffusion. Math. Comput. 85(302), 1 (2016)
Chen, S., Shen, J.: Enriched spectral methods and applications to problems with weakly singular solutions. J. Sci. Comput. 77(3), 1468–1489 (2018)
Chen, S., Shen, J., Wang, L.L.: Generalized Jacobi functions and their applications to fractional differential equations. Math. Comput. 85(300), 1603–1638 (2016)
Dinh, H., Antil, H., Chen, Y., Cherkaev, E., Narayan, A.: Model reduction for fractional elliptic problems using Kato’s formula. arXiv:1904.09332 (2019)
Evans, L.: Partial Differential Equations, vol. 19, 2nd edn. American Mathematical Society, Providence (2010)
Guo, B.Y., Shen, J., Wang, L.L.: Optimal spectral-galerkin methods using generalized Jacobi polynomials. J. Sci. Comput. 27(1), 305–322 (2006)
Guo, B.Y., Shen, J., Wang, L.L.: Generalized Jacobi polynomials/functions and their applications. Appl. Numer. Math. 59(5), 1011–1028 (2009)
Guo, B.Y., Wang, L.L., Wang, Z.Q.: Generalized Laguerre interpolation and pseudospectral method for unbounded domains. SIAM J. Numer. Anal. 43(6), 2567–2589 (2006)
Haidvogel, D.B., Zang, T.: The accurate solution of Poisson’s equation by expansion in Chebyshev polynomials. J. Comput. Phys. 30(2), 167–180 (1979)
Lunardi, A.: Interpolation Theory, 2nd edn. Appunti. Scuola Normale Superiore di Pisa (Nuova Serie). Edizioni della Normale, Pisa (2009)
Lynch, R.E., Rice, J.R., Thomas, D.H.: Direct solution of partial difference equations by tensor product methods. Numer. Math. 6(1), 185–199 (1964)
Miller, K.S., Samko, S.G.: Completely monotonic functions. Integr. Transf. Spec. Funct. 12(4), 389–402 (2001)
Nezza, E.D., Palatucci, G., Valdinoci, E.: Hitchhiker’s guide to the fractional Sobolev spaces. Bull. Sci. Math. 136(5), 521–573 (2012)
Nochetto, R.H., Otárola, E., Salgado, A.J.: A PDE approach to space-time fractional parabolic problems. SIAM J. Numer. Anal. 54(2), 848–873 (2016)
Nochetto, R.H., Otárola, E., Salgado, A.J.: A PDE approach to fractional diffusion in general domains: a priori error analysis. Found. Comput. Math. 15(3), 733–791 (2014)
Shen, J.: Efficient spectral-galerkin method i. direct solvers of second-and fourth-order equations using legendre polynomials. SIAM J. Sci. Comput. 15(6), 1489–1505 (1994)
Shen, J., Tang, T., Wang, L.L.: Spectral Methods: Algorithms, Analysis and Applications. Springer, Berlin (2011)
Stinga, P.R., Torrea, J.L.: Extension problem and Harnack’s inequality for some fractional operators. Commun. Part. Differ. Equ. 35(11), 2092–2122 (2010)
Szego, G.: Orthogonal Polynomials, vol. 23 of amer. In Math. Soc. Colloq. Publ., Amer. Math. Soc., Providence (1975)
Yosida, K.: Functional Analysis. Second edition. Die Grundlehren der mathematischen Wissenschaften, Band 123. Springer, New York (1968)
Acknowledgements
J.S. would like to thank Professor Ricardo Nochetto for stimulating discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
S.C. is partially supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (Grant No. BK20181002), the National Natural Science Foundation for the Youth of China (Grant No. 11801235) and the Postdoctoral Science Foundation of China (Grant Nos. BX20180032, 2019M650459).
J.S. is partially supported by NSFC 11971407 and 91630204, and NSF DMS-1720442.
Rights and permissions
About this article
Cite this article
Chen, S., Shen, J. An Efficient and Accurate Numerical Method for the Spectral Fractional Laplacian Equation. J Sci Comput 82, 17 (2020). https://doi.org/10.1007/s10915-019-01122-x
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10915-019-01122-x