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 in discrete -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
where a is a real constant, and is a complex-valued function; , . NLSE is a class of nonlinear partial differential equations, which produces a special type of solution–soliton solution. When and , NLSE has a bright soliton solution [4]; when and , NLSE has a dark soliton solution [5,6]. The original NLSE has infinite conserved quantities, including
where are and , respectively. Utilizing the central difference, we can approximate the conserved quantities as follows:
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 -norm and in the discrete -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 . 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 in space, and then obtain two classical space-symmetric discretization models:
- (1)
- Direct-discrete model (D-D model):
- (2)
- Ablowitz–Ladik model (A-L model):
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 , respectively, and .
We write the exact solution of the original NLSE as and the numerical solution as , and define
Let us define that
Then, the two difference schemes for the original NLSE are as follows:
- (1)
- Crank-Nicolson method
- (2)
- New difference method
Note that
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 ,
Lemma 1.
Suppose that is the solution of the original NLSE; the local item of the D-D model is .
Proof of Lemma 1.
According to Taylor’s expansion, , and
Thus, the local item is of order . □
Theorem 1.
Assume that is the initial condition of the D-D model , and all derivatives of the initial condition with respect to x satisfy the following:
- (1)
- and exist, and ,
- (2)
- and
and when , the solution of the D-D model converges to the solution of the original NLSE .
Proof of Theorem 1.
Suppose that is the solution of the original NLSE, is the solution of D-D model, and .
Subtracting Equation (2) from Equation (8), we obtain
Let error term , then
Multiplying Equation (11) by (the complex conjugate of ), summing it up for all l, and taking the equations’ imaginary parts, we can obtain
Simplifying the above equation, we then have
Scaling Equation (12),
- (1)
- .
- (2)
- Suppose that , , and we obtain .
Then, we have ( are constants)
Multiplying both sides of the inequality in Equation (13) by space step size , and defining as , we obtain
We can obtain that
where . Thus, given a simulation time T, the solution of the D-D model converges to the solution of the original NLSE when . □
Remark 1.
Instead of using condition to prove the convergence in bright solitons’ motion in [25], we use condition to prove the above conclusion in dark solitons’ motion.
Theorem 2.
Suppose that is the solution of the original NLSE in dark solitons’ motion. and , is the solution of the A-L model and . One can find that
Therefore, given a simulation time T, the solution of the A-L model converges to the solution of the original NLSE .
Proof of Theorem 2.
Through a similar method as in [26], we can deduce
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 ; then,
Lemma 2.
Set , and the following equalities hold:
- (1)
- [23];
- (2)
- .
Proof of Lemma 2.
□
Lemma 3.
The convergence order of the truncation error is .
Proof of Lemma 3.
From the original NLSE, we can obtain
Substituting them into Equation (19), we find that is of order or is of order . □
Lemma 4
(Gronwall’s inequality [29]). Suppose that is a sequence of nonnegative real numbers satisfying
where and τ are positive constants. We then have the inequality
Theorem 3.
Suppose that is the solution of the original NLSE in dark solitons’ motion and , and is the solution of the Crank–Nicolson method. If the time step τ is sufficiently small, we can obtain
Then, the Crank–Nicolson method is of order in discrete -norm error estimates.
Proof of Theorem 3.
Using a similar method as in [19], we can prove
Then, this theorem holds. □
Theorem 4.
Suppose that is the solution of the original NLSE in dark solitons’ motion and , and is the solution of the new difference method. If τ is sufficiently small, we can obtain
so the new difference method’s convergence order is in the discrete -norm.
Proof of Theorem 4.
Taking the inner product of Equation (25) with , and taking the inner product of Equation (25)’s conjugate with , and then subtracting the obtained two equations, we obtain
where
According to , it follows that
For the first term on the right side of Equation (26), using the Cauchy–Schwartz inequality, we obtain
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
We can find that
From Equations (26), (27) and (29), we can obtain that
where . Since , then
As , , and according to Lemma 4, we have
□
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
where the exact solution is obtained as
and .
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.
: 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 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 and the corresponding convergence order at time with different space step sizes . Finally, we plot “” with respect to “” in Figure 1. Table 1 and Table 2 indicate that when space step size h is halved, the error decreases to , or decreases to . This means that the convergence order of the D-D model and the A-L model is in the defined norm, which fits the results of Theorems 1 and 2 very well.
Figure 1.
Errors and convergence order at time .
Table 1.
Errors and convergence order of D-D model at time .
Table 2.
Errors and convergence order of A-L model at time .
: In order to determine the convergence order of the Crank–Nicolson method and new difference method, we choose the space step sizes and the time step sizes . Then, we can calculate the truncation error , where . Due to (K is fixed), we choose to plot “” with respect to “” 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 in the -norm, which is also in good agreement with the results of Theorems 3 and 4.
Figure 2.
Errors and convergence order at time .
Table 3.
Errors and convergence order of Crank–Nicolson method at time .
Table 4.
Errors and convergence order of new difference method at time .
5.2. Numerical Simulation of Dark Solitons’ Motion
: We take the spatial interval and temporal interval from to with two different pairs of integration parameters:
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.
Figure 3.
The numerical solutions for the Crank–Nicolson method.
Figure 4.
The numerical solutions for the new difference method.
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 and the time step size , and set for any invariant A.
: For the D-D model, we give the preservation of the invariants and . For the A-L model, the invariants and have both a real part and an imaginary part, so we present the real and imaginary parts of invariants and (, 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.
Figure 5.
Evolution of invariants by the space-symmetric discretization models.
: We use the conserved quantities’ approximation and () of the original NLSE to test the convergence of the time–space discretization models. As the imaginary part of and the real part of are zero, we only present the evolution of the remaining and . Figure 6 shows that the time–space discretization models can maintain the conserved quantities’ approximations and well, which further illustrates the convergence of these models.
Figure 6.
Evolution of invariants by the time–space discretization models.
6. Conclusions
For dark solitons’ motion , 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 , and their convergence order is 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 in discrete -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
- Ablowitz, M.J.; Segur, H. Solitons and the Inverse Scattering Transform; SIAM: Philadelphia, PA, USA, 1981. [Google Scholar]
- 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]
- Hasegawa, A. Optical solitons in fibers. In Optical Solitons in Fibers; Springer: Berlin/Heidelberg, Germany, 1989; pp. 1–74. [Google Scholar]
- Konotop, V.V. Nonlinear Random Waves; World Scientific: Singapore, 1994. [Google Scholar]
- Konotop, V.; Vekslerchik, V. Randomly modulated dark soliton. J. Phys. A Math. Gen. 1991, 24, 767. [Google Scholar] [CrossRef]
- Zakharov, V.E.; Shabat, A.B. Interaction between solitons in a stable medium. Sov. Phys. JETP 1973, 37, 823–828. [Google Scholar]
- Sanz-Serna, J. Methods for the numerical solution of the nonlinear Schrödinger equation. Math. Comput. 1984, 43, 21–27. [Google Scholar] [CrossRef]
- 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]
- 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]
- Xu, Y.; Shu, C. Local discontinuous Galerkin methods for nonlinear Schrödinger equations. J. Comput. Phys. 2005, 205, 72–97. [Google Scholar] [CrossRef]
- 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]
- He, J.H. Homotopy perturbation method: A new nonlinear analytical technique. Appl. Math. Comput. 2003, 135, 73–79. [Google Scholar] [CrossRef]
- Akrivis, G.D. Finite difference discretization of the cubic Schrödinger equation. IMA J. Numer. Anal. 1993, 13, 115–124. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- 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]
- Zhu, Y. Implicit difference schemes for the generalized non-linear Schrödinger system. J. Comput. Math. 1983, 1, 116–129. [Google Scholar]
- Guo, B. The convergence of numerical method for nonlinear Schrodinger equation. J. Comput. Math. 1986, 4, 121–130. [Google Scholar]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Hairer, E.; Lubich, C.; Wanner, G. Geometric Numerical Integration; Springer: Berlin/Heidelberg, Germany, 2002. [Google Scholar]
- 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]
- 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]
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. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).