In this paper, we propose accurate and efficient finite difference methods to
discretize the two- and three-dimensional fractional Laplacian
(−Δ)2α (0<α<2) in hypersingular integral
form. The proposed finite difference methods provide a fractional analogue of
the central difference schemes to the fractional Laplacian, and as α→2−, they collapse to the central difference schemes of the classical Laplace
operator −Δ. We prove that our methods are consistent if u∈C⌊α⌋,α−⌊α⌋+ϵ(Rd),
and the local truncation error is O(hϵ), with ϵ>0 a small constant and ⌊⋅⌋ denoting the floor function. If
u∈C2+⌊α⌋,α−⌊α⌋+ϵ(Rd), they can achieve the
second order of accuracy for any α∈(0,2). These results hold for
any dimension d≥1 and thus improve the existing error estimates for the
finite difference method of the one-dimensional fractional Laplacian. Extensive
numerical experiments are provided and confirm our analytical results. We then
apply our method to solve the fractional Poisson problems and the fractional
Allen-Cahn equations. Numerical simulations suggest that to achieve the second
order of accuracy, the solution of the fractional Poisson problem should {\it
at most} satisfy u∈C1,1(Rd). One merit of our methods is
that they yield a multilevel Toeplitz stiffness matrix, an appealing property
for the development of fast algorithms via the fast Fourier transform (FFT).
Our studies of the two- and three-dimensional fractional Allen-Cahn equations
demonstrate the efficiency of our methods in solving the high-dimensional
fractional problems.Comment: 24 pages, 6 figures, and 6 table