Next Article in Journal
Path Loss and Auxiliary Communication Analysis of VANET in Tunnel Environments
Previous Article in Journal
Symmetric Multi-Scale Residual Network Ensemble with Weighted Evidence Fusion Strategy for Facial Expression Recognition
Previous Article in Special Issue
Linear Bundle of Lie Algebras Applied to the Classification of Real Lie Algebras
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Convergence of Symmetric Discretization Models for Nonlinear Schrödinger Equation in Dark Solitons’ Motion

College of Science, Beijing Forestry University, Beijing 100083, China
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(6), 1229; https://doi.org/10.3390/sym15061229
Submission received: 20 May 2023 / Revised: 4 June 2023 / Accepted: 6 June 2023 / Published: 9 June 2023

Abstract

:
The Schrödinger equation is one of the most basic equations in quantum mechanics. In this paper, we study the convergence of symmetric discretization models for the nonlinear Schrödinger equation in dark solitons’ motion and verify the theoretical results through numerical experiments. Via the second-order symmetric difference, we can obtain two popular space-symmetric discretization models of the nonlinear Schrödinger equation in dark solitons’ motion: the direct-discrete model and the Ablowitz–Ladik model. Furthermore, applying the midpoint scheme with symmetry to the space discretization models, we obtain two time–space discretization models: the Crank–Nicolson method and the new difference method. Secondly, we demonstrate that the solutions of the two space-symmetric discretization models converge to the solution of the nonlinear Schrödinger equation. Additionally, we prove that the convergence order of the two time–space discretization models is O ( h 2 + τ 2 ) in discrete L 2 -norm error estimates. Finally, we present some numerical experiments to verify the theoretical results and show that our numerical experiments agree well with the proven theoretical results.

1. Introduction

The nonlinear Schrödinger equation (NLSE) is one of the most widely used and completely integrable models in nonlinear physics. It plays a crucial role in many physical fields [1,2,3], such as nonlinear optics, solid state physics, quantum mechanics, optical fiber communication, etc. Therefore, the study of such equations has a profound influence on the development of modern science.
Consider the original NLSE with the initial condition
i w t + w x x + a | w | 2 w = 0 , w ( x , 0 ) = w 0 ( x ) ,
where a is a real constant, and w ( x , t ) is a complex-valued function; t [ 0 , ) , x R . NLSE is a class of nonlinear partial differential equations, which produces a special type of solution–soliton solution. When a > 0 and | w 0 ( ) | = 0 , NLSE has a bright soliton solution [4]; when a < 0 and | w 0 ( ) | = ρ , NLSE has a dark soliton solution [5,6]. The original NLSE has infinite conserved quantities, including
Q = + | w | 2 ρ 2 d x , P = + w w ¯ x w ¯ w x d x
where Q , P are c h a r g e and m o m e n t u m , respectively. Utilizing the central difference, we can approximate the conserved quantities Q , P as follows:
S 1 = h j ( w j w ¯ j ρ 2 ) , S 2 = j ( w j w ¯ j + 1 w j + 1 w ¯ j )
Zakharov and Shabat et al. obtained the exact solution of the original NLSE Equation (1) using the inverse scattering transformation method [6]. Here, we need to note that the above equation is idealized. However, the actual physical system has to consider the influence of dissipation and other conditions, making it difficult to obtain an analytical solution. Consequently, many numerical methods have been proposed to simulate such equations and study the properties of NLSE according to numerical results [7,8,9,10,11,12,13,14], such as the finite difference, the finite element, or the polynomial approximation.
As is well known, the solitons for the original NLSE maintain their original state after collision with each other. Based on the above unique properties, many researchers have devoted themselves to studying conservative schemes for simulation [15,16,17]. Zhu You-lan considered an implicit scheme and gave its convergence [18]. Guo Ben-yu [19] gave the convergence of the Crank–Nicolson method and the prediction correction method under the error estimations. In [20,21,22,23,24], compact finite difference schemes were proven to be convergent both in the discrete L 2 -norm and in the discrete L -norm. For the important space-symmetric discretization models of NLSE, the direct-discrete model (D-D model) and the Ablowitz–Ladik model (A-L model) can be transformed into the Hamiltonian form, respectively. In [25,26], Tang et al. used the symplectic methods to simulate a Hamiltonian system and proved that the solution of the D-D model and the A-L model converged to the original NLSE.
The previous proofs of convergence were almost always focused on bright solitons’ motion. Given the different parameters and conditions, it is difficult to directly apply the above convergence to dark solitons’ motion. As a result, there is very little literature dedicated to proving the convergence of dark solitons’ motion ( a < 0 ,   | W 0 ( ) | = ρ ) . Hence, we give proof of convergence for the space-symmetric discretization models of the original NLSE in dark solitons’ motion, which provides theoretical support for numerical simulation. The Crank–Nicolson method is actually obtained by applying the midpoint scheme with symmetry in time to solve the D-D model. Similarly, we apply the midpoint scheme with symmetry to the A-L model and then propose a new difference scheme (called the new difference method) of the original NLSE. We show that the new difference method in dark solitons’ motion is convergent and of high accuracy via numerical experiments.
This paper is organized as follows. In Section 2, we present the space-symmetric discretization models and the time–space discretization models for the original NLSE in dark solitons’ motion, and we give some conservation invariants of these models. We confirm the convergence of the space-symmetric discretization models and the time–space discretization models in Section 3 and Section 4, respectively. In Section 5, we obtain the error order of the space-symmetric discretization models and the time–space discretization models to test the convergence. In order to further demonstrate the convergence of these models, we obtain the numerical solutions of these models and check the preservation of the invariants. Finally, we give some conclusions in Section 6.

2. Different Discretization Models

In this section, we present the space-symmetric discretization models and the time–space discretization models for the original NLSE. The direct-discrete model and the Ablowitz–Ladik model discretize the original NLSE in space, while the Crank–Nicolson method and the new difference method discretize in time and space simultaneously.

2.1. The Space-Symmetric Discretization Models

We substitute second-order symmetric difference [27] for the second derivative w x x in space, and then obtain two classical space-symmetric discretization models:
(1)
Direct-discrete model (D-D model):
i d W ( l ) d t + W ( l + 1 ) 2 W ( l ) + W ( l 1 ) h 2 + a | W ( l ) | 2 W ( l ) = 0 , W ( l ) ( 0 ) = W 0 ( l h ) ,
By setting W ( l ) = p ( l ) + i q ( l ) , the D-D model can be directly rewritten as a Hamiltonian system, and it has two invariants, namely the energy and the charge:
Q ˜ = 1 2 l | W ( l ) | 2 ρ 2 = Q 1 ,
E ˜ = 1 2 h 2 l [ p ( l ) ( p ( l + 1 ) 2 p ( l ) + p ( l 1 ) ) + q ( l ) ( q ( l + 1 ) 2 q ( l )
+ q ( l 1 ) ] + a 4 l p ( l ) 2 + q ( l ) 2 ρ 2 = E 1
(2)
Ablowitz–Ladik model (A-L model):
i d W ( l ) d t + W ( l + 1 ) 2 W ( l ) + W ( l 1 ) h 2 + a 2 | W ( l ) | 2 ( W ( l + 1 ) + W ( l 1 ) ) = 0 , W ( l ) ( 0 ) = W 0 ( l h )
where h is the space step size and W ( l ) ( t ) = W ( l h , t ) for l = , 1 , 0 , 1 , . The A-L model has infinite invariants [6], and the first two invariants are [28]
F 1 = l W ( l + 1 ) W ¯ ( l ) F 2 = a h 2 4 l ( W ( l + 1 ) ) 2 ( W ¯ ( l ) ) 2 + 2 l W ( l + 1 ) W ¯ ( l 1 ) U ( l )
where U ( l ) = 1 a h 2 2 | W ( l ) | 2 . The above models can be converted into the Hamiltonian system and then simulated using the symplectic method [25,28].

2.2. The Time–Space Discretization Models

Applying the midpoint scheme with symmetry [27] to the D-D model and the A-L model in time, we obtain the following two models: the Crank–Nicolson method and the new difference method. Before introducing the two models, we give some definitions: the time step size and space step size of these models are τ , h , respectively, and x j = j h ( j = 1 , 0 , 1 , ) , t n = n τ ( n = 0 , 1 N ) .
We write the exact solution of the original NLSE as w j n = w ( x j , t n ) and the numerical solution as W j n = W ( x j , t n ) , and define
δ t V j n = V j n + 1 V j n τ , δ x V j n = V j + 1 n V j n h , δ x ¯ V j n = V j n V j 1 n h , V j n + 1 2 = V j n + 1 + V j n 2 , δ x 2 V j n = δ x δ x ¯ V j n = 1 h 2 ( V j + 1 n 2 V j n + V j 1 n )
Let us define that
( U n , V n ) = h j U j n V ¯ j n , | | V n | | L 2 2 = ( V n , V n ) , | | V n | | L = max j | V j n | , j = 1 , 0 , 1 ,
Then, the two difference schemes for the original NLSE are as follows:
(1)
Crank-Nicolson method
i δ t W j n + 1 2 δ x 2 ( W j n + 1 + W j n ) + a 8 | W j n + 1 + W j n | 2 ( W j n + 1 + W j n ) ) = 0 j = 1 , 0 , 1 , , n = 0 , 1 N W j 0 = W 0 ( x j )
(2)
New difference method
i δ t W j n + 1 2 δ x 2 ( W j n + 1 + W j n ) + a 2 | W j n + 1 2 | 2 ( W j + 1 n + 1 2 + W j 1 n + 1 2 ) = 0 j = 1 , 0 , 1 , , n = 0 , 1 N W j 0 = W 0 ( x j )
Note that W n = ( , W 1 n , W 0 n , W 1 n , ) T , | W n | 2 = d i a g ( , | W 1 n | 2 , | W 0 n | 2 , | W 1 n | 2 ,
) . Then, Equation (5) can be rewritten as
i δ t W n + 1 2 δ x 2 ( W n + 1 + W n ) + a 2 | W n + 1 2 | 2 M W n + 1 2 = 0 , n = 1 N
where
M = 0 1 1 0 1 1 0 1 1 0
In the numerical experiments, in order to test the convergence of the numerical solutions of the above models, we will give the preservation of the conserved quantities’ approximation described in Section 1.

3. The Convergence of the Space-Symmetric Discretization Models

In this section, we give the proof of convergence for the two space-symmetric discretization models in dark solitons’ motion. Suppose that local item M l ( t ) = M ( l h , t ) ( l = , 1 , 0 , 1 , ) ,
M l ( t ) = i d w ( l ) d t + w ( l + 1 ) 2 w ( l ) + w ( l 1 ) h 2 + a | w ( l ) | 2 w ( l )
Lemma 1. 
Suppose that w ( x , t ) is the solution of the original NLSE; the local item M l ( t ) ( l = , 1 , 0 , 1 , ) of the D-D model is O ( h 2 ) .
Proof of Lemma 1. 
w ( l ) ( t ) satisfies the original NLSE, so
i w t ( l ) + w x x ( l ) + a | w ( l ) | 2 w ( l ) = 0
Substituting into Equation (8), we obtain that
M l ( t ) = h 2 w ( l + 1 ) 2 w ( l ) + w ( l 1 ) h 4 w x x ( l ) h 2 = h 2 B l ( t )
According to Taylor’s expansion, w ( l + 1 ) 2 w ( l ) + w ( l 1 ) = h 2 w x x ( l ) + h 4 12 w x x x x ( l ) + O ( h 6 ) , and
B l = w x x ( l ) + h 2 12 w x x x x ( l ) + O ( h 4 ) h 2 w x x ( l ) h 2 = w x x x x ( l ) 12 + O ( h 2 )
Thus, the local item M l ( t ) is of order O ( h 2 ) . □
Theorem 1. 
Assume that W 0 ( x ) is the initial condition of the D-D model ( a < 0 ) , and all derivatives of the initial condition with respect to x satisfy the following:
(1) 
W 0 ( ) and W 0 ( + ) exist, and | W 0 ( ± ) | = ρ ,
(2) 
+ | | W 0 ( x ) | 2 ρ 2 | d x < + and + | k x k W 0 ( x ) | 2 d x < +
and when h 0 , the solution of the D-D model converges to the solution of the original NLSE ( a < 0 ) .
Proof of Theorem 1. 
Suppose that w ( x , t ) is the solution of the original NLSE, W ( l ) ( t ) = W ( l h , t ) is the solution of D-D model, and w ( l ) ( t ) = w ( l h , t ) .
Subtracting Equation (2) from Equation (8), we obtain
i d d t ( w ( l ) W ( l ) ) + w ( l + 1 ) W ( l + 1 ) 2 ( w ( l ) W ( l ) ) + w ( l 1 ) W ( l 1 ) h 2 + a | w ( l ) | 2 w ( l ) a | W ( l ) | 2 W ( l ) = M l
Let error term ε l = w ( l ) W ( l ) ( l = , 1 , 0 , 1 , ) , then
i d ε l d t + ε l + 1 2 ε l + ε l 1 h 2 + a [ ( | w ( l ) | 2 + | W ( l ) | 2 ) ε l + w ( l ) W ( l ) ε ¯ l ] = M l
Multiplying Equation (11) by ε ¯ l (the complex conjugate of ε l ), summing it up for all l, and taking the equations’ imaginary parts, we can obtain
I m i l ε ¯ l ( d ε l d t ) + I m [ l ε ¯ l · ε l + 1 2 ε l + ε l 1 h 2 ] + a I m [ l ( | w ( l ) | 2 + | W ( l ) | 2 ) ε l ε ¯ l + l w ( l ) W ( l ) ε ¯ l 2 ] = I m l M l ε ¯ l
Simplifying the above equation, we then have
1 2 d d t l | ε l | 2 = I m l M l ε ¯ l a I m l w ( l ) W ( l ) ε ¯ l 2
Scaling Equation (12),
(1)
I m l M l ε ¯ l l | M l | | ε ¯ l | 1 2 l h 4 | B l | 2 + l | ε l | 2 .
(2)
Suppose that | | w ( t ) | | = max l | w ( l ) ( t ) | < C , | | W ( t ) | | = max l | W ( l ) ( t ) | < C , and we obtain I m l w ( l ) W ( l ) ε ¯ l 2 C 2 l | ε l | 2 .
Then, we have ( C , C 1 are constants)
d d t l | ε l | 2 C 1 2 h 3 + ( 1 2 a C 2 ) l | ε l | 2
Multiplying both sides of the inequality in Equation (13) by space step size h > 0 , and defining | | . | | as | | ε ( t ) | | 2 = ( ε ( t ) , ε ( t ) ) = h l ε l ( t ) · η l ¯ ( t ) , we obtain
d d t | | ε | | 2 C 1 2 h 4 + ( 1 2 a C 2 ) | | ε | | 2
We can obtain that
| | ε ( T ) | | 2 h 4 C 1 2 1 2 a C 2 e x p T ( 1 2 a C 2 ) ( a < 0 )
where 0 t T . Thus, given a simulation time T, the solution of the D-D model converges to the solution of the original NLSE when h 0 . □
Remark 1. 
Instead of using condition | | W | | 2 < C to prove the convergence in bright solitons’ motion in [25], we use condition | | W | | < C to prove the above conclusion in dark solitons’ motion.
Theorem 2. 
Suppose that w ( x , t ) is the solution of the original NLSE in dark solitons’ motion.  ( a < 0 and | w 0 ( ) |   =   ρ ) , W ( l ) ( t ) = W ( l h , t ) is the solution of the A-L model and w ( l ) ( t ) = w ( l h , t ) . One can find that
| | ε ( T ) | | 2 e x p ( C T ) D h 4 .
Therefore, given a simulation time T, the solution of the A-L model converges to the solution of the original NLSE ( h 0 ) .
Proof of Theorem 2. 
Through a similar method as in [26], we can deduce
| | ε ( T ) | | 2 = | | w ( T ) W ( T ) | | 2 e x p ( C T ) D h 4 .
Then, the above conclusion can be obtained. □

4. The Convergence of the Time–Space Discretization Models

In this section, we give the proof of convergence for the time–space discretization models in dark solitons’ motion. Let the truncation error be φ j n ; then,
i δ t w j n + 1 2 δ x 2 ( w j n + 1 + w j n ) + a 2 | w j n + 1 2 | 2 ( w j + 1 n + 1 2 + w j 1 n + 1 2 ) = φ j n , j = 1 , 0 , 1 , , n = 1 N
Lemma 2. 
Set U n , V n , and the following equalities hold:
(1) 
( δ 2 U n , V n ) = ( δ U n , δ V n ) [23];
(2) 
( M ε n + 1 2 , ε n + 1 2 ) ( M ε ¯ n + 1 2 , ε ¯ n + 1 2 ) = 0 .
Proof of Lemma 2. 
( M ε n + 1 2 , ε n + 1 2 ) ( M ε ¯ n + 1 2 , ε ¯ n + 1 2 ) = j ( ε j + 1 n + 1 2 + ε j 1 n + 1 2 ) ε ¯ j n + 1 2 j ( ε ¯ j + 1 n + 1 2 + ε ¯ j 1 n + 1 2 ) ε j n + 1 2 = j ( ε j + 1 n + 1 2 + ε j 1 n + 1 2 ) ε ¯ j n + 1 2 j ( ε ¯ j n + 1 2 ε j 1 n + 1 2 + ε ¯ j n + 1 2 ε j + 1 n + 1 2 ) = 0
Lemma 3. 
The convergence order of the truncation error | | φ n | | L 2 2 is O ( h 4 + τ 4 ) .
Proof of Lemma 3. 
For Equation (18), according to Taylor’s expansion,
i δ t w j n = i [ t w j n + τ 2 ! 2 t 2 w j n + O ( τ 2 ) ] ; 1 2 δ x 2 ( w j n + 1 + w j n ) = 2 x 2 w j n + 1 2 τ 3 t x 2 w j n + 1 12 h 2 4 x 4 w j n + 1 4 τ 2 4 t 2 x 2 w j n + O ( h 2 τ ) + O ( τ 3 ) ; | w j n + 1 2 | 2 = | w j n | 2 + τ I m ( w j n ) t I m ( w j n ) + τ R e ( w j n ) t R e ( w j n ) + O ( τ 2 ) ; ( w j + 1 n + 1 2 + w j 1 n + 1 2 ) = 2 w j n + τ t w j n + h 2 2 x 2 w j n + 1 2 τ 2 2 t 2 w j n + O ( h 2 τ ) + O ( τ 3 ) ;
we obtain
φ j n = i [ t w j n + τ 2 ! 2 t 2 w j n + O ( τ 2 ) ] + [ 2 x 2 w j n + 1 2 τ 3 t x 2 w j n + 1 12 h 2 4 x 4 w j n + 1 4 · τ 2 4 t 2 x 2 w j n + O ( h 2 τ ) + O ( τ 3 ) ] + a 2 [ | w j n | 2 + τ I m ( w j n ) t I m ( w j n ) + τ R e ( w j n ) t R e ( w j n ) + O ( τ 2 ) ] [ 2 w j n + τ t w j n h 2 2 x 2 w j n + 1 2 τ 2 2 t 2 w j n + O ( h 2 τ ) + O ( τ 3 ) ]
From the original NLSE, we can obtain
i t w j n + 2 x 2 w j n + a | w j n | 2 w j n = 0 ; i 2 t 2 w j n + 3 t x 2 w j n + a t ( w j n | w j n | 2 ) = 0 ;
Substituting them into Equation (19), we find that φ j n is of order O ( h 2 + τ 2 ) or | | φ n | | L 2 2 is of order O ( h 4 + τ 4 ) . □
Lemma 4 
(Gronwall’s inequality [29]). Suppose that { e j } j = 0 is a sequence of nonnegative real numbers satisfying
e n + 1 α + β j = 0 n e j τ , n 0
where α , β and τ are positive constants. We then have the inequality
e n + 1 ( α + τ β e 0 ) e β ( n + 1 ) τ
Theorem 3. 
Suppose that w j n is the solution of the original NLSE in dark solitons’ motion ( a < 0 and | w 0 ( ) | = ρ ) , and W j n is the solution of the Crank–Nicolson method. If the time step τ is sufficiently small, we can obtain
| | ε n | | L 2 2 O ( h 4 + τ 4 )
Then, the Crank–Nicolson method is of order O ( h 2 + τ 2 ) in discrete L 2 -norm error estimates.
Proof of Theorem 3. 
Using a similar method as in [19], we can prove
| | ε n | | L 2 2 O ( h 4 + τ 4 )
Then, this theorem holds. □
Theorem 4. 
Suppose that w j n is the solution of the original NLSE in dark solitons’ motion ( a < 0 and | w 0 ( ) | = ρ ) , and W j n is the solution of the new difference method. If τ is sufficiently small, we can obtain
| | ε n | | L 2 2 O ( h 4 + τ 4 )
so the new difference method’s convergence order is O ( h 2 + τ 2 ) in the discrete L 2 -norm.
Proof of Theorem 4. 
Let ε n = w n W n , and w n satisfy
φ n = i δ t w j n + 1 2 δ x 2 ( w j n + 1 + w j n ) + a 2 | w n + 1 2 | 2 M w n + 1 2 , n = 1 N
Subtracting Equation (6) from Equation (24), we obtain ( n = 1 N ):
φ n = i δ t ε n + 1 2 δ x 2 ( ε n + 1 + ε n ) + a 2 [ | w n + 1 2 | 2 M w n + 1 2 | W n + 1 2 | 2 M W n + 1 2 ]
Taking the inner product of Equation (25) with ε n + 1 2 , and taking the inner product of Equation (25)’s conjugate with ε ¯ n + 1 2 , and then subtracting the obtained two equations, we obtain
( φ n , ε n + 1 2 ) ( φ ¯ n , ε ¯ n + 1 2 ) = I I 1 + I I 2 + I I 3
where
I I 1 = ( i δ t ε n , ε n + 1 2 ) ( i δ t ε ¯ n , ε ¯ n + 1 2 ) = i h | ε j n + 1 | 2 | ε j n | 2 τ = i | | ε n + 1 | | L 2 2 | | ε n | | L 2 2 τ I I 2 = 1 2 [ ( δ x 2 ( ε n + 1 + ε n ) , ε n + 1 2 ) ( δ x 2 ( ε ¯ n + 1 + ε ¯ n ) , ε ¯ n + 1 2 ) ] = 0 ( From   Lemma   2 ) I I 3 = a 2 [ ( | w n + 1 2 | 2 M w n + 1 2 , ε n + 1 2 ) ( | w n + 1 2 | 2 M w ¯ n + 1 2 , ε ¯ n + 1 2 ) ( | W n + 1 2 | 2 M W n + 1 2 , ε n + 1 2 ) ( | W n + 1 2 | 2 M W ¯ n + 1 2 , ε ¯ n + 1 2 ) ( where   ε n = w n W n ) ] = a 2 [ ( ( | w n + 1 2 | 2 | W n + 1 2 | 2 ) M w n + 1 2 , ε n + 1 2 ) ( ( | w n + 1 2 | 2 | W n + 1 2 | 2 ) M w ¯ n + 1 2 , ε ¯ n + 1 2 ) + ( | W n + 1 2 | 2 M ε n + 1 2 , ε n + 1 2 ) ( | W n + 1 2 | 2 M ε ¯ n + 1 2 , ε ¯ n + 1 2 ) ] = a i I m ( ( | w n + 1 2 | 2 | W n + 1 2 | 2 ) M w n + 1 2 , ε n + 1 2 )
According to ( φ n , ε n + 1 2 ) ( φ ¯ n , ε ¯ n + 1 2 ) = 2 i I m ( φ n , ε n + 1 2 ) , it follows that
| | ε n + 1 | | L 2 2 | | ε n | | L 2 2 τ = 2 I m ( φ n , ε n + 1 2 ) a I m ( ( | w n + 1 2 | 2 | W n + 1 2 | 2 ) M w n + 1 2 , ε n + 1 2 )
For the first term on the right side of Equation (26), using the Cauchy–Schwartz inequality, we obtain
2 I m ( φ n , ε n + 1 2 ) | | φ n | | L 2 2 + 1 2 ( | | ε n + 1 | | L 2 2 + | | ε n | | L 2 2 )
For the second term on the right side of Equation (26), we assume that there is a constant C, causing the exact solution of the original NLSE to meet
| | w n | | L C , 0 n N
We can find that
I m ( ( | w n + 1 2 | 2 | W n + 1 2 | 2 ) M w n + 1 2 , ε n + 1 2 ) = 1 16 h j = 1 J [ 2 R e ( w j n + 1 + w j n ) ( ε ¯ j n + 1 + ε ¯ j n ) | ε j n + 1 + ε j n | 2 ] I m ( w j + 1 n + 1 + w j + 1 n + w j 1 n + 1 + w j 1 n ) ( ε j n + 1 + ε j n ) 2 h j = 1 J C 0 2 ( | ε j n + 1 | 2 + | ε j n | 2 ) 2 C 0 2 ( | | ε n + 1 | | L 2 2 + | | ε n | | L 2 2 )
From Equations (26), (27) and (29), we can obtain that
| | ε n + 1 | | L 2 2 | | ε n | | L 2 2 τ | | φ n | | L 2 2 + C τ ( | | ε n + 1 | | L 2 2 + | | ε n | | L 2 2 )
where C = 2 a C 0 2 + 1 2 0 . Since | | ε 0 | | L 2 2 = 0 , then
( 1 C τ ) | | ε n + 1 | | L 2 2 τ m = 0 n | | φ m | | L 2 2 + 2 C τ m = 0 n | | ε m | | L 2 2
As τ 0 , C τ < 1 2 , and according to Lemma 4, we have
| | ε n | | L 2 2 O ( h 4 + τ 4 )

5. Numerical Experiments

In this section, we present the numerical experiments’ results to test the proven theorems. The desktop computer used was a Lenovo ThinkCenter M8600t-D241 with an i7-6700 CPU and 16 G RAM. Consider the initial condition of the original NLSE for one dark soliton
w ( x , 0 ) = ρ 1 + e i 2 θ e λ ( x x 0 ) 1 + e λ ( x x 0 ) ,
where the exact solution is obtained as
w ( x , t ) = ρ e i a ρ 2 t 1 + e i 2 θ e λ ( x x 0 + η · t ) 1 + e λ ( x x 0 + η · t ) .
and λ = 2 a ρ s i n θ , η = 2 a ρ c o s θ , a = 2 , ρ = 0.72 , θ = 0.75 , x 0 = 0.0 .

5.1. Errors and Convergence Order

In this subsection, we give the convergence order of the space-symmetric discretization models and the time–space discretization models via Experiment 1 and Experiment 2.
Experiment 1 : We use the midpoint scheme with symmetry to simulate the D-D model and A-L model, and we choose a fixed minimum time step size τ = 0.0005 in order to reduce the error caused by the difference in time as much as possible. Then, comparing the solution of the space-symmetric discretization model with the exact solution in Equation (33) of the original NLSE, we can obtain error | | ε ( T ) | | 2 and the corresponding convergence order at time t = 1.6 with different space step sizes h = 0.4 , 0.2 , 0.1 , 0.05 . Finally, we plot “ l o g ( | | ε ( T ) | | 2 ) ” with respect to “ l o g ( h ) ” in Figure 1. Table 1 and Table 2 indicate that when space step size h is halved, the error | | ε ( T ) | | 2 decreases to 1 16 , or | | ε ( T ) | | decreases to 1 4 . This means that the convergence order of the D-D model and the A-L model is O ( h 2 ) in the defined norm, which fits the results of Theorems 1 and 2 very well.
Experiment 2 : In order to determine the convergence order of the Crank–Nicolson method and new difference method, we choose the space step sizes h = 0.4 , 0.2 , 0.1 , 0.05 and the time step sizes t = 0.008 , 0.004 , 0.002 , 0.001 . Then, we can calculate the truncation error | | ε n | | L 2 2 , where | | ε n | | L 2 2 = | | w n W n | | L 2 2 . Due to h : τ = K (K is fixed), we choose to plot “ l o g ( | | ε n | | L 2 2 ) ” with respect to “ l o g ( h ) ” in Figure 2. Table 3 and Table 4 and Figure 2 indicate that the convergence order of the Crank–Nicolson method and the new difference method is O ( h 2 + τ 2 ) in the L 2 -norm, which is also in good agreement with the results of Theorems 3 and 4.

5.2. Numerical Simulation of Dark Solitons’ Motion

Experiment 3 : We take the spatial interval x [ 125 , 75 ] and temporal interval from t = 0 to t = 40 with two different pairs of integration parameters:
h = 0.4 , τ = 0.02 .
The numerical solutions for the Crank–Nicolson method and the new difference method are provided in Figure 3 and Figure 4. From the figures, we can see that the two methods simulate the motion of the one dark soliton for the original NLSE very well. This means that the Crank–Nicolson method and the new difference method have strong convergence, which is consistent with our theories.

5.3. Preservation of Invariants

In order to further demonstrate the convergence, we check the preservation of the invariants of these models. We introduce the unique property of the original NLSE mentioned in Section 1, which has infinite conserved quantities. If the model can preserve the conserved quantity of the original NLSE very well, it can be confirmed that the numerical solution has high accuracy and is thus convergent. Here, we take the space step size h = 0.4 and the time step size τ = 0.02 , 0 t = n τ 40 and set e r r ( A ) ( t ) = A ( t ) A ( 0 ) for any invariant A.
Experiment 4 : For the D-D model, we give the preservation of the invariants E 1 and Q 1 . For the A-L model, the invariants F 1 and F 2 have both a real part and an imaginary part, so we present the real and imaginary parts of invariants F 1 and F 2 ( F m = F R m + i F I m ) , respectively. From Figure 5, both the D-D model and A-L model preserve their invariants well, which means that their numerical solutions have high accuracy. Thus, we can draw the conclusion that the space-symmetric discretization models have a good simulation effect from the trend of the invariants’ error, which further confirms the convergence of these models.
Experiment 5 : We use the conserved quantities’ approximation S 1 and S 2 ( S m = S R m + i S I m ) of the original NLSE to test the convergence of the time–space discretization models. As the imaginary part S I 1 of S 1 and the real part S R 2 of S 2 are zero, we only present the evolution of the remaining S R 1 and S I 2 . Figure 6 shows that the time–space discretization models can maintain the conserved quantities’ approximations S 1 and S 2 well, which further illustrates the convergence of these models.

6. Conclusions

For dark solitons’ motion ( a < 0 ,   | W 0 ( ) | = ρ ) , we give two popular space discretization models of the original NLSE by second-order symmetric difference: the direct-discrete model (D-D model) and the Ablowitz–Ladik model (A-L model). On this basis, by applying the midpoint scheme with symmetry to the space-symmetric discretization models, we obtain two time–space discretization models: the Crank–Nicolson method and the new difference method. In dark solitons’ motion, we have proven that the solutions of the D-D model and the A-L model converge to the solution of the original NLSE when h 0 , and their convergence order is O ( h 2 ) in the defined norm. Through numerical experiments, we give the convergence order to verify the convergence of the space-symmetric discretization models. The results of our numerical experiments are in good agreement with the proven theorems. Furthermore, through theoretical proof, we show that the Crank–Nicolson method and new difference method are of order O ( h 2 + τ 2 ) in discrete L 2 -norm error estimates. The corresponding numerical experiments indicate the convergence of the time–space discretization models, which fit the proven theories well.
In future research, we can simulate D-D model and A-L model via numerical methods with different orders. Comparing the error (for different time step sizes) as a function of the execution time, we can obtain the appropriate figures of the numerical methods. Moreover, we will consider simulation through parallel computing. There is little related work, but it is worth studying.

Author Contributions

Conceptualization, Y.L. and Q.L.; methodology, Y.L. and Q.L.; software, Y.L., Q.L. and Q.F.; validation, Y.L., Q.L. and Q.F.; investigation, Y.L.; writing—original draft preparation, Y.L.; writing—review and editing, Q.F.; project administration, Q.F.; funding acquisition, Q.F. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Fundamental Research Funds for the Central Universities (Nos. 2018ZY14, 2019ZY20 and 2015ZCQ-LY-01), the Beijing Higher Education Young Elite Teacher Project (YETP0769) and the National Natural Science Foundation of China (Grant Nos. 61571002, 61179034 and 61370193).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ablowitz, M.J.; Segur, H. Solitons and the Inverse Scattering Transform; SIAM: Philadelphia, PA, USA, 1981. [Google Scholar]
  2. Dodd, R.K.; Eilbeck, J.C.; Gibbon, J.D.; Morris, H.C. Solitons and Nonlinear Wave Equations; Academic Press: New York, NY, USA, 1982. [Google Scholar]
  3. Hasegawa, A. Optical solitons in fibers. In Optical Solitons in Fibers; Springer: Berlin/Heidelberg, Germany, 1989; pp. 1–74. [Google Scholar]
  4. Konotop, V.V. Nonlinear Random Waves; World Scientific: Singapore, 1994. [Google Scholar]
  5. Konotop, V.; Vekslerchik, V. Randomly modulated dark soliton. J. Phys. A Math. Gen. 1991, 24, 767. [Google Scholar] [CrossRef]
  6. Zakharov, V.E.; Shabat, A.B. Interaction between solitons in a stable medium. Sov. Phys. JETP 1973, 37, 823–828. [Google Scholar]
  7. Sanz-Serna, J. Methods for the numerical solution of the nonlinear Schrödinger equation. Math. Comput. 1984, 43, 21–27. [Google Scholar] [CrossRef]
  8. Zhang, L. A high accurate and conservative finite difference scheme for nonlinear Schrödinger equation. Acta Math. Appl. Sin. 2005, 28, 178–186. [Google Scholar]
  9. Fei, Z.; Pérez-García, V.M.; Vázquez, L. Numerical simulation of nonlinear Schrödinger systems: A new conservative scheme. Appl. Math. Comput. 1995, 71, 165–177. [Google Scholar] [CrossRef]
  10. Xu, Y.; Shu, C. Local discontinuous Galerkin methods for nonlinear Schrödinger equations. J. Comput. Phys. 2005, 205, 72–97. [Google Scholar] [CrossRef]
  11. Bratsos, A.; Ehrhardt, M.; Famelis, I.T. A discrete Adomian decomposition method for discrete nonlinear Schrödinger equations. Appl. Math. Comput. 2008, 197, 190–205. [Google Scholar] [CrossRef]
  12. He, J.H. Homotopy perturbation method: A new nonlinear analytical technique. Appl. Math. Comput. 2003, 135, 73–79. [Google Scholar] [CrossRef]
  13. Akrivis, G.D. Finite difference discretization of the cubic Schrödinger equation. IMA J. Numer. Anal. 1993, 13, 115–124. [Google Scholar] [CrossRef]
  14. Borhanifar, A.; Abazari, R. Numerical study of nonlinear Schrödinger and coupled Schrödinger equations by differential transformation method. Opt. Commun. 2010, 283, 2026–2031. [Google Scholar] [CrossRef]
  15. Zhu, B.; Tang, Y.; Zhang, R.; Zhang, Y. Symplectic simulation of dark solitons motion for nonlinear Schrödinger equation. Numer. Algorithms 2019, 81, 1485–1503. [Google Scholar] [CrossRef]
  16. Yao, Y.; Xu, M.; Zhu, B.; Feng, Q. Symplectic schemes and symmetric schemes for nonlinear Schrödinger equation in the case of dark solitons motion. Int. J. Model. Simul. Sci. 2021, 12, 2150056. [Google Scholar] [CrossRef]
  17. Feng, Q.; Huang, J.; Nie, N.; Shang, Z.; Tang, Y. Implementing arbitrarily high-order symplectic methods via Krylov deferred correction technique. Int. J. Model. Simul. Sci. 2010, 1, 277–301. [Google Scholar] [CrossRef]
  18. Zhu, Y. Implicit difference schemes for the generalized non-linear Schrödinger system. J. Comput. Math. 1983, 1, 116–129. [Google Scholar]
  19. Guo, B. The convergence of numerical method for nonlinear Schrodinger equation. J. Comput. Math. 1986, 4, 121–130. [Google Scholar]
  20. Zhang, L.; Chang, Q. A conservative numerical scheme for a class of nonlinear Schrödinger equation with wave operator. Appl. Math. Comput. 2003, 145, 603–612. [Google Scholar] [CrossRef]
  21. Xie, S.; Li, G.; Yi, S. Compact finite difference schemes with high accuracy for one-dimensional nonlinear Schrödinger equation. Comput. Methods Appl. Mech. Eng. 2009, 198, 1052–1060. [Google Scholar] [CrossRef]
  22. Wang, T.C.; Guo, B.L. Unconditional convergence of two conservative compact difference schemes for non-linear Schrödinger equation in one dimension. Sci. Sin. Math. 2011, 41, 207–233. [Google Scholar] [CrossRef]
  23. Li, X.; Zhang, L.; Wang, S. A compact finite difference scheme for the nonlinear Schrödinger equation with wave operator. Appl. Math. Comput. 2012, 219, 3187–3197. [Google Scholar] [CrossRef]
  24. Li, X.; Zhang, L.; Zhang, T. A new numerical scheme for the nonlinear Schrödinger equation with wave operator. J. Appl. Math. Comput. 2017, 54, 109–125. [Google Scholar] [CrossRef]
  25. Tang, Y.; Vázquez, L.; Zhang, F.; Pérez-García, V. Symplectic methods for the nonlinear Schrödinger equation. Comput. Math. with Appl. 1996, 32, 73–83. [Google Scholar] [CrossRef] [Green Version]
  26. Tang, Y.; Pérez-García, V.M.; Vázquez, L. Symplectic methods for the Ablowitz-Ladik model. Appl. Math. Comput. 1997, 82, 17–38. [Google Scholar] [CrossRef]
  27. Hairer, E.; Lubich, C.; Wanner, G. Geometric Numerical Integration; Springer: Berlin/Heidelberg, Germany, 2002. [Google Scholar]
  28. Tang, Y.; Cao, J.; Liu, X.; Sun, Y. Symplectic methods for the Ablowitz–Ladik discrete nonlinear Schrödinger equation. J. Phys. Math. Theor. 2007, 40, 24–25. [Google Scholar] [CrossRef]
  29. Guo, B.; Pascual, P.J.; Rodriguez, M.J.; Vázquez, L. Numerical solution of the sine-Gordon equation. Appl. Math. Comput. 1986, 18, 1–14. [Google Scholar]
Figure 1. Errors and convergence order at time t = 1.6 .
Figure 1. Errors and convergence order at time t = 1.6 .
Symmetry 15 01229 g001
Figure 2. Errors and convergence order at time t = 1.6 .
Figure 2. Errors and convergence order at time t = 1.6 .
Symmetry 15 01229 g002
Figure 3. The numerical solutions for the Crank–Nicolson method.
Figure 3. The numerical solutions for the Crank–Nicolson method.
Symmetry 15 01229 g003
Figure 4. The numerical solutions for the new difference method.
Figure 4. The numerical solutions for the new difference method.
Symmetry 15 01229 g004
Figure 5. Evolution of invariants by the space-symmetric discretization models.
Figure 5. Evolution of invariants by the space-symmetric discretization models.
Symmetry 15 01229 g005
Figure 6. Evolution of invariants by the time–space discretization models.
Figure 6. Evolution of invariants by the time–space discretization models.
Symmetry 15 01229 g006
Table 1. Errors and convergence order of D-D model at time t = 1.6 .
Table 1. Errors and convergence order of D-D model at time t = 1.6 .
h τ | | ε ( T ) | | 2 × 10 6 Order
0.40.000058.804684
0.20.000050.5464164.01416
0.10.000050.0340904.00359
0.050.000050.0021304.00086
Table 2. Errors and convergence order of A-L model at time t = 1.6 .
Table 2. Errors and convergence order of A-L model at time t = 1.6 .
h τ | | ε ( T ) | | 2 × 10 4 Order
0.40.000055.709740
0.20.000050.3546374.01251
0.10.000050.0221284.00330
0.050.000050.0013824.00083
Table 3. Errors and convergence order of Crank–Nicolson method at time t = 1.6 .
Table 3. Errors and convergence order of Crank–Nicolson method at time t = 1.6 .
h τ | | ε n | | L 2 2 × 10 6 Order
0.40.0089.490216
0.20.0040.5893154.01295
0.10.0020.0367714.00331
0.050.0010.0022974.00083
Table 4. Errors and convergence order of new difference method at time t = 1.6 .
Table 4. Errors and convergence order of new difference method at time t = 1.6 .
h τ | | ε n | | L 2 2 × 10 4 Order
0.40.0085.730127
0.20.0040.3559524.01223
0.10.0020.0222114.00323
0.050.0010.0013884.00082
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, Y.; Luo, Q.; Feng, Q. The Convergence of Symmetric Discretization Models for Nonlinear Schrödinger Equation in Dark Solitons’ Motion. Symmetry 2023, 15, 1229. https://doi.org/10.3390/sym15061229

AMA Style

Li Y, Luo Q, Feng Q. The Convergence of Symmetric Discretization Models for Nonlinear Schrödinger Equation in Dark Solitons’ Motion. Symmetry. 2023; 15(6):1229. https://doi.org/10.3390/sym15061229

Chicago/Turabian Style

Li, Yazhuo, Qian Luo, and Quandong Feng. 2023. "The Convergence of Symmetric Discretization Models for Nonlinear Schrödinger Equation in Dark Solitons’ Motion" Symmetry 15, no. 6: 1229. https://doi.org/10.3390/sym15061229

APA Style

Li, Y., Luo, Q., & Feng, Q. (2023). The Convergence of Symmetric Discretization Models for Nonlinear Schrödinger Equation in Dark Solitons’ Motion. Symmetry, 15(6), 1229. https://doi.org/10.3390/sym15061229

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop