Sixth Order Finite Difference Method for Three Coupled Nonlinear Schrödinger Equations

Abstract

In this work, we will derive a numerical method of sixth order in space and second order in time for solving 3-coupled nonlinear Schrödinger equations. The numerical method is unconditionally stable. We use the exact single soliton solution and the conserved quantities to check the accuracy and the efficiency of the proposed schemes. Also, we study the interaction dynamics of two solitons. It is found that both elastic and inelastic collisions can take place under suitable parametric conditions.

Share and Cite:

Alamoudi, K. and Hammoudeh, M. (2021) Sixth Order Finite Difference Method for Three Coupled Nonlinear Schrödinger Equations. Advances in Pure Mathematics, 11, 237-253. doi: 10.4236/apm.2021.114017.

1. Introduction

In recent years the concept of soliton has been receiving considerable attention in optical communications. Since soliton is capable of propagating over long distances without change of shape and velocity, it has been found that the soliton propagating through optical fiber arrays is governed by a set of equations related to the coupled nonlinear Schrödinger equation [1] [2] [3].

i q j t + q j x x + 2 [ p = 1 N | q p | 2 ] q j = 0 , j = 1 , 2 , , N (1)

where i 2 = 1 , q j is the envelope or the amplitude of the jth wave packets. Equation (1) reduces to the standard nonlinear Schrödinger equation for N = 1 , to Manakov integrable system for N = 2 , and recently for this case the exact two soliton solution obtained and novel shape changing in elastic collision property has been brought out. The system for N = 3 is of physical interest, in optical communication, and in biophysics, this system can be used to study the lunching and propagation of solitons along the three spines of an alpha-helix shape changing in protein [1] [2] [4] [5]. In this work, we are going to derive a numerical solution for the three coupled nonlinear Schrödinger equations

i q 1 t + q 1 x x + 2 ( | q 1 | 2 + | q 2 | 2 + | q 3 | 2 ) q 1 = 0 , (2)

i q 2 t + q 2 x x + 2 ( | q 1 | 2 + | q 2 | 2 + | q 3 | 2 ) q 2 = 0 , (3)

i q 3 t + q 3 x x + 2 ( | q 1 | 2 + | q 2 | 2 + | q 3 | 2 ) q 3 = 0 , (4)

with initial conditions

q j ( x , 0 ) = g j ( x ) , x L x x R , j = 1 , 2 , 3. (5)

and the homogenous boundary conditions

q j ( x L , t ) = q j ( x R , t ) = 0 , j = 1 , 2 , 3. (6)

The exact soliton solution of the 3-coupled nonlinear Schrödinger equation [2] [3], is given by

q j ( x , t ) = A j k 1 R e i λ I sech ( λ R + R 2 ) , j = 1 , 2 , 3. (7)

Δ 2 = | α 1 ( 1 ) | 2 + | α 1 ( 2 ) | 2 + | α 1 ( 3 ) | 2 ,

A 1 = α 1 ( 1 ) Δ , A 2 = α 1 ( 2 ) Δ , A 2 = α 1 ( 3 ) Δ

e R = Δ 2 ( k 1 + k 1 * ) 2 , λ = k 1 ( x + i k 1 t ) , j = 1 , 2 , 3.

where α 1 ( j ) , k 1 , j = 1 , 2 , 3 are four arbitrary complex parameters. Further 2 k 1 I gives the amplitude of the jth mode and 2 k 1 I the soliton velocity.

The proposed system is of physical interest, in optical communication, and in biophysics. This system can be used to study the lunching and propagation of solitons along the three spines of an alpha-helix shape changing in protein [1] [2] [4] [5]. In this work we are going to derive a numerical method of sixth order in space and second order in time for the three coupled nonlinear Schrödinger Equations (2)-(4).

Many numerical methods for solving the coupled nonlinear Schrödinger equation are derived in the last two decades. Finite difference and finite element methods are used to solve this system by Ismail [3] [6] [7] [8] [9] [10] [11]. A conservative compact finite difference schemes are given in [12] [13]. Xing Lü studied the bright soliton collisions with shape change by intensity for the coupled Sasa-Satsuma system in the optical fiber communications in [4] and [5]. To avoid complex computations, we assume

q 1 = u 1 + i u 2 q 2 = u 3 + i u 4 q 3 = u 5 + i u 6 (8)

where u i ( x , t ) , i = 1 , 2 , , 6 are real functions, by separating the real and imaginary parts, and we write,

u 1 ( x , 0 ) = g 1 R ( x ) , u 2 ( x , 0 ) = g 1 I ( x )

u 3 ( x , 0 ) = g 2 R ( x ) , u 4 ( x , 0 ) = g 2 I ( x )

u 5 ( x , 0 ) = g 3 R ( x ) , u 6 ( x , 0 ) = g 3 I ( x )

and we have assumed

g 1 ( x ) = g 1 R + i g 1 I , g 2 ( x ) = g 2 R + i g 2 I and g 3 ( x ) = g 3 R + i g 3 I

where g j R and g j I , j = 1 , 2 , 3 are real functions.

by substituting (8) into(2)-(4), the following system is obtained:

2 u 1 x 2 = u 2 t 2 ω u 1 (9)

2 u 2 x 2 = u 1 t 2 ω u 2 (10)

2 u 3 x 2 = u 4 t 2 ω u 3 (11)

2 u 4 x 2 = u 3 t 2 ω u 4 (12)

2 u 5 x 2 = u 6 t 2 ω u 5 (13)

2 u 6 x 2 = u 5 t 2 ω u 6 (14)

where

ω = ( u 1 2 + u 2 2 ) + ( u 3 2 + u 4 2 ) + ( u 5 2 + u 6 2 ) (15)

the system (2)-(4) can be written in a matrix-vector form as

u t + A 2 u x 2 + 2 F ( u ) u = 0 (16)

where

u = [ u 1 u 2 u 3 u 4 u 6 u 6 ] , A = [ 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 ] , F ( u ) = [ 0 ω 0 0 0 0 ω 0 0 0 0 0 0 0 0 ω 0 0 0 0 ω 0 0 0 0 0 0 0 0 ω 0 0 0 0 ω 0 ] .

Proposition 1: The three coupled nonlinear Schrödinger equations have the conserved quantities

I 1 = x L x R | q 1 ( x , t ) | 2 d x = = x L x R | q 1 ( x , 0 ) | 2 d x (17)

I 2 = x L x R | q 2 ( x , t ) | 2 d x = = x L x R | q 2 ( x , 0 ) | 2 d x (18)

I 3 = x L x R | q 3 ( x , t ) | 2 d x = = x L x R | q 3 ( x , 0 ) | 2 d x (19)

I 4 = 1 2 x L x R { | q 1 x | 2 | q 2 x | 2 | q 3 x | 2 + 2 ( | q 1 | 2 | q 2 | 2 + | q 1 | 2 | q 3 | 2 + | q 2 | 2 | q 3 | 2 ) + ( | q 1 | 4 + | q 2 | 4 + | q 3 | 4 ) } d x (20)

To prove the first conserved quantity (17), we have

u 1 ( x , t ) t + 2 u 2 ( x , t ) x 2 + ω u 2 ( x , t ) = 0 (21)

u 2 ( x , t ) t 2 u 1 ( x , t ) x 2 ω u 1 ( x , t ) = 0 (22)

by multiplying (21) by u 1 ( x , t ) and (22) by u 2 ( x , t ) , and by adding the resulting equations to obtain

t [ u 1 2 ( x , t ) + u 2 2 ( x , t ) ] + x [ u 1 ( x , t ) u 2 ( x , t ) x u 2 ( x , t ) u 1 ( x , t ) x ] = 0 (23)

Integrating Equation (23) with respect to x from xL to xR and using the vanishing boundary conditions to obtain

t x L x R [ u 1 2 ( x , t ) + u 2 2 ( x , t ) ] d x = 0

and this is the proof of the first conserved quantity (17) The other two conserved quantities (18) and (19) can be proved in the same way.

The exact values of the conserved quantities using the exact soliton solution (7) are given by the following formula

I j = 2 k 1 R | α 1 ( j ) | 2 [ | α 1 ( 1 ) | 2 + | α 1 ( 2 ) | 2 + | α 1 ( 3 ) | 2 ] , j = 1 , 2 , 3 (24)

The paper is organized as follows. In Section 2, we derived the high order compact finite difference scheme. The Fixed-Point scheme is derived in Section 3 to solve the block nonlinear penta-diagonal systems obtained in Section 2. In Section 4, we study the stability of our scheme. The numerical results of the derived method are reported in Section 6. Finally, we draw some conclusions in Section 7.

The scheme in (33)-(38) is of sixth order accuracy in space and second order in time, and it is unconditionally stable using von-Neumann stability analysis. A nonlinear block tridiagonal system must be solved at each time step. Fixed point method is used to do this job, and this will be discussed later.

2. High Order Compact Finite Difference Scheme

The compact finite difference is a numerical method to compute finite difference approximations. Such approximations tend to be more accurate for their stencil size (i.e. their compactness) and, for hyperbolic problems, have favorable dispersive error and dissipative error properties when compared to explicit schemes [14]. In order to develop a numerical method for solving the system given in (2)-(4), the region R = [ x L < x < x R ] × [ t > 0 ] will be covered with a rectangular mesh of points with coordinates,

x m = x L + m h , m = 0 , 1 , 2 , , M

t = t n = n k , n = 0 , 1 , 2 ,

where h and k are the space and time increments respectively. We denote the exact and numerical solution at the grid point ( x m , t n ) by u i , m n and U i , m n + 1 , respectively. To evaluate the second derivatives at interior nodes, we assume that they can be obtained by solving the following penta-diagonal system [14]

α ( 2 u i x 2 ) m 1 + ( 2 u i x 2 ) m + α ( 2 u i x 2 ) m + 1 = b 4 h 2 δ x ^ 2 U i , m + a h 2 δ x 2 U i , m (25)

where

δ x 2 U i , m = U i , m + 1 2 U i , m + U i , m 1

δ x ^ 2 U i , m = U i , m + 2 2 U i , m + U i , m 2 ,

and i = 1 , 2 , , 6 .

Now, by Taylor Expansion, we can have the truncation error as the following

R ( 2 α + 1 b a ) ( 2 u i x 2 ) m + ( α 1 3 b 1 12 a ) h 2 ( 4 u i x 4 ) m + ( 1 12 α 2 45 b 1 360 a ) h 4 ( 6 u i x 6 ) m

if we solve ( 2 α + 1 b a ) = 0 and ( α 1 3 b 1 12 a ) = 0 , we get

a = 4 3 ( 1 α ) and b = 1 3 ( 10 α 1 )

so, the truncation error becomes

R 4 6 ! ( 11 α 2 ) h 4 ( 6 u i x 6 ) m + O ( h 6 )

if α = 0 then a = 4 3 and b = 1 3 which gives the explicit fourth-order scheme for the second derivative. Furthermore, when α = 2 11 , the scheme becomes sixth order accurate, in this case a = 12 11 and b = 3 11 . By substituting these on formula (25) and after simplification, the space derivative of sixth order can be given implicitly as

1 11 [ 2 u m 1 + 11 u m + 2 u m + 1 ] = 3 44 h 2 [ u m 2 + 16 u m 1 34 u m + 16 u m + 1 + u m + 2 ] (26)

Imposing the approximation given on the spatial direction, by using (9)-(14) into Equation (26), we get

( 2 u 1 t , m 1 + 11 u 1 t , m + 2 u 1 t , m + 1 ) = 3 4 h 2 [ u 2 , m 2 + 16 u 2 , m 1 34 u 2 , m + 16 u 2 , m + 1 + u 2 , m + 2 ] ( 2 ω u 2 , m 1 + 11 ω u 2 , m + 2 ω u 2 , m + 1 ) (27)

( 2 u 2 t , m 1 + 11 u 2 t , m + 2 u 2 t , m + 1 ) = 3 4 h 2 [ u 1 , m 2 + 16 u 1 , m 1 34 u 1 , m + 16 u 1 , m + 1 + u 1 , m + 2 ] + ( 2 ω u 1 , m 1 + 11 ω u 1 , m + 2 ω u 1 , m + 1 ) (28)

( 2 u 3 t , m 1 + 11 u 3 t , m + 2 u 3 t , m + 1 ) = 3 4 h 2 [ u 4 , m 2 + 16 u 4 , m 1 34 u 4 , m + 16 u 4 , m + 1 + u 4 , m + 2 ] ( 2 ω u 4 , m 1 + 11 ω u 4 , m + 2 ω u 4 , m + 1 ) (29)

( 2 u 4 t , m 1 + 11 u 4 t , m + 2 u 4 t , m + 1 ) = 3 4 h 2 [ u 3 , m 2 + 16 u 3 , m 1 34 u 3 , m + 16 u 3 , m + 1 + u 3 , m + 2 ] + ( 2 ω u 3 , m 1 + 11 ω u 3 , m + 2 ω u 3 , m + 1 ) (30)

( 2 u 5 t , m 1 + 11 u 5 t , m + 2 u 5 t , m + 1 ) = 3 4 h 2 [ u 6 , m 2 + 16 u 6 , m 1 34 u 6 , m + 16 u 6 , m + 1 + u 6 , m + 2 ] ( 2 ω u 6 , m 1 + 11 ω u 6 , m + 2 ω u 6 , m + 1 ) (31)

( 2 u 6 t , m 1 + 11 u 6 t , m + 2 u 6 t , m + 1 ) = 3 4 h 2 [ u 5 , m 2 + 16 u 5 , m 1 34 u 5 , m + 16 u 5 , m + 1 + u 5 , m + 2 ] + ( 2 ω u 5 , m 1 + 11 ω u 5 , m + 2 ω u 5 , m + 1 ) (32)

The Crank-Nicolson discretization on the temporal direction of the 3-CNLS equation to obtain the numerical scheme

( 2 U 1 , m 1 n + 1 + 11 U 1 , m n + 1 + 2 U 1 , m + 1 n + 1 ) + p ( U 2 , m 2 n + 1 + 16 U 2 , m 1 n + 1 34 U 2 , m n + 1 + 16 U 2 , m + 1 n + 1 + U 2 , m + 2 n + 1 ) = ( 2 U 1 , m 1 n + 11 U 1 , m n + 2 U 1 , m + 1 n ) p ( U 2 , m 2 n + 16 U 2 , m 1 n 34 U 2 , m n + 16 U 2 , m + 1 n + U 2 , m + 2 n ) ( 2 F 2 , m 1 n + 1 + 11 F 2 , m n + 1 + 2 F 2 , m + 1 n + 1 ) (33)

( 2 U 2 , m 1 n + 1 + 11 U 2 , m n + 1 + 2 U 2 , m + 1 n + 1 ) p ( U 1 , m 2 n + 1 + 16 U 1 , m 1 n + 1 34 U 1 , m n + 1 + 16 U 1 , m + 1 n + 1 + U 1 , m + 2 n + 1 ) = ( 2 U 2 , m 1 n + 11 U 2 , m n + 2 U 2 , m + 1 n ) + p ( U 1 , m 2 n + 16 U 1 , m 1 n 34 U 1 , m n + 16 U 1 , m + 1 n + U 1 , m + 2 n ) + ( 2 F 1 , m 1 n + 1 + 11 F 1 , m n + 1 + 2 F 1 , m + 1 n + 1 ) (34)

( 2 U 3 , m 1 n + 1 + 11 U 3 , m n + 1 + 2 U 3 , m + 1 n + 1 ) + p ( U 4 , m 2 n + 1 + 16 U 4 , m 1 n + 1 34 U 4 , m n + 1 + 16 U 4 , m + 1 n + 1 + U 4 , m + 2 n + 1 ) = ( 2 U 3 , m 1 n + 11 U 3 , m n + 2 U 3 , m + 1 n ) p ( U 4 , m 2 n + 16 U 4 , m 1 n 34 U 4 , m n + 16 U 4 , m + 1 n + U 4 , m + 2 n ) ( 2 F 4 , m 1 n + 1 + 11 F 4 , m n + 1 + 2 F 4 , m + 1 n + 1 ) (35)

( 2 U 4 , m 1 n + 1 + 11 U 4 , m n + 1 + 2 U 4 , m + 1 n + 1 ) p ( U 3 , m 2 n + 1 + 16 U 3 , m 1 n + 1 34 U 3 , m n + 1 + 16 U 3 , m + 1 n + 1 + U 3 , m + 2 n + 1 ) = ( 2 U 4 , m 1 n + 11 U 4 , m n + 2 U 4 , m + 1 n ) + p ( U 3 , m 2 n + 16 U 3 , m 1 n 34 U 3 , m n + 16 U 3 , m + 1 n + U 3 , m + 2 n ) + ( 2 F 3 , m 1 n + 1 + 11 F 3 , m n + 1 + 2 F 3 , m + 1 n + 1 ) (36)

( 2 U 5 , m 1 n + 1 + 11 U 5 , m n + 1 + 2 U 5 , m + 1 n + 1 ) + p ( U 6 , m 2 n + 1 + 16 U 6 , m 1 n + 1 34 U 6 , m n + 1 + 16 U 6 , m + 1 n + 1 + U 6 , m + 2 n + 1 ) = ( 2 U 5 , m 1 n + 11 U 5 , m n + 2 U 5 , m + 1 n ) p ( U 6 , m 2 n + 16 U 6 , m 1 n 34 U 6 , m n + 16 U 6 , m + 1 n + U 6 , m + 2 n ) ( 2 F 6 , m 1 n + 1 + 11 F 6 , m n + 1 + 2 F 6 , m + 1 n + 1 ) (37)

( 2 U 6 , m 1 n + 1 + 11 U 6 , m n + 1 + 2 U 6 , m + 1 n + 1 ) p ( U 5 , m 2 n + 1 + 16 U 5 , m 1 n + 1 34 U 5 , m n + 1 + 16 U 5 , m + 1 n + 1 + U 5 , m + 2 n + 1 ) = ( 2 U 6 , m 1 n + 11 U 6 , m n + 2 U 6 , m + 1 n ) + p ( U 5 , m 2 n + 16 U 5 , m 1 n 34 U 5 , m n + 16 U 5 , m + 1 n + U 5 , m + 2 n ) + ( 2 F 5 , m 1 n + 1 + 11 F 5 , m n + 1 + 2 F 5 , m + 1 n + 1 ) (38)

where

(39)

and p = 3 k 8 h 2 .

Equations (33)-(38) form a block pentadiagonal system as the following

[ C D E 0 0 B C D E 0 A B C D E 0 0 0 0 A B C D E 0 A B C D 0 0 A B C ] [ U _ i , 1 U _ i , 2 U _ i , 3 U _ i , M 3 U _ i , M 2 U _ i , M 1 ] = [ G i , 1 G i , 2 G i , 3 G i , M 3 G i , M 2 G i , M 1 ] (40)

where i = 1 , 2 , 3 .

U _ 1 , m = [ U 1 , m n + 1 U 2 , m n + 1 ] , U _ 2 , m = [ U 3 , m n + 1 U 4 , m n + 1 ] , U _ 3 , m = [ U 5 , m n + 1 U 6 , m n + 1 ] A = [ 0 p p 0 ] = E B = [ 2 16 p 16 p 2 ] = D C = [ 11 34 p 34 p 11 ] G 1 , m = [ f 1 , m f 2 , m ] , G 2 , m = [ f 3 , m f 4 , m ] , G 3 , m = [ f 5 , m f 6 , m ]

f 1 , m = ( 2 U 1 , m 1 n + 11 U 1 , m n + 2 U 1 , m + 1 n ) p ( U 2 , m 2 n + 16 U 2 , m 1 n 34 U 2 , m n + 16 U 2 , m + 1 n + U 2 , m + 2 n ) ( 2 F 2 , m 1 n + 1 + 11 F 2 , m n + 1 + 2 F 2 , m + 1 n + 1 )

f 2 , m = ( 2 U 2 , m 1 n + 11 U 2 , m n + 2 U 2 , m + 1 n ) + p ( U 1 , m 2 n + 16 U 1 , m 1 n 34 U 1 , m n + 16 U 1 , m + 1 n + U 1 , m + 2 n ) + ( 2 F 1 , m 1 n + 1 + 11 F 1 , m n + 1 + 2 F 1 , m + 1 n + 1 )

f 3 , m = ( 2 U 3 , m 1 n + 11 U 3 , m n + 2 U 3 , m + 1 n ) p ( U 4 , m 2 n + 16 U 4 , m 1 n 34 U 4 , m n + 16 U 4 , m + 1 n + U 4 , m + 2 n ) ( 2 F 4 , m 1 n + 1 + 11 F 4 , m n + 1 + 2 F 4 , m + 1 n + 1 )

f 4 , m = ( 2 U 4 , m 1 n + 11 U 4 , m n + 2 U 4 , m + 1 n ) + p ( U 3 , m 2 n + 16 U 3 , m 1 n 34 U 3 , m n + 16 U 3 , m + 1 n + U 3 , m + 2 n ) + ( 2 F 3 , m 1 n + 1 + 11 F 3 , m n + 1 + 2 F 3 , m + 1 n + 1 )

f 5 , m = ( 2 U 5 , m 1 n + 11 U 5 , m n + 2 U 5 , m + 1 n ) p ( U 6 , m 2 n + 16 U 6 , m 1 n 34 U 6 , m n + 16 U 6 , m + 1 n + U 6 , m + 2 n ) ( 2 F 6 , m 1 n + 1 + 11 F 6 , m n + 1 + 2 F 6 , m + 1 n + 1 )

f 6 , m = ( 2 U 6 , m 1 n + 11 U 6 , m n + 2 U 6 , m + 1 n ) + p ( U 5 , m 2 n + 16 U 5 , m 1 n 34 U 5 , m n + 16 U 5 , m + 1 n + U 5 , m + 2 n ) + ( 2 F 5 , m 1 n + 1 + 11 F 5 , m n + 1 + 2 F 5 , m + 1 n + 1 )

The present method is of second order accuracy in time and sixth order in space, it is unconditionally stable, see Ismail [11]. The resulting system is a block nonlinear penta-diagonal system which can be solved by fixed point method and this will be discussed next.

3. Fixed Point Method

Since the compact finite difference scheme (40) is nonlinear and implicit, an iterative method is needed to solve it. The fixed point for solving the resulting system can be given in a matrix vector form as follows [6] [14].

[ C D E 0 0 B C D E 0 A B C D E 0 0 0 0 A B C D E 0 A B C D 0 0 A B C ] [ U _ i , 1 ( s + 1 ) U _ i , 2 ( s + 1 ) U _ i , 3 ( s + 1 ) U _ i , M 3 ( s + 1 ) U _ i , M 2 ( s + 1 ) U _ i , M 1 ( s + 1 ) ] = [ G i , 1 ( s ) G i , 2 ( s ) G i , 3 ( s ) G i , M 3 ( s ) G i , M 2 ( s ) G i , M 1 ( s ) ] (41)

where i = 1 , 2 , 3 then

U _ 1 , m ( s + 1 ) = [ U 1 , m n + 1 , ( s + 1 ) U 2 , m n + 1 , ( s + 1 ) ] , U _ 2 , m ( s + 1 ) = [ U 3 , m n + 1 , ( s + 1 ) U 4 , m n + 1 , ( s + 1 ) ] , U _ 3 , m ( s + 1 ) = [ U 5 , m n + 1 , ( s + 1 ) U 6 , m n + 1 , ( s + 1 ) ] G 1 , m ( s ) = [ f 1 , m ( s ) f 2 , m ( s ) ] , G 2 , m = [ f 3 , m ( s ) f 4 , m ( s ) ] , G 3 , m = [ f 5 , m ( s ) f 6 , m ( s ) ]

f 1 , m = ( 2 U 1 , m 1 n + 11 U 1 , m n + 2 U 1 , m + 1 n ) p ( U 2 , m 2 n + 16 U 2 , m 1 n 34 U 2 , m n + 16 U 2 , m + 1 n + U 2 , m + 2 n ) ( 2 F 2 , m 1 n + 1 , ( s ) + 11 F 2 , m n + 1 , ( s ) + 2 F 2 , m + 1 n + 1 , ( s ) )

f 2 , m = ( 2 U 2 , m 1 n + 11 U 2 , m n + 2 U 2 , m + 1 n ) + p ( U 1 , m 2 n + 16 U 1 , m 1 n 34 U 1 , m n + 16 U 1 , m + 1 n + U 1 , m + 2 n ) + ( 2 F 1 , m 1 n + 1 , ( s ) + 11 F 1 , m n + 1 , ( s ) + 2 F 1 , m + 1 n + 1 , ( s ) )

f 3 , m = ( 2 U 3 , m 1 n + 11 U 3 , m n + 2 U 3 , m + 1 n ) p ( U 4 , m 2 n + 16 U 4 , m 1 n 34 U 4 , m n + 16 U 4 , m + 1 n + U 4 , m + 2 n ) ( 2 F 4 , m 1 n + 1 , ( s ) + 11 F 4 , m n + 1 , ( s ) + 2 F 4 , m + 1 n + 1 , ( s ) )

f 4 , m = ( 2 U 4 , m 1 n + 11 U 4 , m n + 2 U 4 , m + 1 n ) + p ( U 3 , m 2 n + 16 U 3 , m 1 n 34 U 3 , m n + 16 U 3 , m + 1 n + U 3 , m + 2 n ) + ( 2 F 3 , m 1 n + 1 , ( s ) + 11 F 3 , m n + 1 , ( s ) + 2 F 3 , m + 1 n + 1 , ( s ) )

f 5 , m = ( 2 U 5 , m 1 n + 11 U 5 , m n + 2 U 5 , m + 1 n ) p ( U 6 , m 2 n + 16 U 6 , m 1 n 34 U 6 , m n + 16 U 6 , m + 1 n + U 6 , m + 2 n ) ( 2 F 6 , m 1 n + 1 , ( s ) + 11 F 6 , m n + 1 , ( s ) + 2 F 6 , m + 1 n + 1 , ( s ) )

f 6 , m = ( 2 U 6 , m 1 n + 11 U 6 , m n + 2 U 6 , m + 1 n ) + p ( U 5 , m 2 n + 16 U 5 , m 1 n 34 U 5 , m n + 16 U 5 , m + 1 n + U 5 , m + 2 n ) + ( 2 F 5 , m 1 n + 1 , ( s ) + 11 F 5 , m n + 1 , ( s ) + 2 F 5 , m + 1 n + 1 , ( s ) )

F j , m n + 1 , ( s ) = k 2 L = 1 3 ( | q i n + 1 , ( s ) | 2 + | q i , m n | 2 ) ( U j , m n + 1 , ( s ) + U j , m n ) , j = 1 , 2 , 3

where the superscript s denotes the sth iterate for solving the nonlinear system of equations for each iteration. The system in (41) can be solved by Crout’s method, where we need only one LU factorization for the block-pentadiagonal matrix at the beginning of the calculation, and the solutions of lower and upper pentadiagonal block systems at each iteration are required only. The initial iterate U m n + 1 , ( 0 ) can be chosen as U m n + 1 , ( 0 ) = U m n . We apply the iterative schemes till the following condition

U m n + 1 , ( s + 1 ) U m n + 1 , ( s ) 10 6

is satisfied.

4. Stability

To study the stability of the scheme (2)-(4) we use the Von Neumann method, we do the following.

As we know Von Neumann method can be applied only for linear schemes, so we must study the linear version of (2)-(4) by freezing the nonlinear terms by assuming

ω = k 2 m j = 1 3 | q j | 2 = constant

where j = 1 , 2 , 3 .

The linear version of imposing the approximation given on the spatial direction (26) and the Crank-Nicolson discretization on the temporal direction of the Equations (2)-(4) can be displayed as follows:

i ( 2 q j , m 1 n + 1 + 11 q j , m n + 1 + 2 q j , m + 1 n + 1 ) + ω p 2 ( 2 q j , m 1 n + 1 + 11 q j , m n + 1 + 2 q j , m + 1 n + 1 ) + p 1 ( q j , m 2 n + 1 + 16 q j , m 1 n + 1 34 q j , m n + 1 + 16 q j , m + 1 n + 1 + q j , m + 2 n + 1 ) = i ( 2 q j , m 1 n + 11 q j , m n + 2 q j , m + 1 n ) ω p 2 ( 2 q j , m 1 n + 11 q j , m n + 2 q j , m + 1 n ) p 1 ( q j , m 2 n + 16 q j , m 1 n 34 q j , m n + 16 q j , m + 1 n + q j , m + 2 n ) (42)

where p 1 = p = 3 k 8 h 2 and p 2 = k 2 .

We assume

q j , m n = e α n k e i β m h , j = 1 , 2 , 3. (43)

By using (43) we can deduce the following relations

q j , m 1 n 2 q j , m n + q j , m + 1 n = 4 sin 2 ( β h 2 ) q j n e i β m h (44)

By substituting (43) and (44) into (42), we can get

i [ 11 + 4 cos ( β h ) ] e α ( n + 1 ) k + ω p 2 [ 11 + 4 cos ( β h ) ] e α ( n + 1 ) k + 2 p 1 [ cos ( β h ) + 16 cos ( β h ) 17 ] e α ( n + 1 ) k = i [ 11 + 4 cos ( β h ) ] e α n k ω p 2 [ 11 + 4 cos ( β h ) ] e α n k 2 p 1 [ cos ( β h ) + 16 cos ( β h ) 17 ] e α n k (45)

We can write equations (45) as

[ ( ω p 2 γ 1 + 2 p 1 γ 2 ) + i γ 1 ] e α k = ( ω p 2 γ 1 + 2 p 1 γ 2 ) + i γ 1

where

γ 1 = 11 + 4 cos ( β h ) and γ 2 = 2 p 1 [ cos ( β h ) + 16 cos ( β h ) 17 ]

then

e α k = ( ω p 2 γ 1 + 2 p 1 γ 2 ) + i γ 1 ( ω p 2 γ 1 + 2 p 1 γ 2 ) + i γ 1

| e α k | 2 = ( ω p 2 γ 1 + 2 p 1 γ 2 ) 2 + γ 1 2 ( ω p 2 γ 1 + 2 p 1 γ 2 ) 2 + γ 1 2 = 1

So, the necessary condition for stability using Von Neumann is the absolute maximum of e α k is less than or equal 1 and it is clearly satisfied then the scheme is unconditionally stable according to Von Neumann stability analysis.

5. Numerical Results

In this section we conduct some typical numerical examples to verify the accuracy, conservation laws, computational efficiency and some physical interaction phenomena described by 3-coupled nonlinear Schrödinger equations.

5.1. Single Soliton

In this test, we choose the initial condition as

q j ( x , 0 ) = A j k 1 R exp ( i k 1 I x ) sech ( k 1 R x + R 2 ) (46)

A j = α 1 ( j ) Δ , e R = Δ 2 ( k 1 + k 1 * ) 2 , Δ 2 = j = 1 3 | α 1 ( j ) | 2 , j = 1 , 2 , 3

The following set of parameters are used

h = 0.1 , k = 0.001 , x l = 30 , t = 0 , 2 , , 10 α 1 ( 1 ) = 1 + i , α 1 ( 2 ) = 0.8 + 0.8 i , α 1 ( 3 ) = 0.5 + 0.5 i , k 1 = 1 + 0.5 i

The conserved quantities and the error for our scheme are displayed in Table 1. We have noticed that the method is conserved the conserved quantities exactly and highly accurate results are obtained. The profile of | q 1 | , | q 2 | and | q 3 | at different times are displayed in Figure 1, Figure 2 and Figure 3 respectively.

To test the convergent rate in space and time of the proposed schemes. We define the L error norm by

where u 1. m n and U 1 , m n are respectively the exact and the numerical solution at the grid point ( x m , t n ) . In this experiment, we take T = 10 .

The convergent rate “order” is calculated by the formula.

Table 1. Errors & conserved quantities of single solitons.

Figure 1. Simulation of single soliton | q 1 | 2 .

Figure 2. Simulation of single soliton | q 2 | 2 .

Figure 3. Simulation of single soliton | q 3 | 2 .

order (rate of convergent in space) = ln ( L ( h 1 ) L ( h 2 ) ) ln ( h 1 h 2 )

order (rate of convergent in time) = ln ( L ( k 1 ) L ( k 2 ) ) ln ( k 1 k 2 )

To calculate the convergent rate in space, we take the time step k sufficiently small and the error from temporal truncation is relatively small k = 0.0001 . From Table 2, we can easily see that the rate of convergent is 6 as we claim in this work.

To check the temporal convergent rate, we fix the spatial step h small enough so that the truncation from space is negligible such as h = 0.01 . The results are given in Table 3 which indicate that the order is 2 as we claim in the text.

To improve the temporal accuracy of the proposed method, we use Richardson Extrapolation on the computed solution to eliminate the lower-order term in the truncation error.

Since our method applied to the scheme is in the form O ( k 2 ) + O ( h 6 ) , we use

u m n 4 U m n ( k / 2 ) U m n ( k ) 3 (47)

to eliminate the term O ( k 2 ) , which makes the final solution fourth-order accurate in time dimension. Although the extrapolation requires two times as

Table 2. Rate of convergence of single solitons ( k = 0.0001 ).

Table 3. Rate of convergence of single solitons ( h = 0.01 ).

much computation as the original scheme plus the application of the formula (47). By using the parameters

h = 0.1 , k = 0.002 , 0.001 , k 1 = 1 + 0.5 i , α 1 ( 1 ) = 1 + i , α 1 ( 2 ) = 0.8 + 0.8 i , α 1 ( 3 ) = 0.5 + 0.5 i

with the extrapolation formula (47), we obtain results which are displayed in Table 4.

5.2. Interaction of Two Solitons

To study the interaction of two solitons with different parameters, we choose the initial condition as a sum of two single solitons of the form

q j ( x , t = 0 ) = q j ( 1 ) ( x , 0 ) + q j ( 2 ) ( x , 0 ) , j = 1 , 2 , 3. (48)

where

q j ( 1 ) ( x , 0 ) = A j ( 1 ) k 1 R exp ( i k 1 I ( x + x 0 ) ) sech ( k 1 R ( x + x 0 ) + R 2 )

q j ( 2 ) ( x , 0 ) = A j ( 2 ) k 1 R exp ( i k 1 I ( x x 0 ) ) sech ( k 1 R ( x x 0 ) + R 2 )

For all examples in the case of interaction, we choose the set of parameters

h = 0.1 , k = 0.01 , x L = 50 , x R = 50 , x 0 = 25

k 1 = 1 + 0.8 i , k 2 = 1 0.4 i

together with different values of { α 1 ( j ) , α 2 ( j ) , j = 1 , 2 , 3 } for each test. We will study the dynamics of the following cases.

5.2.1. Case 1

In this test we choose the set of parameters

α 1 ( 1 ) = 5 , α 1 ( 2 ) = 3.5 , α 1 ( 3 ) = 1 , α 2 ( 1 ) = 10 , α 2 ( 2 ) = 7 , α 2 ( 3 ) = 2.

For this test, we have noticed that

α 1 ( 1 ) α 2 ( 1 ) = α 1 ( 2 ) α 2 ( 2 ) = α 1 ( 3 ) α 2 ( 3 )

which gives us elastic interaction. The interaction scenario is displayed in Figure 4.

Table 4. Richardson extrapolation using L norm.

5.2.2. Case 2

In this test we choose the set of parameters

α 1 ( 1 ) = 5 , α 1 ( 2 ) = 3.5 , α 1 ( 3 ) = 1 , α 2 ( 1 ) = 2 , α 2 ( 2 ) = 2.5 , α 2 ( 3 ) = 0.4

For this test, we have noticed that the formula

α 1 ( 1 ) α 2 ( 1 ) α 1 ( 2 ) α 2 ( 2 ) α 1 ( 3 ) α 2 ( 3 )

is unsatisfied which gives us inelastic interaction and it is clear in Figure 5.

For all cases, the conserved quantities given in Table 5, we have noticed that our method is conserved the conserved quantities exactly.

Figure 4. Elastic interaction of two solitons.

Figure 5. Inelastic interaction of two solitons.

Table 5. Conserved quantities of interaction of two solitons.

6. Conclusion

In this work, we have derived a highly accurate finite difference scheme for solving the 3-coupled nonlinear Schrödinger equation. The scheme is of sixth order in space and second order in time, it is unconditionally stable. A fixed point is used to solve the nonlinear block penta-diagonal system obtained. Single soliton solution and the conserved quantities are used to highlight the robustness of the method. The interaction of two solitons is discussed in detail for different parameters to produce elastic and inelastic interactions. This behavior is agreeing with [1] [2] [3] with the highest accuracy. The derived method can be used to solve similar nonlinear problems.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Kanna, T. and Lakshmanan, M. (2003) Exact Soliton Solutions of Coupled Nonlinear Schrödinger Equation: Shape-Changing Collisions, Logic Gates and Partially Co-Herent Soliton. Physical Review, 67, 046617-046625.
https://doi.org/10.1103/PhysRevE.67.046617
[2] Kanna, T. and Lakshmanan, M. (2001) Exact Soliton Solutions, Shape Changing Collisions and Partially Coherent Solitons in Coupled Nonlinear Schrödinger Equations. Physical Review Letter, 86, 5043-5046.
https://doi.org/10.1103/PhysRevLett.86.5043
[3] Ismail, M.S. and Alaseri, S.H. (2016) Computational Methods for Three Coupled Nonlinear Schrödinger Equations. Applied Mathematics, 7, 2110-2131.
https://doi.org/10.4236/am.2016.717168
[4] Lü X. and Lin, F.H. (2016) Soliton Excitation and Shape-Changing Collisions in Alpha Helical Portions with Interspine Coupling at Higher Order. Communications in Nonlinear Science and Numerical Simulation, 32, 241-261.
https://doi.org/10.1016/j.cnsns.2015.08.008
[5] Lü, X. (2014) Bright-Soliton Collisions with Shape Change by Intensity Redistribution for the Coupled Sasa-Satsuma System in the Optical Fiber Communications. Communications in Nonlinear Science and Numerical Simulation, 19, 3969-3987.
https://doi.org/10.1016/j.cnsns.2014.03.013
[6] Ismail, M.S. (2008) Numerical Solution of Coupled Nonlinear Schrödinger Equation by Galerkin Method. Mathematics and Computers in Simulation, 78, 532-547.
https://doi.org/10.1016/j.matcom.2007.07.003
[7] Ismail, M.S., Al-Basyouni, K.S. and Aydin, A. (2015) Conservative Finite Difference Schemes for the Chiral Nonlinear Schrödinger Equation. Boundary Value Problem, 2015, Article No. 89.
https://doi.org/10.1186/s13661-015-0350-4
[8] Ismail, M.S. (2008) A Fourth-Order Explicit Schemes for the Coupled Nonlinear Schrödinger Equation. Applied Mathematics and Computation, 196, 273-284.
https://doi.org/10.1016/j.amc.2007.05.059
[9] Ismaila, M.S. and Tahab, T.R. (2001) Numerical Simulation of Coupled Nonlinear Schrödinger Equation. Mathematics and Computers in Simulation, 56, 547-562.
https://doi.org/10.1016/S0378-4754(01)00324-X
[10] Ismail, M.S. and Alamri, S.Z. (2004) Highly Accurate Finite Difference Method for Coupled Nonlinear Schrödinger Equation. International Journal of Computer Mathematics, 81, 333-351.
https://doi.org/10.1080/00207160410001661339
[11] Ismail, M.S. and Tahab, T.R. (2007) A Linearly Implicit Conservative Scheme for the Coupled Nonlinear Schrödinger Equation. Mathematics and Computers in Simulation, 74, 302-311.
https://doi.org/10.1016/j.matcom.2006.10.020
[12] Hu, X.L. and Zhang, L.M. (2014) Conservative Compact Difference Schemes for the Coupled Nonlinear Schrödinger System. Numerical Methods Partial Differential Equations, 30, 749-772.
https://doi.org/10.1002/num.21826
[13] Kong, L.H., Hong, J.L., Ji, L.H. and Zhu, P.F. (2015) Compact and Efficient Conservative Schemes for Coupled Nonlinear Schrödinger Equations. Numerical Methods Partial Differential Equations, 31, 1814-1843.
https://doi.org/10.1002/num.21969
[14] Li, J.C. and Chen, Y.-T. (2008) Computational Partial Differential Equations Using MATLAB. Chapman and Hall, New York.
https://doi.org/10.1201/9781420089059

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.