Convergence of a Structure-Preserving Scheme for the Space-Fractional Ginzburg–Landau–Schrödinger Equation

Abstract

We present a linearly implicit and structure-preserving scheme to solve the space-fractional Ginzburg–Landau–Schrödinger equation. The fully discrete scheme is obtained by combining the modified leap-frog method in the temporal direction and the finite difference methods in the spatial direction. It is shown that the scheme can be unconditionally energy-stable. In particular, the equation becomes the space-fractional Schrödinger equation. Then, the scheme can keep both the discrete mass and energy conserved. Moreover, convergence of the scheme is obtained. Numerical experiments are performed to confirm the theoretical results.

1. Introduction

We aim to propose structure-preserving and fully discrete numerical methods for solving the following space-fractional Ginzburg–Landau–Schrödinger equation:

$$(\alpha -i\beta ){\phi }_t+{(-\Delta )}^{{\displaystyle \frac{\gamma }{2}}}{\phi -(1-|\phi |}^2)\phi =0,x\in \mathrm{\Omega },t>0,$$

(1)

with the initial condition

$$\phi (x,0)={\phi }_0\left(x\right)$$

where $i=\sqrt{-1}$ denotes the imaginary unit and $\alpha \ge 0$, $\beta \ge 0$, and $1<\gamma <2$ are constants. The space-fractional operator is the Riesz fractional derivative, defined as

$$-{(-\Delta )}^{\gamma /2}\phi (x,t)=-{\displaystyle \frac{1}{2cos\left(\frac{\pi \gamma }{2}\right)}}\left({}_{-\infty }\mathrm{D}_x^{\gamma }\phi (x,t)+{}_x\mathrm{D}_{+\infty }^{\gamma }\phi (x,t)\right),$$

where ${}_{-\infty }\mathrm{D}_x^{\gamma }\phi (x,t)$ and ${}_x\mathrm{D}_{+\infty }^{\gamma }\phi (x,t)$ are the left and right Riemann–Liouville derivatives, respectively. In particular, when $\alpha =0$ and $\beta \ne 0$, Equation (1) becomes the usual space-fractional Schrödinger equation, which is widely used to describe non-Markovian evolution in quantum mechanics and physics [1,2]. When $\alpha \ne 0$ and $\beta =0$, Equation (1) reduces to the usual semilinear space-fractional diffusion equations. When $\gamma$ tends to 2, the models become the classical Ginzburg–Landau–Schrödinger equation [3,4,5], which has a wide application in the study of chaos, oscillations, and superconductors.

The space-fractional Ginzburg–Landau–Schrödinger Equation (1) is energy-stable. This is because

$${\displaystyle \frac{d}{dt}}E\left(\phi \right)=-4\alpha {\int }_{\mathrm{\Omega }}{|{\phi }_t|}^{2}dx\le 0,$$

where $E\left(\phi \right)=2{\int }_{\mathrm{\Omega }}{|(-\Delta )}^{{\displaystyle \frac{\gamma }{4}}}{\phi |}^2+{(|\phi |}^2{-1)}^{2}dx$. The results can be obtained by taking the inner product with respect to ${\phi }_t$ on both sides of (1) and taking the real parts. When $\alpha =0$, Equation (1) reduces to the space Schrödinger equation. Then, it is mass- and energy-conserving,

$${\int }_{\mathrm{\Omega }}{|\phi (·,t)|}^{2}dx={\int }_{\mathrm{\Omega }}{|{\phi }_0\left(x\right)|}^{2}dx,\mathrm{and}E\left(\phi (·,t)\right)=E\left({\phi }_0\left(x\right)\right).$$

In recent years, it has been one of the hot spots in developing structure-preserving schemes for space-fractional equations. For the fractional Schrödinger-type equation, several mass- and energy-conserving schemes have been developed. For example, Wang [6] presented a linearly implicit conservative difference scheme for the space-fractional coupled nonlinear Schrödinger equations. Wang and Huang [7] applied the Fourier pseudo-spectral method to approximate the spatial fractional operator in the fractional Schrödinger equation and showed that the discrete equation satisfies the corresponding symplectic properties. Hu et al. [8] presented an implicit structure-preserving difference scheme for the space-fractional nonlinear Schrödinger equation, which preserves mass and energy conservation. Castillo and Gomez [9] considered the conservation of the local discontinuous Galerkin method for the fractional nonlinear Schrödinger equation. Liu and Ran [10] proposed a high-order scheme that preserves modified energy conservation for generalized nonlinear fractional Schrödinger wave equations. Moreover, a variety of energy-stable or energy-conserving approaches have been proposed, often based on the invariant energy quadratization approach [11,12], the scalar auxiliary variable approach [13,14,15,16], the relaxation approach [17,18,19,20], and so on [21,22,23,24]. As mentioned before, the energy evolution of the Ginzburg–Landau–Schrödinger equation depends on the value of $\alpha$. When $\alpha =0$, it is energy-conserving; when $\alpha \ne 0$, it is energy-stable. However, there have been few studies on the structure-preserving schemes for the space-fractional Ginzburg–Landau–Schrödinger equation up to now.

In the present study, we present a structure-preserving scheme for solving the space-fractional Ginzburg–Landau–Schrödinger equation. The fully discrete scheme is obtained by combining the modified leap-frog method in the temporal direction and the finite difference methods in the spatial direction. By carefully choosing the approximation of the intermediate variables, the scheme is linearly implicit. This means that at each time step, we only need to solve one set of algebraic equations without requiring iteration, thereby saving computational cost. It is shown that the scheme can be unconditionally energy-stable. In particular, when $\alpha =0$, the equation becomes the space-fractional Schrödinger equation. In such cases, the scheme can keep both the discrete mass and energy conserved. Moreover, convergence of the scheme is obtained. It is shown that the numerical schemes can be of order 2 in both temporal and spatial directions. Numerical experiments are given to confirm the theoretical results.

The rest of this paper is organized as follows. In Section 2, we present the fully discrete scheme and the main results for this paper, including the unconditional energy stability and convergence results. In Section 3, we give the proof of the main convergence results. In Section 4, we provide some numerical examples to validate the effectiveness of the scheme. In Section 5, we present the principal results and provide final conclusion of this paper.

2. Fully Discrete Scheme and Main Results

In this section, we will present the fully-discrete scheme for the space-fractional Ginzburg–Landau–Schrödinger equation.

Let $h={\displaystyle \frac{b-a}{M}}$ and $\tau ={\displaystyle \frac{T}{N}}$ be the spatial size and temporal step, where $M,N$ are two positive integers. Define $x_k=a+kh$ ($k=0,1,\dots ,M$) and $t_n=n\tau$ ($n=0,1,\dots ,N$) as the spatial and temporal partitions, respectively. And let ${\mathrm{\Phi }}_k^n$ be numerical approximations to $\phi (x_k,t_n)$. Let ${\mathrm{\Omega }}_h=\{x_k\mid 0\le k\le M\}$, and the grid function space ${\mathcal{V}}_h=\{\psi \mid \psi =\left({\psi }_k\right)$ is a grid function defined on ${\mathrm{\Omega }}_h$ and ${\psi }_0={\psi }_M=0\}$. For any grid function $\psi =\{{\psi }_j^n\mid 1\le j\le M-1,0\le n\le N\}$,

$$\begin{array}{ccc}& & D_{\tau }{\psi }_k^0={\displaystyle \frac{1}{\tau }}({\psi }_k^1-{\psi }_k^0),{\overline{\psi }}_k^0={\displaystyle \frac{1}{2}}({\psi }_k^1+{\psi }_k^0),\hfill \\ & & D_{\tau }{\psi }_k^n={\displaystyle \frac{1}{2\tau }}({\psi }_k^{n+1}-{\psi }_k^{n-1}),{\overline{\psi }}_k^n={\displaystyle \frac{1}{2}}({\psi }_k^{n+1}+{\psi }_k^{n-1}),1\le n\le N,\hfill \\ & & \langle {\psi }^n,{\phi }^n\rangle =h\sum _{k=1}^{M-1}{\psi }_k^n{\left({\phi }_k^n\right)}^{*},||{\psi }^n{\parallel }^2=\langle {\psi }^n,{\psi }^n\rangle ,\hfill \end{array}$$

where ${\left({\psi }_k^n\right)}^{*}$ is the conjugate of ${\psi }_k^n$.

For a better understanding of spatial discretization, we introduce the following lemma.

Lemma 1 

([25]). Let $\phi \in C^5\left(\mathbb{R}\right)$; all derivatives up to order five belong to $L_1\left(\mathbb{R}\right)$. Then for $1<\gamma \le 2$, we have $c_0^{\gamma }\ge 0,c_k^{\gamma }=c_{-k}^{\gamma }\le 0$ for all $k\ge 1$, and

$$-{(-\Delta )}^{\gamma /2}\phi \left(x\right)=-\sum _{k=-\infty }^{+\infty }{\displaystyle \frac{c_k^{\gamma }}{h^{\gamma }}}\phi (x-kh)+O\left(h^2\right),$$

where the coefficients are $c_k^{\gamma }={\displaystyle \frac{{(-1)}^k\mathrm{\Gamma }(\gamma +1)}{\mathrm{\Gamma }(\gamma /2-k+1)\mathrm{\Gamma }(\gamma /2+k+1)}}$.

For space-fractional problems, the solutions will decay to zero as $|x|$ tends to infinity. As a result, as in [26,27], the homogenous Dirichlet boundary conditions will be used, i.e., $\phi (a,t)=\phi (b,t)=0$. And the space-fractional Laplacian ${(-\Delta )}^{\gamma /2}\phi \left(x\right)$ in the truncated bounded domain is approximated by

$${(-\Delta )}^{\gamma /2}\phi \left(x_j\right)=\sum _{k=1}^{M-1}{\displaystyle \frac{c_{j-k}^{\gamma }}{h^{\gamma }}}\phi \left(x_k\right)+O\left(h^2\right).$$

To simplify the notation, define

$${\delta }_x^{\gamma }{\phi }_j^n=\sum _{k=1}^{M-1}{\displaystyle \frac{c_{j-k}^{\gamma }}{h^{\gamma }}}{\mathrm{\Phi }}_k^n.$$

With these notations, a modified leap-frog difference scheme for GLSE (1) is

$$(\alpha -i\beta )D_{\tau }{\phi }_k^n+{\delta }_x^{\gamma }{\overline{\phi }}_k^n+(|{\phi }_j^n{|}^2-1){\overline{\phi }}_k^n=0,n=1,2,\cdots ,N,k=1,2,\cdots ,M-1.$$

(2)

The boundary and initial conditions are as follows:

$${\phi }_n^0={\phi }_M^n=0,{\mathrm{\Phi }}_k^0={\phi }_0\left(x_k\right).$$

3. Structure-Preserving Properties and Convergence

In this section, we focus on the structure-preserving properties and convergence of the fully discrete scheme.

The energy stability of scheme (2) requires a discrete operator, which is defined in the following lemma.

Lemma 2 

([28]). For any grid functions $u\in {\mathcal{V}}_h$, there exists a discrete operator ${\mathrm{\Lambda }}_x^{\gamma }$ such that

$$({\delta }_x^{\gamma }u,u)={\parallel {\mathrm{\Lambda }}_x^{\gamma }u\parallel }^2.$$

Now, we present the energy-stability results as follows.

Theorem 1. 

The fully discrete scheme (2) is energy-stable; i.e.,

$$E\left({\phi }^n\right)\le E\left({\phi }^{n-1}\right),0\le n\le N-1,$$

where

$$\begin{array}{cc}\hfill E\left({\phi }^0\right)=& 2\parallel {\mathrm{\Lambda }}_x^{\gamma }{\phi }^0{\parallel }^2+\parallel |{\phi }^0{{|}^2-1\parallel }^2,\hfill \\ \hfill E\left({\phi }^n\right)=& \parallel {\mathrm{\Lambda }}_x^{\gamma }{\phi }^n{\parallel }^2+\parallel {\mathrm{\Lambda }}_x^{\gamma }{\phi }^{n-1}{\parallel }^2+\langle |{\phi }^n{|}^2-1,|{\phi }^{n-1}{|}^2-1\rangle ,n\ge 1.\hfill \end{array}$$

(3)

In particular, when $\alpha =0$, the fully discrete scheme is energy- and mass-conserving; i.e.,

$$E\left({\phi }^n\right)=E\left({\phi }^0\right),\parallel {\phi }^n{\parallel }^2={\parallel {\phi }^0\parallel }^{2}0\le n\le N.$$

Proof. 

Firstly, we let $n=0$ in Equation (2). Multiplying both sides of the equation by $h{D}_{\tau }{\left({\phi }_k^n\right)}^{*}$ and summing over for k from 1 to $M-1$, we have

$$\begin{array}{ccc}\hfill -\alpha \parallel D_{\tau }{\phi }^0{\parallel }^2& =& Re\langle {\mathrm{\Lambda }}_x^{\gamma }{\displaystyle \frac{{\phi }^1+{\phi }^0}{2}},{\mathrm{\Lambda }}_x^{\gamma }{\displaystyle \frac{{\phi }^1-{\phi }^0}{\tau }}\rangle +Re(\sum _{k=1}^{M-1}(|{\mathrm{\Phi }}_k^0{|}^2-1){\displaystyle \frac{{\mathrm{\Phi }}_k^1+{\mathrm{\Phi }}_k^0}{2}},{\displaystyle \frac{{\mathrm{\Phi }}_k^1-{\mathrm{\Phi }}_k^0}{\tau }})\hfill \\ \hfill & =& {\displaystyle \frac{1}{2\tau }}(\parallel {\mathrm{\Lambda }}_x^{\gamma }{\phi }^1{\parallel }^2-\parallel {\mathrm{\Lambda }}_x^{\gamma }{\phi }^0{\parallel }^2)+{\displaystyle \frac{1}{2\tau }}Re\langle |{\phi }^0{|}^2-1,|{\phi }^1{|}^2-|{\phi }^0{|}^2\rangle \hfill \\ \hfill & =& {\displaystyle \frac{1}{2\tau }}(E\left({\phi }^1\right)-E\left({\phi }^0\right)).\hfill \end{array}$$

For $n\ge 1$, multiplying both sides of the equation by $h{D}_{\tau }{\left({\phi }_k^n\right)}^{*}$ and summing over for k from 1 to $M-1$, we have

$$\begin{array}{ccc}\hfill -\alpha \parallel D_{\tau }{\phi }^n{\parallel }^2& =& Re({\mathrm{\Lambda }}_x^{\gamma }{\displaystyle \frac{{\phi }^{n+1}+{\phi }^{n-1}}{2}},{\mathrm{\Lambda }}_x^{\gamma }{\displaystyle \frac{{\phi }^{n+1}-{\phi }^{n-1}}{2\tau }})\hfill \\ \hfill & +& Re(\sum _{k=0}^{M-1}(|{\phi }_K^n{|}^2-1){\displaystyle \frac{{\mathrm{\Phi }}_k^{n+1}+{\mathrm{\Phi }}_k^{n-1}}{2}},{\displaystyle \frac{{\mathrm{\Phi }}_k^{n+1}-{\mathrm{\Phi }}_k^{n-1}}{2\tau }})\hfill \\ \hfill & =& {\displaystyle \frac{1}{4\tau }}(\parallel {\mathrm{\Lambda }}_x^{\gamma }{\phi }^{n+1}{\parallel }^2-\parallel {\mathrm{\Lambda }}_x^{\gamma }{\phi }^{n-1}{\parallel }^2)+{\displaystyle \frac{1}{4\tau }}Re\langle (|{\phi }^n{|}^2-1),|{\phi }^{n+1}{|}^2-|{\phi }^{n-1}{|}^2\rangle \hfill \\ \hfill & =& {\displaystyle \frac{1}{4\tau }}(E\left({\phi }^{n+1}\right)-E\left({\phi }^n\right)),1\le n\le N-1.\hfill \end{array}$$

These imply that

$$E\left({\phi }^{n+1}\right)-E\left({\phi }^n\right)=-4\tau \alpha {\parallel D_{\tau }{\phi }^n\parallel }^2\le 0,0\le n\le N-1.$$

In particular, when $\alpha =0$, it holds that

$$E\left({\phi }^{n+1}\right)-E\left({\phi }^n\right)=0,0\le n\le N-1.$$

Next, we show that the scheme is mass-conserving when $\alpha =0$. In such case, multiplying both sides of Equation (2) by ${\left({\overline{\phi }}_k^n\right)}^{*}$ and summing over for k from 1 to $M-1$, we have

$$i\beta \langle D_{\tau }{\phi }^n,{\overline{\phi }}^n\rangle =\parallel {\mathrm{\Lambda }}_x^{\gamma }{\overline{\phi }}^n{\parallel }^2+\langle |{\phi }^n{|}^2-1,|{\overline{\phi }}^n{|}^2\rangle =0.$$

Taking the imaginary part of both sides of the equation, we arrive at

$$\parallel {\phi }^n{\parallel }^2={\parallel {\phi }_h^{n-1}\parallel }^2,n=1,2,\cdots ,N.$$

This implies that the fully discrete scheme is mass-conserving when $\alpha =0$. This completes the proof.    □

Theorem 2. 

Suppose that $\tau <{\displaystyle \frac{\alpha }{2}}$. There exists a constant $C_1$ such that the numerical solutions satisfy

$$\parallel {\phi }^n\parallel \le C_1\parallel {\phi }^0\parallel ,1\le n\le N.$$

Proof. 

It is clear that the result holds when $\alpha =0$ by Theorem 1. In what follows, we focus on the case $\alpha >0$. In such a case, we first consider the case $n=0$. Multiplying both sides of Equation (2) by $h{\left({\overline{\phi }}_k^n\right)}^{*}$ and summing over for k from 1 to $M-1$ and taking the real part, we get

$$\alpha Re\langle {\displaystyle \frac{{\phi }^1-{\phi }^0}{\tau }},{\displaystyle \frac{{\phi }^1+{\phi }^0}{2}}\rangle +\parallel {\mathrm{\Lambda }}_x^{\gamma }{\overline{\phi }}^1{\parallel }^2+\langle |{\phi }^0{|}^2,|{\overline{\phi }}^1{|}^2\rangle -\parallel {\overline{\phi }}^1{\parallel }^2=0,$$

which further implies that

$${\displaystyle \frac{\alpha }{2\tau }}(\parallel {\phi }^1{\parallel }^2-\parallel {\phi }^0{\parallel }^2)\le \parallel {\overline{\phi }}^1{\parallel }^2\le {\displaystyle \frac{1}{2}}(\parallel {\phi }^1{\parallel }^2+\parallel {\phi }^0{\parallel }^2).$$

(4)

For $n\ge 1$, multiplying both sides of Equation (2) by $h{\left({\overline{\phi }}_k^n\right)}^{*}$ and summing over for k from 1 to $M-1$ and taking the real part, we get

$$\alpha Re\langle {\displaystyle \frac{{\phi }^{n+1}-{\phi }^{n-1}}{2\tau }},{\displaystyle \frac{{\phi }^{n+1}+{\phi }^{n-1}}{2}}\rangle +\parallel {\mathrm{\Lambda }}_x^{\gamma }{\overline{\phi }}^n{\parallel }^2+\langle |{\phi }^n{|}^2,|{\overline{\phi }}^n{|}^2\rangle -\parallel {\overline{\phi }}^n{\parallel }^2=0,n=1,2,\cdots ,N-1.$$

Therefore, it holds that

$${\displaystyle \frac{\alpha }{4\tau }}(\parallel {\phi }^{n+1}{\parallel }^2-\parallel {\phi }^{n-1}{\parallel }^2)\le \parallel {\overline{\phi }}^n{\parallel }^2\le {\displaystyle \frac{1}{2}}(\parallel {\phi }^{n+1}{\parallel }^2+\parallel {\phi }^{n-1}{\parallel }^2),1\le n\le N-1.$$

(5)

Together with (4) and (5), we have

$$\parallel {\phi }^1{\parallel }^2\le {\displaystyle \frac{\alpha +\tau }{\alpha -\tau }}\parallel {\phi }^0{\parallel }^2,\parallel {\phi }^{n+1}{\parallel }^2\le {\displaystyle \frac{\alpha +2\tau }{\alpha -2\tau }}{\parallel {\phi }^{n-1}\parallel }^2,1\le n\le N-1.$$

Therefore, we have

$$\parallel {\phi }_h^{n+1}{\parallel }^2\le {\left({\displaystyle \frac{\alpha +2\tau }{\alpha -2\tau }}\right)}^N\parallel {\phi }_h^0{\parallel }^2={\left({\displaystyle \frac{\alpha +2\tau }{\alpha -2\tau }}\right)}^{{\displaystyle \frac{2T}{2\tau }}}{\parallel {\phi }_h^0\parallel }^2.$$

(6)

For any $0<\tau <{\displaystyle \frac{\alpha }{2}}$, there exists a constant $C^T$ such that ${\left({\displaystyle \frac{\alpha +2\tau }{\alpha -2\tau }}\right)}^{{\displaystyle \frac{2T}{2\tau }}}\le C_1^2$. Therefore, the final results hold.    □

Theorem 3. 

Suppose that the solution $\phi (t,x)\in C^{2,5}$. If the time step τ is sufficiently small, then the numerical solution ${\phi }_k^n$ of the fully discrete scheme (2) converges to the exact solution $\phi (x_k,t^n)$ with the error $O({\tau }^2+h^2)$ in the $L^2$ norm.

Proof. 

Let ${\mathrm{\Phi }}_k^n=\phi (x_k,t_n)$. Then, it holds that

$$(\alpha -i\beta )D_{\tau }{\mathrm{\Phi }}_k^n+{\delta }_x^{\gamma }{\overline{\mathrm{\Phi }}}_k^n+(|{\mathrm{\Phi }}_j^n{|}^2-1){\overline{\mathrm{\Phi }}}_k^n={\eta }_k^n,n=1,2,\cdots ,N,k=1,2,\cdots ,M-1.$$

(7)

where ${\eta }_k^n$ is the truncation error. By Lemma 1 and Taylor expansion, there exists a constant $C^{*}$ such that

$$|{\eta }_k^n|<C^{*}({\tau }^2+h^2).$$

(8)

Let $e_k^n={\phi }_k^n-{\mathrm{\Phi }}_k^n$. Subtracting Equation (7) from Equation (2), we have

$$(\alpha -i\beta )D_{\tau }{e}_k^n+{\delta }_x^{\gamma }{\overline{e}}_k^n+F_k^n={\eta }_k^n,n=1,2,\cdots ,N,k=1,2,\cdots ,M-1,$$

(9)

where $F_k^n=(|{\phi }_j^n{|}^2-1){\overline{\phi }}_k^n-(|{\mathrm{\Phi }}_j^n{|}^2-1){\overline{\mathrm{\Phi }}}_k^n$.

Now, multiplying both sides of Equation (2) by $h{\left({\overline{e}}_k^n\right)}^{*}$ and summing over for k from 1 to $M-1$ and taking the imaginary part, we have

$$\beta (\parallel e^1{\parallel }^2-\parallel e^0{\parallel }^2)\le 2\tau h\sum _{k=1}^{M-1}|(F_k^0-{\eta }_k^0){\overline{e}}_k^0|,$$

(10)

and

$$\beta (\parallel e^{n+1}{\parallel }^2-\parallel e^{n-1}{\parallel }^2)=2\tau h\sum _{k=1}^{M-1}|(F_k^n-{\eta }_k^n){\overline{e}}_k|.$$

(11)

Summing over the above equations for n from 0 to n, it holds that

$$\beta \parallel e^{n+1}{\parallel }^2+\beta \parallel e^n{\parallel }^2\le \beta \parallel e^0{\parallel }^2+2\tau h\sum _{n=0}^N\sum _{k=1}^{M-1}|(F_k^n-{\eta }_k^n){\overline{e}}_k^n|.$$

(12)

Note that

$$\begin{array}{ccc}\hfill |F_k^n|& =& |({\phi }_k^n{|}^2-1){\overline{\phi }}_k^n-(|{\mathrm{\Phi }}_k^n{|}^2-1){\overline{\mathrm{\Phi }}}_k^n|\hfill \\ & =& |({\phi }_k^n{|}^2-1){\overline{\phi }}_k^n-(|{\phi }_k^n{|}^2-1){\overline{\mathrm{\Phi }}}_k^n+(|{\phi }_k^n{|}^2-1){\overline{\mathrm{\Phi }}}_k^n-(|{\mathrm{\Phi }}_k^n{|}^2-1){\overline{\mathrm{\Phi }}}_k^n|\hfill \\ & \le & |({\phi }_k^n{|}^2-1){\overline{\phi }}_k^n-(|{\phi }_k^n{|}^2-1){\overline{\mathrm{\Phi }}}_k^n|+|(|{\phi }_k^n{|}^2-1){\overline{\mathrm{\Phi }}}_k^n-(|{\mathrm{\Phi }}_k^n{|}^2-1){\overline{\mathrm{\Phi }}}_k^n|\hfill \\ & \le & (|{\phi }_k^n{|}^2-1|)|{\overline{e}}_k^n|+(|{\phi }_k^n{|}^2-|{\mathrm{\Phi }}_k^n{|}^2)|{\overline{\mathrm{\Phi }}}_k^n|\hfill \\ & \le & L(|e_k^{n-1}|+|e_k^n|+|e_k^{n+1}|),\hfill \end{array}$$

where L is constant. Then, it holds that

$$\begin{array}{ccc}\hfill 2\tau h\sum _{k=1}^{M-1}|(F_k^n-{\eta }_k^n){\overline{e}}_k^n|& \le & \tau h\sum _{k=1}^{M-1}(|F_k^n{|}^2+|{\eta }_k^n{|}^2+{\displaystyle \frac{|e_k^{n+1}+e_k^{n-1}{|}^2}{2}})\hfill \\ & \le & \tau h\sum _{k=1}^{M-1}(3(L^2+1)(|e_k^{n-1}{|}^2+|e_k^n{|}^2+|e_k^{n+1}{|}^2)+|{\eta }_k^n{|}^2).\hfill \end{array}$$

(13)

Together with (8), (12), and (13), we have

$$\beta \parallel e^{n+1}{\parallel }^2+\beta \parallel e^n{\parallel }^2\le \beta \parallel e^0{\parallel }^2+9\tau (L^2+1)\sum _{j=0}^n{\parallel e^j\parallel }^2+C\tau {({\tau }^2+h^2)}^2.$$

(14)

Now, by the discrete Grönwall inequality, we conclude that there exists ${\tau }^{*}$; when $\tau <{\tau }^{*}$, it holds that

$$\parallel e^n\parallel \le C({\tau }^2+h^2).$$

This completes the proof.    □

4. Numerical Examples

In this section, we will verify the convergence of the proposed scheme, its energy-dissipative law (when $\alpha \ne 0$), and its mass- and energy-conservative laws (when $\alpha =0$). The temporal convergence order is computed by the following formula:

$$Order={\displaystyle \frac{log(Error\left({\tau }_1\right)/Error\left({\tau }_2\right))}{log({\tau }_1/{\tau }_2)}},$$

where $Error\left({\tau }_1\right)$ represents the discrete $L^2$ error when the time step is set to ${\tau }_1$ and the spatial step h is fixed. The spatial convergence order can similarly be obtained. All simulations are performed on a laptop (Lenovo Legion Y7000p) equipped with an Intel Core i7 processor and 16 GB of RAM. The algorithms are implemented and executed in MATLAB R2024b.

Example 1. 

Consider the following equation:

$$(\alpha -\beta \mathrm{ß}){\phi }_t+{(-\Delta )}^{{\displaystyle \frac{\gamma }{2}}}{\phi -(1-|\phi |}^2)\phi =0,x\in \mathrm{\Omega },t>0,$$

(15)

where $\mathrm{\Omega }=[-10,10]$ and the initial function

$${\phi }_0\left(x\right)=\mathit{sech}\left(x\right)exp\left(3\mathrm{ß}x\right).$$

We test the convergence of the proposed scheme by setting $\alpha =1$ and $\beta =1$. We calculate the temporal convergence orders with spatial partitions $N=64$ and time steps $\tau =1/10$, $1/20$, $1/40$, $1/80$. Since the analytical solution is unknown, we employ the four-stage and eight-order Gauss method with $\tau =$ $1\times {10}^{-4}$ to provide reference solutions. The $L^2$ errors and convergence orders for $\gamma =1.2$, $1.5$, $1.8$ are presented in

Table 1. $L^2$ errors at $T=1$ and convergence orders in the temporal direction.

$\mathit{\tau }$	$\mathit{\gamma }=1.2$		$\mathit{\gamma }=1.5$		$\mathit{\gamma }=1.8$
	Errors	Orders	Errors	Orders	Errors	Orders
$1/10$	$5.68\times {10}^{-3}$	-	$8.33\times {10}^{-3}$	-	$1.12\times {10}^{-2}$	-
$1/20$	$1.42\times {10}^{-3}$	2.00	$2.06\times {10}^{-3}$	2.01	$2.70\times {10}^{-3}$	2.05
$1/40$	$3.53\times {10}^{-4}$	2.00	$5.15\times {10}^{-4}$	2.00	$6.68\times {10}^{-4}$	2.01
$1/80$	$8.82\times {10}^{-5}$	2.00	$1.29\times {10}^{-4}$	2.00	$1.67\times {10}^{-4}$	2.00

. The proposed scheme exhibits second-order temporal convergence. Similarly, we calculate the spatial convergence orders with spatial partitions $N=32$, 64, 128 and time step $\tau =$ $1\times {10}^{-5}$. The corresponding $L^2$ errors and convergence orders for $\gamma =1.2$, $1.5$, $1.8$ are shown in

Table 2. $L^2$ errors at $T=1$ and convergence orders in the spatial direction.

N	$\mathit{\gamma }=1.2$		$\mathit{\gamma }=1.5$		$\mathit{\gamma }=1.8$
	Errors	Orders	Errors	Orders	Errors	Orders
32	$1.57\times {10}^{-1}$	-	$1.41\times {10}^{-1}$	-	$1.02\times {10}^{-1}$	-
64	$3.60\times {10}^{-2}$	2.12	$3.03\times {10}^{-2}$	2.22	$2.10\times {10}^{-2}$	2.29
128	$9.44\times {10}^{-3}$	1.93	$7.21\times {10}^{-3}$	2.07	$4.90\times {10}^{-3}$	2.10

. These results imply that the scheme has a second-order convergence rate in the spatial direction.

To verify the energy stability of the proposed scheme when $\alpha =1$ and $\beta =1$, we set $N=128$, $\tau =1/100$ to solve this equation. The evolution of energy for different values of $\gamma$ is presented in Figure 1. The evolution of numerical solutions obtained at $N=256$, $\tau =1/100$ is shown in Figure 2. Clearly, our scheme can dissipate energy unconditionally when $\alpha \ne 0$, consistent with our theoretical results.

To test the mass- and energy-conserving property of the scheme, at each time step, we calculate the discrepancies of the discrete mass and energy

$$\mathrm{MassError}={\displaystyle \frac{|M\left({\phi }^n\right)-M\left({\phi }^0\right)|}{M\left({\phi }^0\right)}},\mathrm{EnergyError}={\displaystyle \frac{|E\left({\phi }^n\right)-E\left({\phi }^0\right)|}{E\left({\phi }^0\right)}},1\le n\le {\displaystyle \frac{T}{\tau }}$$

To verify the mass and energy conservation of the proposed scheme when $\alpha =0$ and $\beta =1$, we set $N=128$, $\tau =1/50$ to solve this equation. The evolution of energy for different values of $\gamma$ is presented in Figure 3 and Figure 4. The evolution of numerical solutions obtained at $N=256$, $\tau =1/100$ is shown in Figure 5. From Figure 3 and Figure 4, the discrepancies of discrete mass and energy have both reached machine precision. This implies that the fully discrete scheme is unconditionally mass- and energy-conserving at $\alpha =0$, which is consistent with the theoretical analysis.

5. Conclusions

In this paper, an effective numerical scheme is proposed to solve the space-fractional Ginzburg–Landau–Schrödinger equation. The fully discrete scheme is obtained by combining the modified leap-frog method and the finite difference methods. The fully discrete scheme is linearly implicit. This implies that at each time step, we always solve a system of linear algebraic equations. Therefore, the computational cost is less than that for the previous fully implicit methods. This numerical scheme also maintains energy stability when the coefficient $\alpha \ne 0$. When $\alpha =0$, the equation degenerates into the space-fractional Schrödinger equation, and the numerical scheme we constructed preserves both mass and energy conservation. Moreover, error estimates of the scheme are obtained. Numerical experiments are given to confirm the theoretical results. In future research, we aim to develop high-order, efficient numerical algorithms that preserve multiple physical quantities for high-dimensional problems.