On convergence of a structure preserving difference scheme for two-dimensional space-fractional nonlinear Schrödinger equation and its fast implementation

https://doi.org/10.1016/j.camwa.2021.06.018Get rights and content

Abstract

In this paper we intend to construct a structure preserving difference scheme for two-dimensional space-fractional nonlinear Schrödinger (2D SFNS) equation with the integral fractional Laplacian. The temporal direction is discretized by the modified Crank-Nicolson method, and the spatial variable is approximated by a novel fractional central difference method. The mass and energy conservations and the convergence are rigorously proved for the proposed scheme. For 1D SFNS equation, the convergence relies heavily on the L-norm boundness of the numerical solution of the proposed scheme. However, we cannot obtain the L-norm boundness of the numerical solution by using the similar process for the 2D SFNS equation. One of the major significance of this paper is that we first obtain the L-norm boundness of the numerical solution and L2-norm error estimate via the popular “cut-off” function for the 2D SFNS equation. Further, we reveal that the spatial discretization generates a block-Toeplitz coefficient matrix, and it will be ill-conditioned as the spatial grid mesh number M and the fractional order α increase. Thus, we exploit an linearized iteration algorithm for the nonlinear system, so that it can be efficiently solved by the Krylov subspace solver with a suitable preconditioner, where the 2D fast Fourier transform (2D FFT) is applied in the solver to accelerate the matrix-vector product, and the standard orthogonal projection approach is used to eliminate the drift of mass and energy. Extensive numerical results are reported to confirm the theoretical analysis and high efficiency of the proposed algorithm.

Introduction

Consider the two-dimensional space-fractional nonlinear Schrödinger equationiut(Δ)α2u+β|u|2u=0,(x,y,t)R2×(0,T],u(x,y,0)=φ(x,y),(x,y)R2, where 1<α2, i2=1, and β is the nonlinearity strength (positive for a repulsive/defocusing interaction and negative for an attractive/focusing interaction) [7]. We assume that the functions u and φ are spatially compactly supported on the bounded domain Ω. The integral fractional Laplacian is defined as [25], [28](Δ)α2u(x)=c2,αP.V.R2u(x)u(ξ)|xξ|2+αdξ,c2,α=2αΓ(α+22)π|Γ(α/2)|, where P.V. stands for Cauchy principle value, Γ is the Gamma function, |xξ| denotes the Euclidean distance between points x=(x,y) and ξ=(ξ1,ξ2). Besides, we postulate that the functions u and φ are smooth enough, so that our proposed scheme can attain the desired convergence order.

Schrödinger equation is famous for its applications in quantum mechanics, it is derived by using Feynman path integrals over Brownian process. Recently, Laskin [23] indicated that the path integral over the Lévy process allows us to develop the generalization of the quantum mechanics. Obviously, the Brownian process leads to the classical Schrödinger equation, and the symmetric α-stable Lévy process [26] leads to the space-fractional Schrödinger equation. Such important attempts have attracted growing attentions in many fields, such as nonlinear optics [24], propagation dynamics [42], and water wave dynamics [21]. The theoretical consequences of space-fractional Schrödinger equation, including the well-posedness of the smooth solution, as well as conservations of invariants have been studied, readers can refer [14], [15] and references therein.

It is known to us, the 2D SFNS equation has some physical invariants over the time, such as the mass and energy [22], i.e.,M(t)=R2|u(x,y)|2dxdy=M(0),E(t)=R2[u¯(Δ)α2u(x,y,t)β2|u(x,y,t)|4]dxdy=E(0), where u¯ is the complex conjugate of u. Numerous theoretical and experimental results [13], [16] show that the structure preserving algorithms can preserve the intrinsic physical invariants of original conservative system and often have good numerical properties, such as the excellent long-time behavior, the linear error growth, and smaller amplitude and so on. In the past decades, the invariant-preserving integrator has attracted growing interests due to it preserves as much as possible the invariants of underlying differential systems. The well-known invariant-preserving integrators for conservative systems are about the averaged vector field (AVF) methods [29], the discrete variational derivative (DVD) methods [11] and the Hamiltonian boundary value methods (HBVMs) [2], [3], [4] and so on.

For SFNS equation in 1D space, the convergence analysis strictly relies on the L-norm boundness of numerical solution of the numerical scheme [34], [38]. In fact the proof of L-norm boundness of numerical solution relies heavily on not only the discrete conservative property but also the discrete version of the Sobolev inequality in 1D spaceuCuHα2,uH0α2(Ω),ΩR, which immediately implies an a priori uniform L-norm boundness for numerical solution from the discrete energy formulation. However, we cannot obtain the L-norm boundness of numerical solution for the 2D SFNS equation by using the similar ways.

At present, there are some numerical schemes have been studied for the 2D SFNS equation. Zhao et al. [41] proposed a compact alternating direction implicit difference scheme and obtained the associated convergence result. Wang and Huang [35] constructed a split-step alternating direction implicit difference scheme, and the authors discussed the convergence analysis. Wang et al. [37] established a split-step spectral Galerkin method and analyzed the convergence of the proposed scheme. Zhang et al. [43] considered a compact implicit integration factor method. Nevertheless, the aforementioned numerical schemes cannot prove to be conservative for the 2D SFNS equation in theoretical analysis.

Recently, Wang and Huang [33] proposed a structure preserving difference scheme for the 1D SFNS equation, the authors adopted a “cut-off” function to truncate the nonlinearity to a global Lipschitz function with compact support on domain Ω for 1D SFNS equation, and authors obtained the L2-norm convergence consequence by assuming τh, where τ and h is the time and space step size, respectively. More recently, Yin et al. [39] obtained the same theoretical consequence by extending this technique to the 2D SFNS equation with Riesz derivative. It is worth noting that Wang et al. [36] successful eliminated the time-space step ratio τh by using the “lifting” technique (i.e., by taking the discrete L2-norm of both sides of the “error” equations, the estimate of the higher order difference quotient of the error functions can be obtained from the estimate of the lower order difference quotient of the error functions and local truncation error functions), the authors obtained a unconditional convergence result for the 2D classical nonlinear Schrödinger equation. As a matter of fact, the “lifting” technique relies on a discrete Sobolev inequality in 2D spaceuCu12(|u|H1+u)12,uH01(Ω),ΩR2. However, we cannot apply the “lifting” technique to further obtain the unconditional convergence for 2D SFNS equation, due to the lack of a similar inequality of (1.4).

In the current paper, we construct a novel structure preserving difference scheme for the 2D SFNS equation, where the temporal derivative is approximated by the modified Crank-Nicolson method, and the 2D fractional Laplacian is discretized by a second-order fractional central difference operator [18]. With the help of a “cut-off” function, we prove the L2-norm convergence consequence and the L-norm boundness of numerical solution. In numerical implementations, the preconditioned conjugated gradient is chosen as a linear solver of the fixed iteration for the nonlinear discrete system, where the 2D FFT algorithm is used in the linear solver to accelerate the matrix-vector product. For invariants preservation, we adopt the standard projection method to eliminate the drift of mass and energy of the conservative scheme. Extensive numerical comparisons are provided to verify the feasibility and efficiency of the proposed scheme.

The rest of the paper is organized as follows. In Section 2, we introduce the spatial discretization and associated fractional Sobolev inequality. Next, we construct a structure preserving difference scheme for the 2D SFNS equation in Section 3. In Section 5, we proposed some fast algorithms to improve our computation efficiency. In Section 4, we are given some useful lemmas and the theoretical consequence, including the conservation laws and convergence analysis. In Section 6, we provide some numerical example to verify our numerical scheme. Finally, we draw some conclusions in Section 7.

Section snippets

Preliminaries

In this section, we will introduce some numerical approximations for the 2D fractional Laplacian.

Structure preserving difference scheme

In practical calculation, it needs to restrict the original problem on a bounded domain with homogeneous Dirichlet boundary condition due to the solution of (1.1)-(1.2) is fast decaying [12]. We can select a large domain Ω=(a,b)×(a,b) such thatu|Ωc=0,Ω=(a,b)×(a,b), where a0 and b0.

We choose the positive integers N and M, let τ=T/N and h=(ba)/M be the time and space step, respectively. We define a partition of (0,T]×(a,b)×(a,b) by Ωτ×Ωh with the gridΩτ={tn=nτ|n=1,2,N},Ωh={(xi,yj)=(L+ih,L+jh)|

Theoretical analysis

In this section, we give some useful lemmas, then discuss the conservative laws and the convergence analysis in detail.

Fast implementation

In this section, we pay attentions to the fast implementation of the proposed scheme. Later on, we present a fast projection method to preserve the conservation laws of the conservative scheme.

Numerical examples

In this part, we carry out the simulations by using Matlab R2018a software on a computer with Intel Core i7 and 16 GB RAM. In order to illustrate the efficiency of the proposed fast solvers, we employ the proposed solvers to the 2D SFNS equation for comparisons. For simplicity, we denote the solvers as abbreviations in the following

  • Backslash: the linear system of (5.1) solved by the built-in function “﹨” in Matlab.

  • CGfast: the linear system of (5.1) solved by CG algorithm.

  • PCGfast: the linear system

Conclusion

In this paper, we develop a structure preserving difference scheme for the 2D SFNS equation, the rigorous theoretical analyses are obtained, including the conservative laws, the second-order convergence in L2 and the boundness of numerical solution in L norm. Subsequently, the preconditioned conjugated gradient is provided as linear solver of the fixed iteration, where the 2D FFT algorithm is used in the solver to fast calculate the matrix-vector product. Further, we apply the projection

Acknowledgements

This work is partially supported by the National Key Research and Development Program of China (Grant No. 2018YFC1504205), the National Natural Science Foundation of China (Grants No. 11771213, 61872422, 11971242), the Key Project of Jiangsu University Natural Science Foundation (Grant No. 18KJA110003), the Postgraduate Research & Practice Innovation Program of Jiangsu Province (Grant No. KYCX20_1165), and the Priority Academic Program Development of Jiangsu Higher Education Institutions. The

References (43)

  • P. Wang et al.

    Point-wise error estimate of a conservative difference scheme for the fractional Schrödinger equation

    J. Comput. Appl. Math.

    (2016)
  • P. Wang et al.

    Split-step alternating direction implicit difference scheme for the fractional Schrödinger equation in two dimensions

    Comput. Math. Appl.

    (2016)
  • T. Wang et al.

    Unconditional and optimal H1 error estimate of a Crank-Nicolson finite difference scheme for the nonlinear Schrödinger equation

    J. Math. Anal. Appl.

    (2018)
  • Y. Wang et al.

    Split-step spectral Galerkin method for the two-dimensional nonlinear space-fractional Schrödinger equation

    Appl. Numer. Math.

    (2019)
  • B. Yin et al.

    A structure preserving difference scheme with fast algorithms for high dimensional nonlinear space-fractional Schrödinger equations

    J. Comput. Phys.

    (2021)
  • G. Acosta et al.

    A fractional Laplace equation: regularity of solutions and finite element approximations

    SIAM J. Numer. Anal.

    (2017)
  • L. Brugnano et al.

    Line Integral Methods for Conservative Problems

    (2016)
  • W. Bao et al.

    Optimal error estimates of finite difference methods for the Gross-Pitaevskii equation with angular momentum rotation

    Math. Comput.

    (2011)
  • W. Bao et al.

    Uniform error estimates of finite difference methods for the nonlinear Schrödinger equation with wave operator

    SIAM J. Numer. Anal.

    (2012)
  • W. Bao et al.

    Mathematical theory and numerical methods for Bose-Einstein condensation

    Kinet. Relat. Models

    (2013)
  • A. Bonito et al.

    Numerical approximation of the integral fractional Laplacian

    Numer. Math.

    (2019)
  • Cited by (3)

    • The Hamiltonian structure and fast energy-preserving algorithms for the fractional Klein-Gordon equation

      2022, Computers and Mathematics with Applications
      Citation Excerpt :

      Macías-Díaz developed some structure-preserving algorithms for solving a class of nonlinear dissipative wave equations with Riesz fractional derivatives and analyzed the convergence of these schemes [30–33]. There are many works related to it, the readers can find in Refs. [12,18,20,21]. In the past few years, the methods have been applied to construct energy-conserving schemes for classical partial differential equations.

    • Efficient energy preserving Galerkin–Legendre spectral methods for fractional nonlinear Schrödinger equation with wave operator

      2022, Applied Numerical Mathematics
      Citation Excerpt :

      Moreover, the key of numerical methods is the approximation of fractional derivative. In recent years, a large amount of literature on numerical approaches for the fractional derivative have been studied, such as the finite difference methods [12,13,24,26,45,55], finite element methods [8,32,50] and spectral methods [11,43,47,52,54]. Also, some novel approximations are worth mentioning, for instance, the finite volume methods [15], meshless methods [1] and fractional iteration methods [2,3] and so forth.

    View full text