# Padé-Sumudu-Adomian Decomposition Method for Nonlinear Schrödinger Equation

Authors: Metomou Richard; Weidong Zhao
Journal: Journal of Applied Mathematics
 (2021)

---

## Abstract

The main purpose of this paper is to solve the nonlinear Schrödinger equation using some suitable analytical and numerical methods such as Sumudu transform, Adomian Decomposition Method (ADM), and Padé approximation technique. In many literatures, we can see the Sumudu Adomian decomposition method (SADM) and the Laplace Adomian decomposition method (LADM); the SADM and LADM provide similar results. The SADM and LADM methods have been applied to solve nonlinear PDE, but the solution has small convergence radius for some PDE. We perform the SADM solution by using the functionPL/M· called double Padé approximation. We will provide the graphical numerical simulations in 3D surface solutions of each application and the absolute error to illustrate the efficiency of the method. In our methods, the nonlinear terms are computed using Adomian polynomials, and the Padé approximation will be used to control the convergence of the series solutions. The suggested technique is successfully applied to nonlinear Schrödinger equations and proved to be highly accurate compared to the Sumudu Adomian decomposition method.


---

## Body

## 1. Introduction

In science and engineering, most problems can be represented by linear or nonlinear ordinary or partial differential equations. To provide more important information about the scientific questions, it is necessary to solve these problems accurately. So to achieve this goal, various researches have been done to find more efficient solutions to these problems. Many analytical and numerical methods have been established. Different powerful mathematical techniques such as Adomian Decomposition Method (ADM) [1–3], Sumudu transform [4], Sumudu Adomian Decomposition method (SADM) [5–7], homotopy perturbation method (HPM), Laplace decomposition method (LDM) [8], Padé approximant [9–13], Laplace transform combined with Padé approximation [14], homotopy perturbation Sumudu transform method (HPSTM) [15], Homotopy Padé Approximate [16], Modified Adomian Decomposition Method [17–19], Homotopy Laplace transform [20], Akbari-Ganji’s Method (AGM) [21–23], and Hopf bifurcation [24] have been proposed to obtain exact and approximate analytic solutions. Inspired by many researchers in this field, we offer a new method called the Padé Sumudu Adomian decomposition method (PSADM) for solving the nonlinear Schrödinger equations in the present paper. We are mentioning that the proposed method is a combination of the Sumudu Adomian decomposition method and Padé approximation. Padé approximation has been applied for rational series solutions in many areas; the technique was developed around 1890 by Henri Padé [11]. The existence and the convergence of subsequences were proved in [12] by Baker. We have known that Padé approximants show high performance over series approximations, and the diagonal Padé approximation is bounded. The Padé approximation can be used to control the convergence of the series. It can be seen in many papers; the Padé approximants give better numerical results than approximation by the polynomial.The Adomian Decomposition Method (ADM) was introduced in 1980 by George Adomian, a new robust method for solving a nonlinear functional equation. The technique has been applied to broad class of stochastic and deterministic problems in biology, physics, and chemical.Wazwaz and Salah introduced the modified Adomian decomposition method; the series solution converges rapidly. The algorithm proposed by Wazwaz for calculating Adomian polynomials for all forms of nonlinearity is not easy to implement due to its massive size of algebraic calculations, complicated trigonometric terms.Choi and Shin proposed a new symbolic implementation code [25]; this technique was a developed method proposed by Wazwaz. The decomposition method has been shown to solve easily, effectively, and accurately a large class of linear and nonlinear ordinary differential equation and has been applied to obtain formal solutions to a broad category of the partial differential equations of fractional orders, when initial and boundary conditions have been given. Abbaoui and Cherruault [26] proved the convergence of the Adomian method for differential and operator equations.In the year 1990, the Sumudu transform was introduced by Gamage K. Watugala to solve differential equations and control engineering problems. The Sumudu transform is an integral transform similar to the Laplace transform; it is equivalent to the Laplace-Carson transforms [27, 28] with the substitution p=1/u. In Sinhala language, the word Sumudu means “smooth.” The Sumudu transform method can only solve linear PDE. In many papers, we can see the modified Sumudu decomposition method [29], the Sumudu Adomian Decomposition Method (SADM) which is a combination of Sumudu transform and Adomian Decomposition Method. The method is applied to solve nonlinear PDE. For some PDE, the SADM solution is not accurate in large domain.In this paper, we will apply our proposed method (PSADM) for solving the most common form of the nonlinear Schrödinger equation to approximate the solution numerically. These applications demonstrate the efficiency and show the advantage of PSADM to be more powerful than SADM.


## 2. Preliminaries

### 2.1. The Sumudu Transform

Sumudu transform was shown to have unit preserving properties and may be used to solve a frequency domain problem in engineering.Definition 1 [4].
(Sumudu transform). The Sumudu transform is defined over the function set:(1)E=ft∣∃M,τ1,τ2>0,∣ft∣<Met/τj,t∈−1j×0,∞,by the formula
(2)Fv=Sfv=Sftv=∫0∞fvte−tdt,v∈−τ1,τ2.By definition, the Sumudu transformS· is a linear operator, that is,
(3)Sc1f+c2gv=c1Sfv+c2Sgv,where c1 and c2 are constants. About the Sumudu transform S·, the following theorems hold.Theorem 2 (Sumudu theorems for multiple differentiations).
Letf∈E and let Fnv denote the Sumudu transform of the nth-order derivative fnt of ft. Then, for n≥1,
(4)Fnv=Fvvn−∑k=0n−1fk0vn−k.Theorem 3 [4].
Let usFv be the Sumudu transform of ft such that
(i)
F1/s/s is a meromorphic function, with singularities having Res<γ, and(ii)
There exists a circular regionΓ with radius R and positive constants, M and K, with
(5)F1/ss<MR−K.Then, the inverse of the Sumudu transform functionFv of the function ft is given by:
(6)ft=S−1Fvt=12iπ∫γ−i∞γ+i∞estF1sdss.Let us denote bySt·v the Sumudu transform with respect to t and Sv−1.t the inverse of the Sumudu transform with respect to v. By using integral by part, we have the following theorem.Theorem 4.
AssumeFx,v is the Sumudu transform Stfx,tv. Then, we have the relation
(7)St∂fx,t∂xv=∂∂xFx,v.


### 2.2. The Adomian Decomposition Method ([1, 2])

George Adomian introduced a new powerful method known as the Adomian decomposition method (ADM) for solving nonlinear functional equations. The Adomian decomposition method has been applied to a various class of initial value or boundary value problems and even stochastic systems, such as ordinary-differential equations, partial-differential equations, integro-differential equations, fractional differential equations, and stochastic differential equations. The method has shown good results in supplying analytical approximation.Let recall the basic principles of the Adomian decomposition method by solving the general nonlinear equation in the form(8)Ltux,t+Lxux,t+Rux,t+Gux,t=Fx,t,where Lt is the highest order differential in t, Lx is the highest order differential in x, R contains the remaining linear terms of lower order derivative terms, Gux,y is the nonlinear term, and Fx,t is the inhomogeneous or forcing term.The decision as to choose which operatorLx or Lt should be used to solve the problem depends on two conditions:
(i)
The operator of lowest order should be selected to minimize the size of computational work(ii)
The selected operator of lowest order should be the best known conditions to accelerate the evaluation of the components of the solutionAssuming that the operatorLt satisfies the two bases of selection.TakeLt−1 in both sides of (8) gives
(9)ux,t=Φ0+Lt−1Fx,t−Lt−1Lxux,t−Lt−1Gux,t−Lt−1Rux,t,Φ0=ux,0forLt=∂∂t,ux,0+tutx,0forLt=∂2∂t2.The Adomian decomposition method consists in looking for the solution in the series form,u=∑n=0∞un. The nonlinear operator is decomposed as
(10)Gux,t=∑n=0∞An,where An are Adomian polynomials of u0,u1,u2,⋯,un which calculated by:
(11)An=1n!dndλng∑i=0∞λiuiλ=0,n=0,1,2,⋯.The first few Adomian polynomials are:(12)A0=Gu0,A1=u1G′u0,A2=u2G′u0+12!u12G′′u0,A3=u3G′u0+u1u2G′′u0+13!u13G′′′u0.The decomposition method consists to identifying:(13)u0=Φ0+Lt−1Fx,t,un=−Lt−1Lxun−1x,t−Lt−1Run−1x,t−An−1,for n=1,2,. After calculating u0,u1,u2,⋯,un,⋯, we obtain the series solution u as
(14)ux,t=u0+u1+u2+u3+⋯.


### 2.3. The Padé Approximation

Padé approximation has been applied for rational series solutions in more papers. It is known that Padé approximants show high performance over series approximations. Padé approximants give better numerical results than approximation by the polynomial. The Padé approximate provides some advantage for controlling the convergences of approximation series.A rational approximation offx on a,b is the quotient of two polynomials RLx and QMx of degrees L and M, respectively. We use the notation L/Mfx or PxL,Mf to denote the quotient:
(15)RLxQMx,x∈a,b.The idea of choosing theRLx and QMx is to make the maximum error maxx∣fx−PxL/Mf∣ as small as possible. For a given amount of computational effort, one can usually construct a rational approximation that has a smaller overall error on a,b than a polynomial approximation. For sufficiently smooth function f, we can properly choose the polynomials RL and QM such that the algebraic accuracy degree of the Padé approximation is L+M.Definition 5.
Letf be function of two variables x and t. We defined two-dimensional Padé approximation PL/Mfx,t of the function f as
(16)PL/Mfx,t=PxL,MPtL,Mfx,t,where PtL,Mfx,t denote the L,M-order Padé approximation of fx,t with respect to the variable t, and PxL,Mfx,t denote the L,M-order Padé approximation of fx,t with respect to the variable x.IfM=L, we will denote the diagonal Padé approximation of order M by PM/Mfx,t and called M,M-order Padé approximation or M-Padé approximation of fx,t.


## 2.1. The Sumudu Transform

Sumudu transform was shown to have unit preserving properties and may be used to solve a frequency domain problem in engineering.Definition 1 [4].
(Sumudu transform). The Sumudu transform is defined over the function set:(1)E=ft∣∃M,τ1,τ2>0,∣ft∣<Met/τj,t∈−1j×0,∞,by the formula
(2)Fv=Sfv=Sftv=∫0∞fvte−tdt,v∈−τ1,τ2.By definition, the Sumudu transformS· is a linear operator, that is,
(3)Sc1f+c2gv=c1Sfv+c2Sgv,where c1 and c2 are constants. About the Sumudu transform S·, the following theorems hold.Theorem 2 (Sumudu theorems for multiple differentiations).
Letf∈E and let Fnv denote the Sumudu transform of the nth-order derivative fnt of ft. Then, for n≥1,
(4)Fnv=Fvvn−∑k=0n−1fk0vn−k.Theorem 3 [4].
Let usFv be the Sumudu transform of ft such that
(i)
F1/s/s is a meromorphic function, with singularities having Res<γ, and(ii)
There exists a circular regionΓ with radius R and positive constants, M and K, with
(5)F1/ss<MR−K.Then, the inverse of the Sumudu transform functionFv of the function ft is given by:
(6)ft=S−1Fvt=12iπ∫γ−i∞γ+i∞estF1sdss.Let us denote bySt·v the Sumudu transform with respect to t and Sv−1.t the inverse of the Sumudu transform with respect to v. By using integral by part, we have the following theorem.Theorem 4.
AssumeFx,v is the Sumudu transform Stfx,tv. Then, we have the relation
(7)St∂fx,t∂xv=∂∂xFx,v.


## 2.2. The Adomian Decomposition Method ([1, 2])

George Adomian introduced a new powerful method known as the Adomian decomposition method (ADM) for solving nonlinear functional equations. The Adomian decomposition method has been applied to a various class of initial value or boundary value problems and even stochastic systems, such as ordinary-differential equations, partial-differential equations, integro-differential equations, fractional differential equations, and stochastic differential equations. The method has shown good results in supplying analytical approximation.Let recall the basic principles of the Adomian decomposition method by solving the general nonlinear equation in the form(8)Ltux,t+Lxux,t+Rux,t+Gux,t=Fx,t,where Lt is the highest order differential in t, Lx is the highest order differential in x, R contains the remaining linear terms of lower order derivative terms, Gux,y is the nonlinear term, and Fx,t is the inhomogeneous or forcing term.The decision as to choose which operatorLx or Lt should be used to solve the problem depends on two conditions:
(i)
The operator of lowest order should be selected to minimize the size of computational work(ii)
The selected operator of lowest order should be the best known conditions to accelerate the evaluation of the components of the solutionAssuming that the operatorLt satisfies the two bases of selection.TakeLt−1 in both sides of (8) gives
(9)ux,t=Φ0+Lt−1Fx,t−Lt−1Lxux,t−Lt−1Gux,t−Lt−1Rux,t,Φ0=ux,0forLt=∂∂t,ux,0+tutx,0forLt=∂2∂t2.The Adomian decomposition method consists in looking for the solution in the series form,u=∑n=0∞un. The nonlinear operator is decomposed as
(10)Gux,t=∑n=0∞An,where An are Adomian polynomials of u0,u1,u2,⋯,un which calculated by:
(11)An=1n!dndλng∑i=0∞λiuiλ=0,n=0,1,2,⋯.The first few Adomian polynomials are:(12)A0=Gu0,A1=u1G′u0,A2=u2G′u0+12!u12G′′u0,A3=u3G′u0+u1u2G′′u0+13!u13G′′′u0.The decomposition method consists to identifying:(13)u0=Φ0+Lt−1Fx,t,un=−Lt−1Lxun−1x,t−Lt−1Run−1x,t−An−1,for n=1,2,. After calculating u0,u1,u2,⋯,un,⋯, we obtain the series solution u as
(14)ux,t=u0+u1+u2+u3+⋯.


## 2.3. The Padé Approximation

Padé approximation has been applied for rational series solutions in more papers. It is known that Padé approximants show high performance over series approximations. Padé approximants give better numerical results than approximation by the polynomial. The Padé approximate provides some advantage for controlling the convergences of approximation series.A rational approximation offx on a,b is the quotient of two polynomials RLx and QMx of degrees L and M, respectively. We use the notation L/Mfx or PxL,Mf to denote the quotient:
(15)RLxQMx,x∈a,b.The idea of choosing theRLx and QMx is to make the maximum error maxx∣fx−PxL/Mf∣ as small as possible. For a given amount of computational effort, one can usually construct a rational approximation that has a smaller overall error on a,b than a polynomial approximation. For sufficiently smooth function f, we can properly choose the polynomials RL and QM such that the algebraic accuracy degree of the Padé approximation is L+M.Definition 5.
Letf be function of two variables x and t. We defined two-dimensional Padé approximation PL/Mfx,t of the function f as
(16)PL/Mfx,t=PxL,MPtL,Mfx,t,where PtL,Mfx,t denote the L,M-order Padé approximation of fx,t with respect to the variable t, and PxL,Mfx,t denote the L,M-order Padé approximation of fx,t with respect to the variable x.IfM=L, we will denote the diagonal Padé approximation of order M by PM/Mfx,t and called M,M-order Padé approximation or M-Padé approximation of fx,t.


## 3. SADM and PSADM for Solving Nonlinear PDEs

In this section, we take the following PDE problem as an example to show the Sumudu Adomian decomposition method (SADM) and the Padé Sumudu Adomian decomposition method (PSADM) for solving nonlinear PDE problems.(17)Ltux,t+Lxux,t+Rux,t+Gux,t=Fx,t,with the initial condition ux,0=hx, where Lt is the first order differential in t, Lx is the highest order differential in x, R contains the remaining linear terms of lower order derivative terms, Gux,y is the nonlinear term, and Fx,t is the inhomogeneous or forcing term.We write the procedures of SADM and PSADM for solving (17) as follows.Step 1.
Take the Sumudu transform to equation (17) to get
(18)Stux,tv=hx+v.St−Lxux,t−Rux,t−Gux,t+Fx,tv.Step 2.
Apply the inverse of the Sumudu transform to the above equation to obtain(19)ux,t=Sv−1hxt+Sv−1v.St−Lxux,t−Rux,t−Gux,t+Fx,tvt⋯Step 3.
Use Adomian decomposition method to decomposite the nonlinear functionGu and the u, respectively, as
(20)Gu=∑n=0∞An,ux,t=∑n=0∞unx,t.Step 4.
Write the equation in the form(21)∑n=0∞unx,t=Sv−1hxt+∑n=0∞Sv−1v−Lxunx,t−Runx,t+Fx,t−Anvt,which lead to the SADM recursive relations:
(22)u0x,t=Sv−1hxt,⋮ukx,t=Sv−1v−Lxuk−1x,t−Ruk−1x,t+Fx,t−Ak−1vt.Step 5.
Deduct the SADM approximation solutionuSADM=ux,t,j:
(23)ux,t,j=u0+u1+⋯+uj.Step 6.
TheL,M-order PSADM solution uPSADM=ux,t,j,L,M is given by
(24)ux,t,j,L,M=PL/MuSADMx,t,if L=M, we denote M-PSADM solution by
(25)ux,t,j,M=PM/MuSADMx,t.


## 4. SADM and PSADM for Solving General Nonlinear Schrödinger Equation

Like Newton’s law in classical physics, the Schrödinger equation is the fundamental equation of quantum physics. It is used to describe the various problems in quantum optics, chemistry, atomic physics, biology, plasma physics, and recently in finance.To illustrate the basic idea of this method, we consider a general nonlinear Schrödinger equation with the initial condition of the form:(26)i∂u∂t+Δu+gu=0,(27)ux,0=hx∈L2,where g represents the general nonlinear term and h is a given analytical function.Using the differentiation property of the Sumudu transform and above initial condition, we have(28)Sti∂u∂tv+StΔu+guv=0,iSt∂u∂tv=−StΔu+guv,Stuv−ux,0v=iStΔu+guv,Stjuv=ux,0+ivStΔu+guv,Stuv=hx+ivStΔu+guv,u=Sv−1hxt+Sv−1ivStΔu+guvt.Let us represent the solutionu as the infinite series
(29)ux,t=∑n=0∞unx,t,and the nonlinear term g as
(30)gux,t=∑n=0∞An,where An are Adomian polynomials of u0,u1,u2,⋯,un which is calculated by:
(31)An=1n!dndλng∑i=0∞λiuiλ=0,n=0,1,2,⋯.The general formula can be simplified. By using (30), for n=0,1,2,3,4⋯ Adomian polynomials An are given by
(32)A0=gu0,A1=u1g′u0,A2=u2g′u0+12!u12g″u0,A3=u3g′u0+u1u2g″u0+13!u13g′″u0,A4=u4g′u0+12!u22+u1u3g″u0+12!u12u2g′″u0+14u14g4u0.⋮Other polynomials can be generated in a similar manner.Then, we have the following algorithm for solving (26) and (27).
(33)∑n=0∞unx,t=Sv−1hxt+Sv−1ivSt∑n=0∞Δunx,t+∑n=0∞Anvt.On comparing both sides, we let(34)u0x,t=Sv−1hxt,u1x,t=Sv−1ivStΔu0x,t+A0vt,u2x,t=Sv−1ivStΔu1x,t+A1vt,⋮unx,t=Sv−1ivStΔun−1x,t+Anvt,n≥0.After calculating the value ofu0,u1,u2,⋯,un,⋯, we obtain the series solution u as
(35)ux,t=u0+u1+u2+u3+⋯.Denote byuSADM=ux,t,j, the Sumudu Adomian Decomposition Method solution is obtain by using u0, u1, u2, u3, u4,…,uj(36)ux,t,j=u0+u1+u2+u3+u4+⋯+uj.Then, theM,M-order Padé Sumudu Adomian Decomposition Method solution is given by
(37)ux,t,j,M=PMMuSADMx,t.


### 4.1. Application 1

Consider the Schrödinger equation of the form:(38)i∂u∂t+Δu+kuα+wxu=0,(39)ux,0=hx,k is real numbers, α=2, wx is function of x, and hx is analytical function.Apply differentiation property of the Sumudu transform, we obtain:(40)Sti∂u∂tv+StΔu+kuα+wxuv=0,iSt∂u∂tv=−StΔu+k∣uα+wxuv,Stuv−ux,0v=iStΔu+k∣uα+wxuv,Stuv=ux,0+ivStΔu+k∣uα+wxuv,Stuv=hx+ivStΔu+k∣uα+wxuv,u=Sv−1hxt+Sv−1ivStΔu+uwx+k∣uαuvt.Let us represent the solution as an infinite series given below(41)ux,t=∑n=0∞unx,t.And the nonlinear term can be decomposed as:(42)gux,t=uαu=∑n=0∞An.For givenα=2(43)gux,t=u2u=∑n=0∞An,where An,n≥0, is given by:
(44)A0=u02u¯0,A1=2u1u0u¯0+u¯1u02,A2=2u0u2u¯0+u12u¯0+2u0u1u¯1+u02u¯2,A3=2u0u¯0u3+2u¯0u1u2+2u0u¯1u2+u12u¯1+2u0u1u¯2+u02u¯3.Case 1.
wx=0, k=2, and hx=eix.Equation (38) becomes:
(45)i∂u∂t+Δu+2u2u=0,ux,0=eix.From (42) and (43), we obtain:
(46)∑n=0∞unx,t=eix+Sv−1iv∑n=0∞StΔun+2Anvt.Then, we deduce the recursive relations:(47)u0x,t=eix,unx,t=Sv−1ivStΔun−1+2An−1vt,n≥1.Then, we obtain:(48)A0=eix,u1=iteix,A1=iteix,u2=−t22eix,A2=−t22!eix,u3=−it33!eix.⋮Accordingly, the series solution is given by(49)ux,t=eix1+it+12!it2+13!it3+⋯.The algorithm is coded by the symbolic computation software Mathematica.We knowux,t=eix+t is the exact solution for the problem.Figures1(a), 1(c), and 1(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and real part of exact solution ux,t in domain D=0,2×0,2 .Figure 1
(a–d) SADM and PSADM solutions using 15 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,15(b)
SADM:Imgux,t,15(c)
PSADM:Reux,t,15,7(d)
PSADM:Imgux,t,15,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures1(b), 1(d), and 1(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and imaginary part of exact solution ux,t in domain D=0,2×0,2.Figures2(a), 2(c), and 2(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and real part of exact solution ux,t in domain D=0,10×0,10.Figure 2
(a–d) SADM and PSADM solutions using 15 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,15(b)
SADM:Imgux,t,15(c)
PSADM:Reux,t,15,7(d)
PSADM:Imgux,t,15,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures2(b), 2(d), and 2(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and imaginary part of exact solution ux,t in domain D=0,10×0,10.Figures3(c) and 3(d) show, respectively, the absolute error for real part and imaginary part of the Padé Sumudu Adomian Decomposition solution ux,t,15,7.Figure 3
Absolute errors.
(a)
SADMAbsReux,t−ux,t,15(b)
SADMAbsReux,t−ux,t,15(c)
PSADMAbsReux,t−ux,t,15,7(d)
PSADMAbsImgux,t−ux,t,15,7Figures3(a) and 3(b) show, respectively, the absolute error for real part and imaginary part of the Sumudu Adomian Decomposition solution ux,t,15.We can see in this case the7,7-order PSADM solution is better than SADM solution in domain D=0,10×0,10, and both methods give almost same result in domain D=0,2×0,2. The graph of absolute error shows that the PSADM solution is more efficient than SADM solution, and PSADM can be performed by choosing different value of M.Case 2.
α=2, wx=0, k=6, and hx=ei3x.Equation (38) becomes:
(50)i∂u∂t+Δu+6u2u=0,ux,0=ei3x,then
(51)u2u=∑n=0∞An,u=Sv−1ei3xt+Sv−1ivStΔu+6∣u2uvt,u2u=∑n=0∞An,u=ei3x+Sv−1ivStΔu+6∣u2uvt,∑n=0∞unx,t=ei3x+Sv−1iv∑n=0∞StΔun+6Anvt,u0x,t=ei3x,u1x,t=Sv−1ivStΔu0+6A0vt,u2x,t=Sv−1ivStΔu1+6A1vt,⋮un+1x,t=Sv−1ivStΔun+6Anvt,n≥0,A0u=ei3x,u1=−3itei3x,u2=−9t22ei3x,u3=27it33!e3ix.Accordingly, the series solution is given by(52)ux,t=ei3x1−3it+3it22!−3it33!+⋯.The algorithm is coded by the symbolic computation software Mathematica.We knowux,t=e3ix−t is the exact solution of the problem.Figures4(a), 4(c), and 4(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,20, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,20,7, and real part of exact solution ux,t in domain D=0,2×0,2 .Figure 4
(a–d) SADM and PSADM solutions using 20 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,20(b)
SADM:Imgux,t,20(c)
PSADM:Reux,t,20,7(d)
PSADM:Imgux,t,20,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures4(b), 4(d), and 4(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,20, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,20,7, and imaginary part of exact solution ux,t in domain D=0,2×0,2.Figures4(a), 4(c), and 4(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,20, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,20,7, and real part of exact solution ux,t in domain D=0,5×0,5. Figures 5(b), 5(d), and 5(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,20, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,20,7, and imaginary part of exact solution ux,t in domain D=0,5×0,5.Figure 5
(a–d) SADM and PSADM solutions using 20 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,20(b)
SADM:Imgux,t,20(c)
PSADM:Reux,t,20,7(d)
PSADM:Imgux,t,20,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures6(c) and 6(d) show, respectively, the absolute error for real part and imaginary part of the Padé Sumudu Adomian Decomposition solution ux,t,20,7.Figure 6
Absolute errors.
(a)
SADMAbsReux,t−ux,t,20(b)
SADMAbsimgux,t−ux,t,20(c)
PSADMAbsReux,t−ux,t,20,7(d)
PSADMAbsimgux,t−ux,t,20,7(e)
PSADMAbsReux,t−ux,t,20,8(f)
PSADMAbsimgux,t−ux,t,20,8Figures6(e) and 6(f) show, respectively, the absolute error for real part and imaginary part of the Padé Sumudu Adomian Decomposition solution ux,t,20,8.Figures6(a) and 6(b) show, respectively, the absolute error for real part and imaginary part of the Sumudu Adomian Decomposition solution ux,t,20.We can see in this case that the7,7-order PSADM solution is better than SADM solution in domain D=0,5×0,5, and both methods give almost the same result in domain D=0,2×0,2. The graph of absolute error shows the PSADM solution can be performed by choosing different value of M.


### 4.2. Application 2: One-Dimensional Nonlinear Schrödinger Equation with Harmonic Oscillator

The nonlinear Schrödinger equation with harmonic oscillator described byu with identical initial condition can be expressed as
(53)∂u∂t−i2mΔu+i2kx2u+iu2u=0,(54)ux,0=eix,where u is the wave function, m is the mass of the particle, i is the imaginary unit to describe motion, and k is the spring constant.In this section, we solve the One-Dimensional Nonlinear Schrödinger Equation with Harmonic Oscillator using Padé Sumudu decomposition.First applying Sumudu transform to both sides of equation (42) as follows:
(55)St∂u∂tv−iSt12mΔuv+iSt12kx2uv+iStu2uv=0.From the properties of Sumudu transform of the first derivative and substituting the initial conditions (54) and (55) becomes
(56)Stuv−ux,0v−iSt12mΔuv+iSt12kx2uv+iStu2uv=0,Stuv=ux,0+ivSt12mΔuv−ivSt12kx2uv−ivStu2uv.By applying inverse Sumudu transform and substituting initial condition, we obtain(57)u=Sv−1eixt+Sv−1ivSt12mΔuvt−Sv−1ivSt12kx2u−u2uvt.Applying Adomian decomposition, we get(58)∑n=0∞unx,t=Sv−1eixt+Sv−1ivSt12mΔ∑n=0∞unvt−Sv−1ivSt12kx2∑n=0∞un−∑n=0∞Anvt,where An are the Adomian Polynomials of u0,u1,u2,⋯,un to replace the nonlinear term u2u=u2u¯ by ∑n=0∞An and u¯ is the conjugate of u. Then, we obtain
(59)u0x,t=Sv−1eixt,u1x,t=Sv−1ivSt12mΔu0vt−Sv−1ivSt12kx2u0−A0vt,⋮unx,t=Sv−1ivSt12mΔun−1−Sv−1ivSt12kx2un−1−An−1vt.Now, we obtain(60)u0x,t=eix,u1x,t=−iteix2m−ikx2teix2−iteix,u2x,t=t22−eix4m2+keix2m+ikxeixm−eixm−kx2eix2m−k2x4eix4−kx2eix−eix,u3x,t=t33!3ieix4m2+3ikx2eix8m2+ieix8m3+3kxeix2m2−7ikeix4m2−3ikeix2m+3ikx2eix2m+3ieix2m+ik3x6eix8+i3k2x4eix4+ieix+3kxeixm+3ik2x4eix8m−7ik2x2eix4m+3k2x3eix2m+3ikx2eix2.The solution is given by(61)ux,t=eix1−it2m−ikx2t2−it+t22−14m2+k2m+ikxm−1m−kx22m−k2x44−kx2−1+t33!3i4m2+3ikx28m2+i8m3+3kx2m2−7ik4m2−3ik2m+3ikx22m+3i2m+ik3x68+i3k2x44+i+3kxm+3ik2x48m−7ik2x24m+3k2x32m+3ikx22⋯.For more simplicity, we will find the numerical approximation givenk=0 and k=1.Case 1.
k=0.
(62)u0=eix,u1=−it2m−iteix,u2=12!−it2m−it2eix,u3=13!−it2m−it3eix,u3=13!−it2m−it3eix,...u15=115!−it2m−it15eix.For a givenm=1. We know the exact solution for the problem is ux,t=eix−3/2t.Figures7(a), 7(c), and 7(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and real part of exact solution ux,t in domain D=0,2×0,2. Figures 7(b), 7(d), and 7(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and imaginary part of exact solution ux,t in domain D=0,2×0,2.Figure 7
(a–d) SADM and PSADM solutions using 15 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,15(b)
SADM:Imgux,t,15(c)
PSADM:Reux,t,15,7(d)
PSADM:Imgux,t,15,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures8(a), 8(c), and 8(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and real part of exact solution ux,t in domain D=0,10×0,10.Figure 8
(a–d) SADM and PSADM solutions using 20 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,15(b)
SADM:Imgux,t,15(c)
PSADM:Reux,t,7,15(d)
PSADM:Imgux,t,7,15(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures8(b), 8(d), and 8(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and imaginary part of exact solution ux,t in domain D=0,10×0,10.Figures9(a) and 9(b) show, respectively, the absolute error for real part and imaginary part of the Sumudu Adomian Decomposition solution ux,t,15. Figures 9(c) and 9(d) show, respectively, the absolute error for real part and imaginary part of the Padé Sumudu Adomian Decomposition solution ux,t,15,7.Figure 9
Absolute errors.
(a)
AbsReux,t−ux,t,15(b)
AbsImgux,t−ux,t,15(c)
AbsReux,t−ux,t,15,7(d)
AbsImgux,t−ux,t,15,7We can see in this case that the7,7-order PSADM solution is better than SADM solution in domain D=0,10×0,1; both methods give almost the same result in D=0,2×0,2. The graph of absolute error shows the high accuracy of PSADM compared to SADM.Case 2.
k=1. In computation, we use 6-order Padé approximation and compute only 3 terms. Figures 10(a) and 10(c) show, respectively, the real part of the SADM solution and the real part of the PSADM in domain D=−2,2×0,1.Figure 10
SADM and PSADM solutions using 3 terms.
(a)
Re[uSADM](b)
Im[uSADM](c)
Re[uPSADM](d)
Im[uPSADM]Figures10(b) and 10(d) show the imaginary part of the solution, respectively, using Sumudu Adomian decomposition method and Padé Sumudu Adomian decomposition method in domain D=−2,2×0,1.Figures11(a) and 11(c) show the real part of the solution using, respectively, Sumudu Adomian decomposition method and Padé Sumudu Adomian decomposition method in domain D=−10,10×0,1.Figure 11
SADM and PSADM solutions using 3 terms.
(a)
Re[uSADM](b)
Im[uSADM](c)
Re[uPSADM](d)
Im[uPSADM]Figures11(b) and 11(d) show where the imaginary part of the solution using, respectively, Sumudu Adomian decomposition method and Padé Sumudu Adomian decomposition method in domain D=−10,10×0,1


## 4.1. Application 1

Consider the Schrödinger equation of the form:(38)i∂u∂t+Δu+kuα+wxu=0,(39)ux,0=hx,k is real numbers, α=2, wx is function of x, and hx is analytical function.Apply differentiation property of the Sumudu transform, we obtain:(40)Sti∂u∂tv+StΔu+kuα+wxuv=0,iSt∂u∂tv=−StΔu+k∣uα+wxuv,Stuv−ux,0v=iStΔu+k∣uα+wxuv,Stuv=ux,0+ivStΔu+k∣uα+wxuv,Stuv=hx+ivStΔu+k∣uα+wxuv,u=Sv−1hxt+Sv−1ivStΔu+uwx+k∣uαuvt.Let us represent the solution as an infinite series given below(41)ux,t=∑n=0∞unx,t.And the nonlinear term can be decomposed as:(42)gux,t=uαu=∑n=0∞An.For givenα=2(43)gux,t=u2u=∑n=0∞An,where An,n≥0, is given by:
(44)A0=u02u¯0,A1=2u1u0u¯0+u¯1u02,A2=2u0u2u¯0+u12u¯0+2u0u1u¯1+u02u¯2,A3=2u0u¯0u3+2u¯0u1u2+2u0u¯1u2+u12u¯1+2u0u1u¯2+u02u¯3.Case 1.
wx=0, k=2, and hx=eix.Equation (38) becomes:
(45)i∂u∂t+Δu+2u2u=0,ux,0=eix.From (42) and (43), we obtain:
(46)∑n=0∞unx,t=eix+Sv−1iv∑n=0∞StΔun+2Anvt.Then, we deduce the recursive relations:(47)u0x,t=eix,unx,t=Sv−1ivStΔun−1+2An−1vt,n≥1.Then, we obtain:(48)A0=eix,u1=iteix,A1=iteix,u2=−t22eix,A2=−t22!eix,u3=−it33!eix.⋮Accordingly, the series solution is given by(49)ux,t=eix1+it+12!it2+13!it3+⋯.The algorithm is coded by the symbolic computation software Mathematica.We knowux,t=eix+t is the exact solution for the problem.Figures1(a), 1(c), and 1(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and real part of exact solution ux,t in domain D=0,2×0,2 .Figure 1
(a–d) SADM and PSADM solutions using 15 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,15(b)
SADM:Imgux,t,15(c)
PSADM:Reux,t,15,7(d)
PSADM:Imgux,t,15,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures1(b), 1(d), and 1(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and imaginary part of exact solution ux,t in domain D=0,2×0,2.Figures2(a), 2(c), and 2(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and real part of exact solution ux,t in domain D=0,10×0,10.Figure 2
(a–d) SADM and PSADM solutions using 15 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,15(b)
SADM:Imgux,t,15(c)
PSADM:Reux,t,15,7(d)
PSADM:Imgux,t,15,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures2(b), 2(d), and 2(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and imaginary part of exact solution ux,t in domain D=0,10×0,10.Figures3(c) and 3(d) show, respectively, the absolute error for real part and imaginary part of the Padé Sumudu Adomian Decomposition solution ux,t,15,7.Figure 3
Absolute errors.
(a)
SADMAbsReux,t−ux,t,15(b)
SADMAbsReux,t−ux,t,15(c)
PSADMAbsReux,t−ux,t,15,7(d)
PSADMAbsImgux,t−ux,t,15,7Figures3(a) and 3(b) show, respectively, the absolute error for real part and imaginary part of the Sumudu Adomian Decomposition solution ux,t,15.We can see in this case the7,7-order PSADM solution is better than SADM solution in domain D=0,10×0,10, and both methods give almost same result in domain D=0,2×0,2. The graph of absolute error shows that the PSADM solution is more efficient than SADM solution, and PSADM can be performed by choosing different value of M.Case 2.
α=2, wx=0, k=6, and hx=ei3x.Equation (38) becomes:
(50)i∂u∂t+Δu+6u2u=0,ux,0=ei3x,then
(51)u2u=∑n=0∞An,u=Sv−1ei3xt+Sv−1ivStΔu+6∣u2uvt,u2u=∑n=0∞An,u=ei3x+Sv−1ivStΔu+6∣u2uvt,∑n=0∞unx,t=ei3x+Sv−1iv∑n=0∞StΔun+6Anvt,u0x,t=ei3x,u1x,t=Sv−1ivStΔu0+6A0vt,u2x,t=Sv−1ivStΔu1+6A1vt,⋮un+1x,t=Sv−1ivStΔun+6Anvt,n≥0,A0u=ei3x,u1=−3itei3x,u2=−9t22ei3x,u3=27it33!e3ix.Accordingly, the series solution is given by(52)ux,t=ei3x1−3it+3it22!−3it33!+⋯.The algorithm is coded by the symbolic computation software Mathematica.We knowux,t=e3ix−t is the exact solution of the problem.Figures4(a), 4(c), and 4(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,20, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,20,7, and real part of exact solution ux,t in domain D=0,2×0,2 .Figure 4
(a–d) SADM and PSADM solutions using 20 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,20(b)
SADM:Imgux,t,20(c)
PSADM:Reux,t,20,7(d)
PSADM:Imgux,t,20,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures4(b), 4(d), and 4(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,20, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,20,7, and imaginary part of exact solution ux,t in domain D=0,2×0,2.Figures4(a), 4(c), and 4(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,20, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,20,7, and real part of exact solution ux,t in domain D=0,5×0,5. Figures 5(b), 5(d), and 5(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,20, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,20,7, and imaginary part of exact solution ux,t in domain D=0,5×0,5.Figure 5
(a–d) SADM and PSADM solutions using 20 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,20(b)
SADM:Imgux,t,20(c)
PSADM:Reux,t,20,7(d)
PSADM:Imgux,t,20,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures6(c) and 6(d) show, respectively, the absolute error for real part and imaginary part of the Padé Sumudu Adomian Decomposition solution ux,t,20,7.Figure 6
Absolute errors.
(a)
SADMAbsReux,t−ux,t,20(b)
SADMAbsimgux,t−ux,t,20(c)
PSADMAbsReux,t−ux,t,20,7(d)
PSADMAbsimgux,t−ux,t,20,7(e)
PSADMAbsReux,t−ux,t,20,8(f)
PSADMAbsimgux,t−ux,t,20,8Figures6(e) and 6(f) show, respectively, the absolute error for real part and imaginary part of the Padé Sumudu Adomian Decomposition solution ux,t,20,8.Figures6(a) and 6(b) show, respectively, the absolute error for real part and imaginary part of the Sumudu Adomian Decomposition solution ux,t,20.We can see in this case that the7,7-order PSADM solution is better than SADM solution in domain D=0,5×0,5, and both methods give almost the same result in domain D=0,2×0,2. The graph of absolute error shows the PSADM solution can be performed by choosing different value of M.


## 4.2. Application 2: One-Dimensional Nonlinear Schrödinger Equation with Harmonic Oscillator

The nonlinear Schrödinger equation with harmonic oscillator described byu with identical initial condition can be expressed as
(53)∂u∂t−i2mΔu+i2kx2u+iu2u=0,(54)ux,0=eix,where u is the wave function, m is the mass of the particle, i is the imaginary unit to describe motion, and k is the spring constant.In this section, we solve the One-Dimensional Nonlinear Schrödinger Equation with Harmonic Oscillator using Padé Sumudu decomposition.First applying Sumudu transform to both sides of equation (42) as follows:
(55)St∂u∂tv−iSt12mΔuv+iSt12kx2uv+iStu2uv=0.From the properties of Sumudu transform of the first derivative and substituting the initial conditions (54) and (55) becomes
(56)Stuv−ux,0v−iSt12mΔuv+iSt12kx2uv+iStu2uv=0,Stuv=ux,0+ivSt12mΔuv−ivSt12kx2uv−ivStu2uv.By applying inverse Sumudu transform and substituting initial condition, we obtain(57)u=Sv−1eixt+Sv−1ivSt12mΔuvt−Sv−1ivSt12kx2u−u2uvt.Applying Adomian decomposition, we get(58)∑n=0∞unx,t=Sv−1eixt+Sv−1ivSt12mΔ∑n=0∞unvt−Sv−1ivSt12kx2∑n=0∞un−∑n=0∞Anvt,where An are the Adomian Polynomials of u0,u1,u2,⋯,un to replace the nonlinear term u2u=u2u¯ by ∑n=0∞An and u¯ is the conjugate of u. Then, we obtain
(59)u0x,t=Sv−1eixt,u1x,t=Sv−1ivSt12mΔu0vt−Sv−1ivSt12kx2u0−A0vt,⋮unx,t=Sv−1ivSt12mΔun−1−Sv−1ivSt12kx2un−1−An−1vt.Now, we obtain(60)u0x,t=eix,u1x,t=−iteix2m−ikx2teix2−iteix,u2x,t=t22−eix4m2+keix2m+ikxeixm−eixm−kx2eix2m−k2x4eix4−kx2eix−eix,u3x,t=t33!3ieix4m2+3ikx2eix8m2+ieix8m3+3kxeix2m2−7ikeix4m2−3ikeix2m+3ikx2eix2m+3ieix2m+ik3x6eix8+i3k2x4eix4+ieix+3kxeixm+3ik2x4eix8m−7ik2x2eix4m+3k2x3eix2m+3ikx2eix2.The solution is given by(61)ux,t=eix1−it2m−ikx2t2−it+t22−14m2+k2m+ikxm−1m−kx22m−k2x44−kx2−1+t33!3i4m2+3ikx28m2+i8m3+3kx2m2−7ik4m2−3ik2m+3ikx22m+3i2m+ik3x68+i3k2x44+i+3kxm+3ik2x48m−7ik2x24m+3k2x32m+3ikx22⋯.For more simplicity, we will find the numerical approximation givenk=0 and k=1.Case 1.
k=0.
(62)u0=eix,u1=−it2m−iteix,u2=12!−it2m−it2eix,u3=13!−it2m−it3eix,u3=13!−it2m−it3eix,...u15=115!−it2m−it15eix.For a givenm=1. We know the exact solution for the problem is ux,t=eix−3/2t.Figures7(a), 7(c), and 7(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and real part of exact solution ux,t in domain D=0,2×0,2. Figures 7(b), 7(d), and 7(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and imaginary part of exact solution ux,t in domain D=0,2×0,2.Figure 7
(a–d) SADM and PSADM solutions using 15 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,15(b)
SADM:Imgux,t,15(c)
PSADM:Reux,t,15,7(d)
PSADM:Imgux,t,15,7(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures8(a), 8(c), and 8(e) show, respectively, the real part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, real part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and real part of exact solution ux,t in domain D=0,10×0,10.Figure 8
(a–d) SADM and PSADM solutions using 20 terms. (e, f) Exact solutions.
(a)
SADM:Reux,t,15(b)
SADM:Imgux,t,15(c)
PSADM:Reux,t,7,15(d)
PSADM:Imgux,t,7,15(e)
Exact:Reux,t(f)
Exact:Imgux,tFigures8(b), 8(d), and 8(f) show, respectively, the imaginary part of Sumudu-Adomian-Decomposition Method solution uSADM=ux,t,15, imaginary part of Padé Sumudu-Adomian-Decomposition Method solution uPSADM=ux,t,15,7, and imaginary part of exact solution ux,t in domain D=0,10×0,10.Figures9(a) and 9(b) show, respectively, the absolute error for real part and imaginary part of the Sumudu Adomian Decomposition solution ux,t,15. Figures 9(c) and 9(d) show, respectively, the absolute error for real part and imaginary part of the Padé Sumudu Adomian Decomposition solution ux,t,15,7.Figure 9
Absolute errors.
(a)
AbsReux,t−ux,t,15(b)
AbsImgux,t−ux,t,15(c)
AbsReux,t−ux,t,15,7(d)
AbsImgux,t−ux,t,15,7We can see in this case that the7,7-order PSADM solution is better than SADM solution in domain D=0,10×0,1; both methods give almost the same result in D=0,2×0,2. The graph of absolute error shows the high accuracy of PSADM compared to SADM.Case 2.
k=1. In computation, we use 6-order Padé approximation and compute only 3 terms. Figures 10(a) and 10(c) show, respectively, the real part of the SADM solution and the real part of the PSADM in domain D=−2,2×0,1.Figure 10
SADM and PSADM solutions using 3 terms.
(a)
Re[uSADM](b)
Im[uSADM](c)
Re[uPSADM](d)
Im[uPSADM]Figures10(b) and 10(d) show the imaginary part of the solution, respectively, using Sumudu Adomian decomposition method and Padé Sumudu Adomian decomposition method in domain D=−2,2×0,1.Figures11(a) and 11(c) show the real part of the solution using, respectively, Sumudu Adomian decomposition method and Padé Sumudu Adomian decomposition method in domain D=−10,10×0,1.Figure 11
SADM and PSADM solutions using 3 terms.
(a)
Re[uSADM](b)
Im[uSADM](c)
Re[uPSADM](d)
Im[uPSADM]Figures11(b) and 11(d) show where the imaginary part of the solution using, respectively, Sumudu Adomian decomposition method and Padé Sumudu Adomian decomposition method in domain D=−10,10×0,1


## 5. Conclusion

This work presented the application of Padé Sumudu Adomian Decomposition method as a technique with high potential to solve nonlinear Schrödinger equations. The Padé Sumudu Adomian decomposition provides an ingenious avenue for controlling the convergence of approximation series. The Padé Sumudu Adomian decomposition method (PSADM) for solving nonlinear Schrödinger equation shown is computationally efficient in our applications. It is worth mentioning that the result is important to researchers in the field of quantum optics, atomic physics, plasma physics, chemistry, biology, finance, and mechanics. This approach can also be generalized to investigate more complicated nonlinear partial differential equations that can only be solved numerically. It should be noted that:(i)
For different values ofM, we obtain different solutions; some of them are not better than the SADM solutions(ii)
For some PDE the PSADMs,uPSADM=PM/MuSADM obtain by using the diagonal Padé approximation are not the best; the PSADMs, uPSADM=PL/MuSADM, for L=M give better approximation than the diagonal Padé approximation(iii)
ForL=0 and M=0, we have polynomial approximation (series expansion)



---

*Source: 6626236-2021-03-05.xml*