Numerical Methods for Solving Logarithmic Nonlinear Schrödinger’s Equation ()
1. Introduction
One of the most significant fields of nonlinear optical study recently has been the dynamics of solitons in optical communication [1] - [14]. In the last ten years, there has been a surge in interest in the study of optical solitons with log-law nonlinearity, commonly known as optical Gaussons. Several analytical findings have been made public [15]. The non-linear Schrödinger’s (NLS) equation is employed in different domains, such as mathematical biology, fluid dynamics, plasma physics, nonlinear optics, and many more. The topic of integrability is one of the most critical issues that arise in this context. The NLS equation is rendered unintegrable by the majority of these nonlinear forms. Much research is being conducted all around the world to address the issue of integrability. One of the nonlinearity forms is log-law nonlinearity. As a result of the logarithmic nonlinearity blowing up, there are significant difficulties in designing numerical methods, as well as setting error boundaries for the logarithmic NLS (log NLS) equation. Because of the logarithmic non-linearity and the physical domain’s unboundedness, it’s challenging to build numerical algorithms to solve the logarithmic Schrödinger’s equation over unbounded fields [16].
Biswas and Aceves presented a perturbation approach for studying optical solitons defined by a perturbed nonlinear Schrödinger’s equation in the year 2000 [1]. Power law, parabolic law, dual-power law, and Kerr law are examples of nonlinearities explored by Kohl et al. in 2008 [2]. The optical soliton cooling in the presence of perturbation terms is discussed by Biswas in the same year. Saturable nonlinearity is the sort of nonlinearity that was examined. Gaussian, Sech, super-sech, and super-Gaussian optical pulses are the four kinds studied [3]. In 2010, Biswas et al. found an accurate one-soliton answer to the equation of Schrödinger’s involving the log-law nonlinearity in the existence of transient disturbances [4]. Khalique and Biswas in 2010 developed a method for integrating Schrödinger’s equation having log-law nonlinearity into a single equation. This is accomplished through the use of the Lie symmetry technique. As a result, stationary solutions were discovered [5]. In the same year, Biswas and Milovic used the solitary wave ansatz approach to characterize the one soliton solution of Schrödinger’s equation having log law nonlinearity [6].
Biswas et al. in 2011 it was described how Schrödinger’s nonlinear equation works, which governs optical solitons, is explored using non-Kerr law nonlinearity in the existence of perturbation components with complete nonlinearity [7]. Biswas et al. in 2012 discussed the non-linear optical soliton solution. His variational principle is used to derive Schrödinger’s equation with log law non-linearity [8]. Hongwei et al. in 2019 focused on the approximate solution of the log NLS equation problem on unbounded domains. Unbounded domains make it challenging to create numerical approaches for the logarithmic Schrödinger’s equation, which has nonlinearity and is unbounded [16]. For the log NLS equation, BAO et al. in 2019 proposed and established an error bound for a regularized finite difference technique. The blowup of logarithmic nonlinearity is a key difficulty in creating numerical algorithms and defining error boundaries for the log NLS equation [17].
Wazwaz used the variation iteration approach to conduct research on the logarithmic Schrodinger equation, examining it both with and without a detuning term in 2019 [18]. Salman et al. discussed about the multi-photon absorption and bandpass filters in the same year. He also explained the mean free velocity of optical Gaussons that move with stochastic perturbation [19]. According to Gaxiola et al. in 2020, the Laplace-Adomian decomposition approach is useful in the study of optical Gaussons. The numerical simulations were shown both with and without the detuning term. The scheme’s error assessment was also presented [15]. Darvishiat et al. presented a total of three novel logarithmic nonlinear amplitude equations in 2022. In this study, these logarithmic equations were analyzed in order to locate the Gaussian solitary waves that they produce [20].
2. Problem Statement
In this study, we shall provide numerical solutions to Schrödinger’s nonlinear logarithmic equation in limited domains.
Now we’ll consider, the log NLS equation
(1)
in the finite domain
,
, using the following initial and boundary conditions:
where a denotes the dispersion coefficient of the group velocity and b is the log law nonlinearity coefficient. Group velocity dispersion is a dispersive medium characteristic used to determine how it affects pulse duration. The wave profile is the dependent variable
, whereas the spatial and temporal variables are independent variables x and t, respectively [21].
To sidestep complex calculations, we suppose
(2)
and
are both real-valued functions. By replacing (2) into (1), we can get the coupled system shown below by segregating the real and imaginary portions
(3)
(4)
where
. The system contained in Equations (3) and (4), may be expressed as a matrix-vector as
(5)
where
The log NLS equation’s exact soliton solution is provided by [6] [8] [15], [19] and [21].
(6)
where
,
,
, and
.
Here A denotes the amplitude of Gaussons and
represents the center of Gausson’s phase. The wave number from the phase component is expressed by
, s is the Gausson velocity which is related to its frequency and B indicates the inverse width.
The three preserved quantities in the log NLS Equation (1) are, [6] [19] [21]
(7)
(8)
(9)
where
represents u’s complex conjugate.
3. Numerical Methods
To derive numerical methods for solving Equation (1), numerically, the problem domain is specified as
,
, these coordinates are covered by a rectangular grid of points,
,
,
,
,
, where h and k denote the spatial and temporal increases.
3.1. Explicit Method
To construct an explicit technique for resolving the log NLS equation, we assume
to be the numerical solutions, and
to be accurate solutions, at the point
, where
. To solve Equations (3) and (4), by using the basic explicit finite difference method, which uses forward approximation for time and central difference approximation for space, as follows
(10)
(11)
Equations (10) and (11) can be written as
(12)
(13)
where
,
,
, the resulting system in Equations
(12) and (13) is two level explicit scheme
, we can solve this system for
directly, where we enforce the boundary conditions
3.1.1. Accuracy of the Scheme
To test the effectiveness of the suggested method, we examine the rigor of (10). To achieve this, we substitute the numerical solution
with the accurate solution
, and by applying Taylor’s series expansion of all terms in Equation (10), around the point
, we get the following expansions.
(14)
Equations (14) are substituted into Equation (10) to get
The value of the first bracket will be zero, if differential Equation (3) is used, As a result, the local truncation error will be
(15)
The schema is second order in space and first order in time. It is possible to research the accuracy of the scheme (11) the same way.
3.1.2. Stability of the Scheme
This section looks at the numerical method’s stability, or how sensitive the numerical solution, to examine scheme (1) stability, using the explicit scheme, we write it as follows
(16)
where
. We note that schema (16) is non-linear and the von-Neumann stability analysis can only be used for linear schemas. We can achieve the linear version by freezing the phrase that makes the scheme nonlinear.
(17)
where
. Now we’ll do a von-Neumann stability analysis, as shown below, let
(18)
where
and
are constant,
, then
(19)
Substitute Equations (18) and (19) into Equation (17) we will get
it can also be expressed as
which shows that
, and hence the scheme is unconditionally unstable.
3.2. The Implicit Scheme of Second Order
The explicit scheme developed in the preceding part is second order in space and first order in time, but it has an issue with stability since it is unstable. In this part, we will overcome this problem by designing a Crank-Nicolson-like schema that is unconditionally stable and has second-order precision of space and time. We assume that
and
are the exact and approximate solutions respectively at the point
.
The numerical solution to Equations (3) and (4) are obtained by employing a Crank-Nicolson-like technique,
(20)
(21)
Equations (20) and (21) can be written as
(22)
(23)
where
,
.
The resultant scheme is an implicit nonlinear scheme that generates a block nonlinear tridiagonal system. The nonlinear system obtained may be solved using a variety of approaches. We will, in this paper, utilize the fixed point method to solve Equations (22) and (23). As follows
(24)
(25)
where
, The resulting system in Equations (24) and (25) may be expressed as a matrix-vector,
(26)
The block tridiagonal matrix J may be expressed in the following way:
hence the elements of the matrix J may be described in detail as follows:
where
Crout’s method may be used to solve the system in Equation (26) and we take the initial guess as
. The iteration process is repeated until the following condition is met:
,
where “tol” is a small number used to quantify error.
3.2.1. Accuracy of the Scheme
To investigate the system’s accuracy in Equations (20) and (21), we replace the numerical solution
by the exact solution
and
to get
(27)
(28)
By expanding the terms in Equation (27), using Taylor’s series, we get,
(29)
Then, if we put Equation (29) into Equation (27) we’ll get
and it’s also possible to write it as
When differential Equation (3) is used, all terms within the first and second brackets both have a value of zero, resulting in the local truncation error (LTE) as
(30)
this shows that in both time and space, the scheme is second-order, It is possible to research the accuracy of the scheme (21) the same way.
3.2.2. Scheme’s Stability
The linear form of schema (5), is obtained by freezing the term that makes the scheme nonlinear,
(31)
where
. Now we’ll do a von-Neumann stability analysis, as shown below.
We assume
(32)
where
is referred to as the constant vector, while G is referred to as the amplification matrix and
(33)
Substitute Equations (32) and (33) into Equation (31) we will get
(34)
where
, Equation (34) may be expressed in the following way:
(35)
The G matrix’s eigenvalues are
(36)
The
criterion is required for stability when utilizing von-Neumann. It is clear from (36) that,
, and hence the scheme is unconditionally stable.
4. Numerical Tests
We will try to solve the cases listed below to see how well the suggested strategies work.
4.1. One Soliton
To use the exact solution in Equation (6), we use the initial condition at
,
, this test makes use of the following parameters:
,
,
,
,
,
,
. We investigate the suggested method’s accuracy by computing the
-error norm, as defined by
The error analysis of the explicit technique and the Crank-Nicolson method employing
norms is presented in Table 1 and Table 2, respectively. For both the real and imaginary parts of the equation, the error of the
norm increases as time goes on. Table 3 and Table 4 exhibit the conserved quantities of one soliton using the explicit technique and the Crank-Nicolson method, respectively. Clearly, given the two tables, Crank Nicolson provides far better-conserved quantities than the other. Figure 1 illustrates a single soliton solution using the Explicit approach, with parameters h = 0.1, k = 0.0001 and s = 0.4. A single soliton solution for the identical parameters as Figure 1, is shown in Figure 2 using the Crank Nicolson technique.
Table 1. Error analysis by varying time using explicit method.
Figure 1. Simulation shows a single solution using the explicit scheme with the parameters as
,
,
,
.
Table 2. Error analysis by using crank-nicolson method.
Table 3. Quantities preserved using explicit scheme.
Table 4. Quantities preserved by using crank-nicolson method.
4.2. Collision of Two Solitons
In this exam, we will make a collision between two solitons, by using the following form
where
In this test, the parameters below are utilized.
Detailed numerical study of the interaction between two solitons is reported in Table 5 and Table 6. In this case, the Crank Nicolson scheme is evaluated highly in terms of conservation of quantities since the results obtained by the Explicit technique are inconsistent. Two solitons appear to revert to their original shape after interacting with one another, from left to right, velocities are 0.8 and −0.4 in Figure 3 obtained from the Explicit approach. Figure 4 shows the simulation of interaction of two solitons using Crank-Nicolson scheme, for the same velocities for
. In our observations, the two waves clash and exit the interaction area without causing any change in their identities.
Figure 2. The simulation demonstrates a single solution using the Crank-Nicolson method and parameters
,
,
,
.
Figure 3. Simulation of the interaction of two solitons by using the explicit scheme.
Figure 4. Simulation of the interaction of two solitons by using the Crank-Nicolson scheme for the same parameters in the explicit scheme.
Table 5. Preserved quantities for the collision of two solitons by using the explicit scheme.
Table 6. Preserved quantities for the collision of two solitons by using the Crank-Nicolson scheme.
5. Conclusion
In this paper, we numerically investigated the log NLS equation using both the explicit and implicit scheme of finite difference method. In comparison to the Explicit approach, we found that the Crank-Nicolson method yields findings that are almost as accurate as possible while still conserving the conserved values. The explicit scheme’s precision is of the second order in space and the first order in time, and it is unstable. The Crank-Nicolson scheme is a second-order spatial and temporal accuracy scheme that is also stable under all conditions. Two solitons are seen interacting with each other. We have observed that the collision between the two solitons is flexible.
Data Availability
The article contains the supporting data for the study’s findings.