# Approximate Analytical Solution to Nonlinear Delay Differential Equations by Using Sumudu Iterative Method

Authors: Asfaw Tsegaye Moltot; Alemayehu Tamirie Deresse
Journal: Advances in Mathematical Physics
 (2022)

---

## Abstract

In this study, an efficient analytical method called the Sumudu Iterative Method (SIM) is introduced to obtain the solutions for the nonlinear delay differential equation (NDDE). This technique is a mixture of the Sumudu transform method and the new iterative method. The Sumudu transform method is used in this approach to solve the equation’s linear portion, and the new iterative method’s successive iterative producers are used to solve the equation’s nonlinear portion. Some basic properties and theorems which help us to solve the governing problem using the suggested approach are revised. The benefit of this approach is that it solves the equations directly and reliably, without the prerequisite for perturbations or linearization or extensive computer labor. Five sample instances from the DDEs are given to confirm the method’s reliability and effectiveness, and the outcomes are compared with the exact solution with the assistance of tables and graphs after taking the sum of the first eight iterations of the approximate solution. Furthermore, the findings indicate that the recommended strategy is encouraging for solving other types of nonlinear delay differential equations.


---

## Body

## 1. Introduction

The more general kind of differential equations (DEs) is called functional differential equations (FDEs), as well as the delay differential equation (DDE) is the simplest and may be the most natural class of FDEs [1]. DDEs constitute a large and significant class of dynamical systems. Time delays are natural components of the dynamic processes of biology, ecology, physiology, economics, epidemiology, and mechanics, and so a genuine model of these processes must comprise time delays. DDEs are a form of DEs in which the derivative of the unknown function at a specific period is provided in terms of values of the function at past periods. Announcing delays in models enriches the vitality of these models and allows a perfect interpretation of actual occurrences [2–4]. DDEs arise frequently in various physical occurrences. To be precise, they are vital once ordinary differential equation- (ODE-) based models are ineffective. In disparate ODEs, where preliminary conditions are stated at the initial point, DDEs need the history of the system over the delayed intervals which are then provided as preliminary conditions. DDEs are infinite-dimensional and challenging to appraise since delay terms exist in the model [5]. Hence, solving DDEs is an important area of investigation for different scientists.Recently, many researchers established and investigated various analytical and numerical methods to obtain approximate/exact solutions for nonlinear DEs as well as DDEs [6–8]. The variational iteration method (VIM) was employed by the authors of the publication [9–12] to discover a rough solution to nonlinear DDEs. To solve models of delayed vector-borne illnesses and delayed protein degradation, [13] incorporated the differential transform technique, Tarig transformation method, and Padè approximation in 2022. The Padè approximation is applied to this method to broaden the approximation solutions’ convergence domain. Kumar and Methi [14] obtained the numerical result of some NDDEs with the support of Banach contraction method (BCM). To demonstrate that the suggested technique is fit for solving NDDEs, they also offered the numerical results, convergence theorem, and error analysis for various DDEs. In the publication [15], the authors debate an inverse problem for the NDDE that consists of approximating a solution by defining the beginning moment and delay parameter based on the experimental data. The inverse issue is seen as a nonlinear optimal control problem using the stated approach, for which the requisite criteria of optimality are established and shown. A method based on a better parallel evolutionary algorithm is used to solve the derived optimum control issue. In his publication [16], Familua proposes a straightforward method for solving specific second-order DDEs numerically without reducing them to systems of lower orders. Power series and an exponential function were combined to create the approaches utilizing a collocation approach. The first two grid points interpolate the approximation basis functions, and both grid and off-grid points collocate them. Additionally, the author combined the generated schemes and their derivatives to create block techniques, which enable the simultaneous direct solution of second-order DDEs without the laborious requirement of building separate predictors. To analyze the semianalytical solution of the DDEs, the writers of the effort [17] construct a novel technique called the Mohand homotopy perturbation transform method (MHPTM). This approach combines the Mohand transform with the homotopy perturbation method (HPTM). A novel class of neutral FDDEs using the generalized ψ-Caputo derivative on a partially ordered Banach space is investigated by the authors of the study [18]. The Dhage approach and the Banach contraction standard are used to demonstrate the presence and uniqueness of the solutions to the specified boundary value issue. The authors of the paper [19] considered a class of singularly perturbed advanced DDEs of convection-diffusion type. They use finite and hybrid difference schemes to solve the problem on piecewise Shishkin mesh. Readers can consult references [5, 20–24] for more work on DDEs that are linked to their interests.Several intellectuals have created a variety of analytical integral transform techniques for precise and approximated answers during the past few years, including the Laplace transform method [25, 26], Shehu transform method [27, 28], Aboodh transform method [22], Sumudu transform method [29], Elzaki transform method [30], and Mohand transform method [17]. The Sumudu transform method is an integral like the Laplace transform method, introduced in the early 1990s by Watugala [31] to solve DEs and control engineering problems. This method converts a linear DE to an algebraic equation that can be resolved by consuming formal algebraic methods. The initial DE can then be resolved by employing the inverse Sumudu transformations. When matched to other methods, the Sumudu transform technique has the advantage of providing an accurate result quickly and without making any restricting assumptions about the result (see [29]). Unfortunately, this transform fails to crack nonlinear partial DEs, unlike the other integral transforms [32]. In these circumstances, the Sumudu transform method is frequently recycled with other well-used techniques such as the Adomian decomposition method (ADM), HPM, VIM, and the new iterative method [29, 33]. Alternatively, we may frequently employ integral transform techniques such as Laplace, Elzaki, and Shehu in place of the Sumudu transform method. Likewise, techniques like HPM, VIM, and ADM may be employed in place of the new iterative procedure. The HPM, also known as the He-Laplace technique, was developed by Mishra and Tripathi [34] and combines the Laplace transform with He’s polynomials to solve DDEs, which have a variety of applications in physics, digital image processing, signal processing, and applied disciplines. With the usage of the Laplace transform homotopy perturbation approach (He-Laplace method), the writers of the study [35] were able to acquire the approximate analytical solutions of four distinct kinds of conformable partial DEs. We encourage readers to look at the descriptions of a few integral transforms in Table 1 [36].Table 1
Some known integral transforms [17, 22, 36].
Integral transformExpressionElzaki transformEft=u∫0∞e−t/uftdtNatural transformNft=∫0∞e−t/ufstdtShehu transformSft=∫0∞e−st/uftdtSawi transformSft=1/u2∫0∞e−t/uftdtPourreza transformTft=u∫0∞e−u2tftdtAra transformTft=u∫0∞etn−1e−utftdtLaplace transformLft=∫0∞e−utftdtSadik transformSft=1/uβ∫0∞e−uβtftdtMohand transformMft=u2∫0∞e−utftdtMahgoub transformMft=u∫0∞e−utftdtAboodh transformAft=1/u∫0∞e−utftdtThe major goal of this study is to suggest the Sumudu Iterative Method (SIM), a trustworthy analytical technique for obtaining precise answers to NDDEs. This strategy combines the Sumudu transform method with an iterative method, two potent approaches. An iterative method (IM) has been presented by Daftardar-Gejji and Jafari to solve linear and nonlinear functional equations [37–40]. The IM has been effectively applied in many kinds of investigation to solve some linear and nonlinear PDEs and ODEs, NDDEs, higher-order integro-DEs, two-dimensional nonlinear Sine Gordon equation (NLSGE), and Korteweg-de Vries equations [25, 41–43]. The author of the study [29] successfully integrated the double Sumudu transform with the iterative approach to produce an approximate analytical answer to the one-dimensional coupled NLSGE, which cannot be solved by utilizing the double Sumudu transform alone. In this approach, the linear part of the problem was handled utilizing the double Sumudu transform method, and the nonlinear part through an additional iterative approach. According to Deresse [26], recent research has been done on the exact analytical solutions to the 2+1-dimensional nonlinear conformable fractional telegraph equation utilizing the conformable fractional triple Laplace transform approach in blend with the innovative iterative method. In the specified technique, the new iterative method’s consecutive iteration process is used to eliminate the equation’s nonlinear noise components, and one iteration yields the exact answer. While the conformable fractional triple Laplace transform method is reused to resolve the linear constituent of the issue. To solve fractional-order Cauchy reaction-diffusion equations (CRDEs) in a vision of conformable derivative (CD), Rezapour et al. engaged the innovative iterative technique in aggregation with the Shehu transform scheme in their greatest latest publication [44].The primary driving force behind the current study endeavor is the fact that the amalgamation of the Sumudu transform method and the new iterative SIM has not yet been investigated to solve NDDEs in the literature. The linear DDE was the subject of other research projects as well. This study work primarily focuses on NDDEs as a result, which is our second reason for introducing the novel approach SIM. The outcomes of the samples exhibit the accuracy and potency of this method, which does not require the imposition of any extra constraints to arrive at an analytical answer to the anticipated difficulties. It is a skilled scheme for reducing the number of calculations while keeping the answer more accurate and efficient.In this work, we consider the following DDE in the form [22]
(1)dnytdtn+pyt+Nyt−τ=ft,n=1,2,3,⋯,subject to(2)yk0=y0k,where dny/dtn is the derivative of y of order n, P is the linear bounded operator, N is a nonlinear bounded operator, ft is a given continuous function, and y=yt.The remaining parts of this paper are structured as follows: Section2 presents the basic explanations and properties of the Sumudu transform method. In Section 3, we clarify the methodology of the new iterative method. Section 4 demonstrates how SIM is pragmatic to the proposed problem DDE. Section 5 is dedicated to illustrating the SIM to five problems. In Section 6, we talk over the numerical results and illustrate the accuracy and efficiency of the SIM. Lastly, concluding remarks are outlined in Section 7.


## 2. Sumudu Transform Method

The definitions, characteristics, and theorems of the Sumudu transform scheme that we employed in this work are offered in this section (refer to [29, 45–52]).Definition 1.
For any real numberst>0, the function Gu is defined as the Sumudu transform of a function ft which is given by
(3)Sft=Gu=1s∫0∞e−t/uftdt=limτ⟶∞∫0τe−t/uftdt.Definition 2.
The inverse Sumudu transform of a functionGu is denoted by the symbol S−1Gu=ft and is defined by the Bromwich contour integral
(4)S−1Gu=ft=limβ⟶∞12πi∫α−iβα+iβet/uGudu.


### 2.1. Convergence Theorem of Sumudu Transform

Lemma 3.
Letft be a continuous function. If the integral
1/u∫0∞e−t/uftdt converges at u=u0, then the integral converges for u<u0.Theorem 4.
Letn≥1 and let Gnu be the Sumudu transforms of the function fnt, then
(5)G1u=Sf′t=Gu−f0u=Guu−f0u,G2u=Sft=Gu−f0u2−f′0u=Guu2−f0u2−f′0u,...Gnu=Sfnt=Guun−f0un−−f′0un−1−.⋯−fn−10u=Guun−∑k=0n−1fk0un−k.


### 2.2. Existence and Uniqueness of the Sumudu Transform Method

Theorem 5 (existence).
Iff is an exponential order, then its Sumudu transform Sft;u=Gu is given by
(6)Gu=1u∫−∞∞e−t/uftdt,where 1/u=1/η+i/τ.The defining integral forG exists at points 1/u=1/η+i/τ in right half plane 1/η>1/k and 1/ζ>1/L.Theorem 6 (uniqueness).
Letftandgtbe continuous functions defined fort≥0which have Sumudu transforms,FuandGu, respectively. If Fu=Gu almost everywhere, then ft=gt, where u is a complex number.See [45, 46] for the proof.


### 2.3. Some Properties of Sumudu Transform

Property 7.
Over the set of functionA: A=ft∃M,τ1,τ2>0,ft<Metτj,ift∈−1j×0,∞, the Sumudu transform is defined by
(7)Gu=Sft=∫0∞fuate−tdt,u∈−τ1,τ2.Property 8 (linearity property).
Letft and gt be any two functions whose Sumudu transforms exist. Then, for arbitrary constant a and b, we have
(8)Saft+bgt=aSft+bSgt.Proof.
Using the definition of Sumudu transform and property of integral, we have(9)Saft+bgt=∫0∞afut+bgute−tdt=a∫0∞fute−tdt+bgute−tdt=aSft+bSgt.
Hence, the proof.Property 9 (first scale preserving theorem).
IfSft=Gu, then Sfat=Gat, where a is nonzero constant.Proof.
LetSft=Gu=∫0∞fute−tdt, then
(10)Sfat=∫0∞fuate−tdt=Gau.Property 10 (first shifting theorem).
IfSft=Gu, then
(11)Sfteat=11−auGu1−au.Property 11 (second shifting theorem).
IfSf′t=G′u, then Stf′t=uG′u.


## 2.1. Convergence Theorem of Sumudu Transform

Lemma 3.
Letft be a continuous function. If the integral
1/u∫0∞e−t/uftdt converges at u=u0, then the integral converges for u<u0.Theorem 4.
Letn≥1 and let Gnu be the Sumudu transforms of the function fnt, then
(5)G1u=Sf′t=Gu−f0u=Guu−f0u,G2u=Sft=Gu−f0u2−f′0u=Guu2−f0u2−f′0u,...Gnu=Sfnt=Guun−f0un−−f′0un−1−.⋯−fn−10u=Guun−∑k=0n−1fk0un−k.


## 2.2. Existence and Uniqueness of the Sumudu Transform Method

Theorem 5 (existence).
Iff is an exponential order, then its Sumudu transform Sft;u=Gu is given by
(6)Gu=1u∫−∞∞e−t/uftdt,where 1/u=1/η+i/τ.The defining integral forG exists at points 1/u=1/η+i/τ in right half plane 1/η>1/k and 1/ζ>1/L.Theorem 6 (uniqueness).
Letftandgtbe continuous functions defined fort≥0which have Sumudu transforms,FuandGu, respectively. If Fu=Gu almost everywhere, then ft=gt, where u is a complex number.See [45, 46] for the proof.


## 2.3. Some Properties of Sumudu Transform

Property 7.
Over the set of functionA: A=ft∃M,τ1,τ2>0,ft<Metτj,ift∈−1j×0,∞, the Sumudu transform is defined by
(7)Gu=Sft=∫0∞fuate−tdt,u∈−τ1,τ2.Property 8 (linearity property).
Letft and gt be any two functions whose Sumudu transforms exist. Then, for arbitrary constant a and b, we have
(8)Saft+bgt=aSft+bSgt.Proof.
Using the definition of Sumudu transform and property of integral, we have(9)Saft+bgt=∫0∞afut+bgute−tdt=a∫0∞fute−tdt+bgute−tdt=aSft+bSgt.
Hence, the proof.Property 9 (first scale preserving theorem).
IfSft=Gu, then Sfat=Gat, where a is nonzero constant.Proof.
LetSft=Gu=∫0∞fute−tdt, then
(10)Sfat=∫0∞fuate−tdt=Gau.Property 10 (first shifting theorem).
IfSft=Gu, then
(11)Sfteat=11−auGu1−au.Property 11 (second shifting theorem).
IfSf′t=G′u, then Stf′t=uG′u.


## 3. The New Iterative Method (NIM)

Daftardar-Gejji and Jafari [38] have suggested a new iterative method (NIM) for resolving nonlinear functional equations of the form
(12)y=f+Ny,where f is a known function and N a nonlinear operator. In this scheme, we assume that equation (12) has a series answer of the form
(13)y=∑n=0∞ynt.The nonlinear operatorN can be decomposed as
(14)N∑n=0∞yn=Ny0+∑n=1∞N∑n=0kyn−N∑n=0k−1yn,k=1,2,3,.⋯This implies that(15)Ny=Ny0+Ny0+y1−Ny0+Ny0+y1+y2−Ny0+y1+.⋯Using equations (14) and (13) in equation (12), we obtain
(16)N∑n=0∞yn=f+Ny0+∑n=1∞N∑n=0kyn−N∑n=0k−1yn.From equation (16), we define the subsequent recurrence relation:
(17)y0=f,y1=Ny0,y2=Ny0+y1−Ny0,y3=Ny0+y1+y2−Ny0+y1,...yn=Ny0+y1+y2+.⋯+yn−Ny0+y1+y2+⋯+yn−1.As a result, equation (12) is equivalent to
(18)∑n=0∞ynt=f+∑n=1∞ynt.Therefore, thekth term approximate answer of equation (1) is given by yt=∑n=0k−1ynt=y0+y1+y2+y3+⋯+yk−1=f+Ny0+Ny0+y1−Ny0+Ny0+y1+y2−Ny0+y1+.⋯(20)


### 3.1. Convergence of the New Iterative Method

This subsection offers the conditions for the convergence of the series (20). For more details, attracted readers may refer to [53].Theorem 12.
IfN is a continuously differentiable functional in a neighborhood of y0 and Nny0=SupNny0h1,h2,⋯,hn:hi≤1,1≤i≤n≤L, for each “n” and for some real L>0 and yi≤M<1/e,i=1,2,3,⋯, then the series ∑i=0∞yi+1 is absolutely convergent and moreover,
(19)yi+1≤LMnen−1e−1,n=1,2,.⋯Theorem 13.
IfN is a continuously differentiable functional in a neighborhood of y0 and Nny0≤M≤1/e for all n, then the series ∑i=0∞yi+1 is absolutely convergent.


## 3.1. Convergence of the New Iterative Method

This subsection offers the conditions for the convergence of the series (20). For more details, attracted readers may refer to [53].Theorem 12.
IfN is a continuously differentiable functional in a neighborhood of y0 and Nny0=SupNny0h1,h2,⋯,hn:hi≤1,1≤i≤n≤L, for each “n” and for some real L>0 and yi≤M<1/e,i=1,2,3,⋯, then the series ∑i=0∞yi+1 is absolutely convergent and moreover,
(19)yi+1≤LMnen−1e−1,n=1,2,.⋯Theorem 13.
IfN is a continuously differentiable functional in a neighborhood of y0 and Nny0≤M≤1/e for all n, then the series ∑i=0∞yi+1 is absolutely convergent.


## 4. Sumudu Iterative Method (SIM)

In this section, the general form of thenth-order DDE (1) with the initial value (2) is treated using the suggested method SIM.Step 1.
Applying the Sumudu transform on both sides of equation (1), we get
(20)Sdnydtn+SPy+SNyt−τ=Sft.Step 2.
Theorem4is used to obtain
(21)Sytun−Cun−k+SPy+SNyt−τ=Sft,where C=∑k=0n−1fk0.(24)
Replacing (24) into (21) and shortening, we obtain
(22)Syt=ukC−unSPy+unSft−unSNynt−τ.Step 3.
Applying the inverse Sumudu transform on both sides of equation (22), we get
(23)yt=S−1ukC+unSft−unSpy−S−1unSNynt−τ.Step 4.
Now, we surprise the iterative method. We assume that
yt=∑n=0∞ynt is the solution of equation (1).Step 5.
Substituting equation (27) into equation (23), we acquire
(24)∑n=0∞ynt=S−1ukC+unSft−unSpy−S−1unSN∑n=0∞ynt−τ.Step 6.
Using (16), decompose the nonlinear termN∑n=0∞ynt−τin equation (24) as follows:
(25)∑n=0∞Nyt−τ=Ny0+∑n=1∞N∑n=0kyn−N∑n=0k−1yn.Step 7.
Replacing equation (25) in equation (24), we get
(26)∑n=0∞ynt=S−1ukC+unSft−unSpy−S−1unSNy0+∑n=1∞N∑n=0kyn−N∑n=0k−1yn.Step 8.
Define the recurrence relation from the systems of equation (26) as follows:
(27)y0t=S−1ukC+unSft−unSpy,y1t=−S−1unSNy0,...yn+1t=−S−1unS∑n=1∞N∑n=0kyn−N∑n=0k−1yn,n≥1.
Therefore, in truncated series form, the approximate analytical solution of the DDE (1) is given by
(28)yt=limN⟶∞∑m=0Nymt=y0+y1+y2+y3+.⋯


## 5. Illustrative Examples

In this part, four nonlinear DDEs are used to demonstrate the effectiveness and validity of the SIM.Example 1 (see [44]).
Consider a first-order nonlinear DDE:(29)ddtyt=1−2y2t2,subject to the initial condition
(30)y0=0.
The analytical solution is given byyt=sint..Solution: taking the Sumudu transform on both sides of equation (29), we get
(31)Guu−y0u=S1−S2y2t2.Taking the place of equation (30) into equation (29), we achieve
(32)Gu=u−uS2y2t2.Subsequently, taking the inverse Sumudu transform of equation (32) implies that
(33)S−1Gu=S−1u−S−1uS2y2t2.By using the properties of Sumudu transforms listed in Table2, equation (33) becomes
(34)yt=t−S−1uS2y2t2.Table 2
Standard Sumudu transform for some special functions [52].
ftGu=Sft11tnn!untneatn!un/1−aun+1sinatau/1+a2u2cosat1/1+a2u2sinhatau/1−a2u2coshat1/1−a2u2ectfat1/1−cuGau/1−cuHt−ae−a/uHt−aft−ae−a/uGuNow, applying the new iterative method to equation (34) in a vision of equations (27)–(31), we attain the components of the solution as follows:
(35)y0t=t,y0t2=t2,y1t=−S−1uS2y02t2=−2S−1uSt24=−S−1uu2=−S−1u3=−t36=−t33!.Hence,y1t=−t3/3! and y1t/2=−t3/48.(36)y2t=Ny0t2+y1t2−Ny0t2=−2S−1uSt2−t3482−t22=−2S−1uSt24−t448+t62,304−t24=−2S−1uS−t448+t62,304=−S−1u−u4+6!u61152.Therefore,(37)y2t=−S−1−u5+6!u71152=t55!−t78064&y2t2=t53840−t71032192,y3t=Ny0t2+y1t2+y2t2−Ny0t2+y1t2=−2S−1uSt2−t348+t53840−t710321922−t2−t3482=−2S−1uSt63840−12.2t81032192+2.68t1024772608−t121981808640+t141065420324864=−t71920+6.1t9258048−0.64t113096576+t13990904320−t15532710162432.Likewise, we can obtain the leftover values by means of the recurrence relationyn+1t=−2S−1uS∑n=1∞N∑n=0kyn2t/2−N∑n=0k−1yn2t/2,n≥1..Now, in vision of (28), the solution of Example 1 is
(38)yt=y0t+y1t+y2t+⋯=t−t36+t5120−1.6t74032+6.1t9258048−0.64t113096576+t13990904320−t15532710162432+.⋯Example 2.
Consider the following nonlinear second-order DDE [23]:
(39)d2ytdt2=−yt+5y2t2,t≥0,with initial condition
(40)y0=1,dy0dt=−2.The analytical solution is given byyt=e−2t..Solution: taking the Sumudu transform on both sides of equation (39), we get
(41)Gu−y0u2−y′0u=S−yt+5y2t2.Replacing equation (40) into equation (39), we get
(42)Gu=1−2u+u2S−yt+5y2t2.Subsequently, taking the inverse Sumudu transform of equation (42) suggests that
(43)S−1Gu=S−11−2u+u2S−yt+5y2t2.By using the properties of Sumudu transforms listed in Table2, equation (43) becomes
(44)yt=1−2t+S−1u2S−yt+5y2t2.Now, applying the new iterative method to equation (44) in the opinion of equations (27)–(31), we achieve the components of the answer as follows:
(45)y0t=1−2t,y0t2=1−2t2=1−t,y1t=S−1u2S−y0t+5y02t2=S−1u2S−1−2t+51−t2=S−1u2−1+2u+51−2u+2u2=S−1−u2+2u3+5S−1u2−2u3+2u4.As a result,(46)y1t=−t22+t33+5t22−t33+t412,y1t2=t22−t33+5t4192.y2t=−y1t+Ny0t2+y1t2−Ny0t2,y2t=S−1u2S−y1t+5S−1u2S1−t+t22−t33+5t41922−1−t2=S−1u2S−2t2−4t33+5t412+5S−1u2St2−2t33+29t496−t53+79t6576−10t7576+25t836864⇒y2t=−t46+t515−t672+5t412−t512+29t62880−t7126+79t832256−25t910368+10t101327104,y2t2=−t496+t5480−t64608+5t4192−t5384+29t6184320−t716128+79t88257536−25t95308416+10t101358954496.y3t=−y2t+Ny0t2+y1t2+y2t2−Ny0t2+y1t2=S−1u2S−−t46+t515−t672+5t412−t512+29t62880−t7126+79t832256−25t910368+10t101327104+5S−1u2S1−t+t22−t33+5t4192+−t496+t5480−t64608+5t4192−t5384+29t6184320−t716128+79t88257536−25t95308416+10t1013589544962−1−t+t22−t33+5t41922.Similarly, we can obtain the continuing values by using the recurrence relation.(47)yn+1t=S−1u2S−ynt+5S−1u2S∑n=1∞N∑n=0kyn2t2−N∑n=0k−1yn2t2,n≥1.Now, in sight of (28), the solution of Example 2 is
(48)yt=y0t+y1t+y2t+y3t+⋯=1−2t+2t2−4t33+2t43−7t520+21t6576−5t7126+395t832256−125t910368+50t101327104+.⋯Example 3.
Consider the following nonlinear second-order DDE [24]:
(49)d2ytdt2=y2t2,t≥0,with initial condition
(50)y0=1,dy0dt=1.The analytical solution is given byyt=et.Solution: taking the Sumudu transform on both sides of equation (49), we acquire
(51)Gu−y0u2−y′0u=Sy2t2.Replacing equation (50) into equation (49), we get
(52)Gu=1+u+u2Sy2t2.Consequently, taking the inverse Sumudu transform of equation (52) implies that
(53)S−1Gu=S−11+u+u2Sy2t2.By using the properties of Sumudu transforms listed in Table2, equation (53) becomes
(54)yt=1+t+S−1u2Sy2t2.Now, applying the new iterative method to equation (54) in the understanding of equations (27)–(31), we attain the components of the answer as follows:
(55)y0t=1+t,y0t2=1+t2,y1t=S−1u2Sy02t2,y1t=S−1u2S1+t22=S−1u2S1+t+t24=S−1u21+u+u22=S−1u2+u3+u42=t22+t36+t448andy1t2=t28+t348+t4768,y2t=Ny0t2+y1t2−Ny0t2=S−1u2S1+t2+t28+t348+t47682−1+t22=S−1u2St24+t36+5t4128+5t5768+7t69216+t718432+t8589824=S−1u2u22+u3+15u416+25u532+35u664+35u7128+35u8512=S−1u42+u5+15u616+25u732+35u864+35u9128+35u10512=t448+t5120+t6768+10t764512+t873728+t91327104+t1053084160,y2t2=t4768+t53840+t649152+10t78257536+t818874368+t9679477248+t1054358180000=S−1u2S1+t2+t28+t348+t4768+t4768+t53840+t649152+10t78257536+t818874368+t9679477248+t10543581800002−1+t2+t28+t348+t47682.Similarly, we can get the continuing values by consuming the recurrence relation(56)yn+1t=S−1u2S∑n=1∞N∑n=0kyn2t2−N∑n=0k−1yn2t2,n≥1.Now, in vision of (28), the solution of Example 3 is
(57)yt=y0t+y1t+y2t+y3t+⋯=1+t+t22+t36+t424+t5120+t6768+10t764512+t873728+t91327104+t1053084160+.⋯Example 4.
Consider the following nonlinear first-order DDE [24]:
(58)ddtyt−2ty4t2=0,t≥0,with initial condition
(59)y0=1.The analytical solution is given byyt=et2.Solution: taking the Sumudu transform on both sides of equation (58), we get
(60)Gu−y0u=S2ty4t2.Substituting equation (59) into equation (58), we get
(61)Gu=1+uS2ty4t2.Subsequently, taking the inverse Sumudu transform of equation (61) implies that
(62)S−1Gu=S−11+uS2ty4t2.By using the properties of Sumudu transforms listed in Table2, equation (62) becomes
(63)yt=1+S−1uS2ty4t2.Now, applying the new iterative method to equation (63) in the opinion of equations (27)–(31), we acquire the components of the solution as follows:
(64)y0t=1,y0t2=1,y1t=S−1uS2ty04t2=S−1uS2t14=S−1uS2t=S−1u2u=S−12u2=t2.Hence,y1t=t2 and y1t/2=t2/4.
(65)y2t=Ny0t2+y1t2−Ny0t2,y2t=S−1uS2t1+t244−14=S−1uS2t1+t2+3t48+t616+t8256−1=S−1uS2tt2+3t48+t616+t8256=S−1uS2t3+3t54+t78+t9128=S−1u12u3+90u5+630u7+2835u9=S−112u4+90u6+630u8+2835u10=t42+t68+t864+t101280.Therefore,(66)y2t2=t432+t6512+t816384+t101310720,y3t=Ny0t2+y1t2+y2t2−Ny0t2+y1t2,y3t=S−1uS2t1+t24+t432+t6512+t816384+t1013107204−1+t244.Similarly, we can gain the remaining values by using the recurrence relation(67)yn+1t=S−1uS∑n=1∞N∑n=0kyn2t2−N∑n=0k−1yn2t2,n≥2.Now, in the understanding of (28), the solution of Example 4 is
(68)yt=y0t+y1t+y2t+y3t+⋯=1+t2+t42+t68+t864+t101280+.⋯Example 5.
Consider the nonlinear proportional delay differential equation [(39)]:
(69)d2ytdt2=1−2y2t2,0<t<1,with initial condition
(70)y0=1,dy0dt=0.The exact solution is given by(71)yt=cost.Solution: taking the Sumudu transform on both sides of equation (69), we get
(72)Gu−y0u2−y′0u=S1−S2y2t2.Replacing equation (70) into equation (72), we get
(73)Gu=1+u2−u2S2y2t2.Consequently, taking the inverse Sumudu transform of equation (73) implies that
(74)S−1Gu=S−11+u2−u2S2y2t2.By using the properties of Sumudu transforms listed in Table2, equation (74) becomes
(75)yt=1+t22−S−1u2S2y2t2.Now, applying the new iterative method to equation (75) in the understanding of equations (27)–(31), we attain the components of the answer as follows:
(76)y0t=1+t22,y0t2=1+t28,y1t=−S−1u2S2y02t2,y1t=−S−12u2S1+t282=−S−12u2+u4+3u64=−t2+t424+t6960=−t2−t424−t6960,y1t2=−t24−t4384−t623040,y2t=Ny0t2+y1t2−Ny0t2=−S−12u2S1−t28−t4384−t6230402−1+t282=t412+t62880−6.5t8645120−1.3t106635520+t12583925760−t1496613171200.Similarly, we can obtain the continuing values by consuming the recurrence relation(77)yn+1t=S−1u2S∑n=1∞N∑n=0kyn2t2−N∑n=0k−1yn2t2,n≥1.Now, in view of (28), the solution of Example 5 is
(78)yt=y0t+y1t+y2t+y3t+⋯=1−t22+t424−t61440+6.5t8645120−1.3t106635520+t12583925760−t1496613171200+.⋯


## 6. Discussion

A graph is an essential tool for illustrating the phenomenon physical structures in the context of practical applications. This section has covered the acquired solution that has been shown with figures and tables. The comparison of the eight-term approximate solution using the current technique with the precise answers for illustrative instances1−5 at various values of the time variable t is shown in Figures 1(a), 2(a), 3(a), 4(a), and 5(a). These figures demonstrate that the present approach SIM is an effective mathematical instrument. The solution of plots using the present method and the precise solution virtually fit one over the other. Figures 1(b), 2(b), 3(b), 4(b), and 5(b) present the 2D graphs of absolute errors in the interval t∈0,1and over the eight-term approximate and accurate solutions of instances 1, 2, 3, 4, and 5, respectively. There are error functions accessible to separate the scheme’s competency and exactness. We provided the absolute, relative, and recurrence error functions to describe the precision and competence of SIM.Figure 1
(a) 2D solution plots of Example1 obtained by the present method in comparison with the exact solutions. (b) The absolute errors of Example 1.
(a)(b)Figure 2
(a) 2D solution plots of Example2 obtained by the present method in comparison with the exact solutions. (b) The absolute errors of Example 2.
(a)(b)Figure 3
(a) 2D solution plots of Example3 obtained by the present method in comparison with the exact solutions. (b) The absolute errors of Example 3.
(a)(b)Figure 4
(a) 2D solution plots of Example4 obtained by the present method in comparison with the exact solutions. (b) The absolute errors of Example 4.
(a)(b)Figure 5
(a) 2D solution plots of Example5 obtained by the present method in comparison with the exact solutions. (b) The absolute errors of Example 4.
(a)(b)The comparisons of eight-term approximation solutions and the exact solutions for instances1−5 are shown in Tables 3–7 together with their corresponding absolute errors for various values of the time variable t. The tables show that the current method’s answer provides a very excellent estimate with very little error in comparison to the precise solution. Moreover, the proposed approach gives a small error neighboring t=0, but the error increases as t grows. This is to means that a greater approximation can be achieved for small values of time t. Additionally, the recurrence and relative errors of the SIM approximation solution for instances 1−5 are generated to verify the correctness of our technique, as shown in Tables 8–12. It is clear from the findings that the current approach is a useful and efficient solution for solving specific classes of nonlinear DDEs with a minimum of computations and iterations.Table 3
Eight-term approximate solution by SIM and comparison with the exact solution of Example1 for different values of time variablet and the absolute error E=y8−exact.
tExactSIM (y8)Error of SIMy8−exact0.010.00999983333416666468254243826910.009999833334166670635084715268215.95254227699911294235387479603×10−180.020.019998666693333079366490294692970.019998666693333841257738137566057.6189124784287308037906972682347×10−160.030.029995500202495660768526341926260.029995500202508678106145541852681.3017337619199926418381976803817×10−140.040.039989334186634159452546811715910.039989334186731676342943830011849.7516890397018295927234489854206×10−140.050.049979169270678328794865000845490.049979169271143307005665277342854.649782108002764973569663272669×10−130.060.059964006479444599199091137856980.059964006481110618923569582480791.6660197244784446238102384892945×10−120.070.069942847337532763976547306807890.069942847342433740565874528446274.9009765893272216383775880181497×10−120.080.07991469396917268730687634731450.079914693981652192127219679558111.2479504820343332243614165116637×10−110.090.089878549198011049691253982607140.089878549226470878124907505214042.8459828433653522606907291960894×10−110.10.099833416646828152306814198410620.099833416706325569403007549568585.9497417096193351157956953086635×10−11Table 4
Eight-term approximate solution by SIM and comparison with the exact solution of Example2 for different values of time variablet and the absolute error E=y8−exact.
tExactSIM (y8)Error of SIMy8−exact0.010.980198673306755302220814104225310.980198673298369396053792263885447.6567061670218403398688662997124×10−120.020.960789439152323209439210691323250.960789438882282847002149470899472.7004036243706122042377588602797×10−100.030.941764533584248709537152783271150.941764531520718065013385445731032.0635306445237673375401197060947×10−90.040.923116346386635782910759849572390.923116337636242173234567901234578.7503936096761919483378188100436×10−90.050.904837418035959573164249059446440.904837391164114281298622252449162.6871845291865626806997276621195×10−80.060.886920436717157515527565228769840.886920369431849629875883341256066.7285307885651681887513777352279×10−80.070.869358235398805819663084416171180.869358089057390054619381751543211.4634141576504370266462797283252×10−70.080.852143788966211338456346981468560.852143501871200263449735449735452.8709501107500661153173311265977×10−70.090.835270211411272021312384974018780.835269690810494082654885428292415.2060077793865749954572636623644×10−70.100.818730753077981858669935508619040.818729865933817976156029541446218.8714416388251390596717282942436×10−7Table 5
Eight-term approximate solution by SIM and comparison with the exact solution of Example3 for different values of time variablet and the absolute error E=y8−exact.
tExactSIM (y8)Error of SIMy8−exact0.011.01005016708416805754216545690291.01005016708416797030014562968638.7240709160039260033807362201524×10−170.021.02020134002675581016014392048321.0202013400267501987603066302915.6113998372901921514353035089912×10−150.031.03045453395351685561243995383121.03045453395345261773073273359036.4237881707220240898132905025143×10−140.041.04081077419238822675704475791691.04081077419202548591201410934743.6274084503064856945474408297705×10−130.051.05127109637602403969751763633561.05127109637463335154311997549871.3906881543976608369452201748213×10−120.061.06183654654535962222468487716841.06183654654118621430157221126394.1734079231126659044723284282604×10−120.071.07250818125421647905310394988911.07250818124363989157295042438271.0576587480153525506414605574959×10−110.081.08328706767495855443598775867491.0832870676512457487587089947092.3712805677229049680188500198714×10−110.091.09417428370521035787289762354491.09417428365695322363904472787044.825713423385289567448601184652×10−110.101.10517091807564762481170782649021.1051709179843873811482962687399.1260243663411557751246668224547×10−11Table 6
Eight-term approximate solution by SIM and comparison with the exact solution of Example4 for different values of time variablet and the absolute error E=y8−exact.
tExactSIM (y8)Error of SIMy8−exact0.011.00010000500016667083341666805561.000100005000125001562500781252.6046270915886805575397073415454×10−140.021.00040008001066773341867235588071.0004000800080004000082.6673334106723558806511753256021×10−120.031.00090040512152734242148820741091.00090040509113525202382031253.039209039766789491085590924096×10−110.041.00160128068293982073797368272131.0016012805121024081921.7083741254597368272128248212481×10−100.051.00250312760579508497462200741081.00250312695373542785644531256.5205965711817569491078540400885×10−100.061.00360648778300344187286434448571.003606485834624872392031251.9483785694808330944857236586806×10−90.071.00491202463221022967489172184051.00491201971513470844.9170755212748917218404870487403×10−90.081.00642052376066130734971704309351.0064205127942227886081.0966438518741717043093549369087×10−80.091.00813289375315229558435971707731.00813287149741274206563281252.2255739553518726904577318679382×10−80.101.01005016708416805754216545690291.0100501251563281254.1927839932542165456902860033807×10−8Table 7
Eight-term approximate solution by SIM and comparison with the exact solution of Example5 for different values of time variablet and the absolute error E=y8−exact.
tExactSIM (y8)Error of SIMy8−exact0.010.999950000416665277780257933752210.999950000416665972223229784747196.9444297185099498765700898213503×10−160.020.999800006666577778412695590837480.999800006666622221964283708105864.4443551588117268384909109084136e×10−140.030.999550033748987516272158706466610.999550033749493743389253732697585.0622711709502623096470099213223×10−130.040.999200106660977940314570758129130.99920010666382215618842184075652.8442158738510826273615840389857×10−120.050.998750260394966246562870811156520.99875026040581557845101241379741.0849331888141602640876969231305×10−110.060.998200539935204165547661687182840.99820053996759830756010520072423.2394142012443513541362920715428×10−110.070.997551000253279574620908389939740.997551000334960163260040580238978.1680588639132190299235800066344×10−110.080.996801706302619384977706774633510.996801706484605315991495714030431.8198593101378893939691803779311×10−100.090.995952733011994253092839371825140.9959527333809003708211338894593643.6890611772829451763421912989156×10−100.100.995004165278025766095561987803870.995004165972121446180565238029846.9409568008500325022596734437406×10−10Table 8
Therelativeerror=y−y8/y and the recurrence errors y8−y7 of the eight-term approximate solution with different values of t for Example 1.
tRel.error=y−y8yThe recurrence errorsy8−y70.015.9526414871945109656612382108804×10−161.8771933980659682854623330813807×10−420.023.8097102148157878764411863518049×10−146.1511873267825648778029730410683×10−380.034.3397634749617773252154115623977×10−132.6935673489862558793048469387755×10−350.042.4385724939029334238556007347317×10−122.0156210632401108591584782060973×10−330.059.3034401648822304645892485008952×10−125.7287396181212411055369051555808×10−320.062.7783662605158795458009676311753×10−118.8262814891581632653061224489796×10−310.077.0071162039999724917837155730614×10−118.9120911233770994492519048996914×10−300.081.5616032797619591090961240307272×10−106.6047871000251952632905013857395×10−290.093.166476171188944712375521506634×10−103.8649747388840329890348473373724×10−280.15.9596695269552980446935638307384×10−101.8771933980659682854623330813807×10−27Table 9
Relativeerror=y−y8/y and the recurrence errors y8−y7 of the eight-term approximate solution with different values of t for Example 2.
tRel.error=y−y8/yThe recurrence errorsy8−y70.018.5553127089343170374270459421746×10−123.7676022376543209876543209876543×10−250.022.8106091869131080159675495546539×10−103.858024691358024691358024691358×10−220.032.1911322532716372173477594118403×10−92.2247314453125×10−200.049.4791882344278178169768399760563×10−93.9506172839506172839506172839506×10−190.052.9697981931597903981571901091965×10−83.6792990602092978395061728395062×10−180.068.5536390478748811426675600590532×10−82.2781251507040895061728395061728×10−170.071.6833269624220174754962744684297×10−71.0642541956018518518518518518519×10−160.083.3690911650403441436132921473112×10−74.0454320987654320987654320987654×10−160.096.2327229060288257396201891734213×10−71.313681671142578125×10−150.11.0835603286518002061147680805238×10−63.7676022376543209876543209876543×10−15Table 10
Relativeerror=y−y8/y and the recurrence errors y8−y7 of the eight-term approximate solution with different values of t for Example 3.
tRel.error=y−y8/yThe recurrence errorsy8−y70.018.6373947225877417868639773271375×10−171.8838011188271604938271604938272×10−280.025.5002866759055889633247305984701×10−151.929012345679012345679012345679×10−250.036.2339365387389300013823686028123×10−141.11236572265625×10−230.043.4851757305463662660581726127457×10−131.9753086419753086419753086419753×10−220.051.3228634927676470260161527926961×10−121.8396495301046489197530864197531×10−210.063.9303675661670079053871690963782×10−121.1390625753520447530864197530864×10−200.079.8615448021897730482326991451309×10−125.3212709780092592592592592592593×10−200.082.1889678539385847003643462470927×10−112.0227160493827160493827160493827×10−190.094.4103699888137939075348720380715×10−116.568408355712890625×10−190.18.2575683245733854395955338928169×10−111.8838011188271604938271604938272×10−18Table 11
Relativeerror=y−y8/y and the recurrence errors y8−y7 of the eight-term approximate solution with different values of t for Example 4.
tRel.error=y−y8/yThe recurrence errorsy8−y70.014.1665104197134626794006536633891×10−140.000000000000000000000000781250.022.666266690666311080683726099371×10−120.0000000000000000000080.033.036474982141479657190277700251×10−110.00000000000000000046132031250.041.7056429124120981178930665544512×10−100.0000000000000000081920.056.5043154396479848831880033593507×10−100.00000000000000007629394531250.061.9413770169868662957457642073733×10−90.000000000000000472392031250.074.8930407844154338466912464932543×10−90.00000000000000220683750.081.0896477426517253442706479538359×10−80.0000000000000083886080.092.2076196195387892241157337954729×10−80.00000000000002724050313281250.14.15106509546751004088859882255×10−80.000000000000078125Table 12
Relativeerror=y−y8/y and the recurrence errors y8−y7 of the eight-term approximate solution with different values of t for Example 5.
tRel.error=y−y8/yThe recurrence errorsy8−y70.016.94477695446402558242543434902116×10−141.0350555597951431284764618097951e×10−390.024.4452441780127633339084847822871×10−141.6958350291683625016958350291684×10−350.035.0645500475482233460651718232111×10−134.9506386557778159340659340659341×10−330.042.8464927644529430252097722509013×10−122.7784561117894451227784561117894×10−310.051.0862907694112761244414947862237×10−116.3174777819527778837674671008004×10−300.063.2452539060484081575312681432379×10−118.1111263736263736263736263736264×10−290.078.1881115470179846647898069536872×10−117.0199856233370383354107312440646×10−280.081.8256984299196189958689336418384×10−104.5522224935558268891602224935558×10−270.093.7040524665526650385618364415906×10−102.3678751220786964500343406593407×10−260.16.9758067785681866753931281825812×10−101.0350555597951431284764618097951×10−25


## 7. Conclusion

This study introduced SIM, a hybridization of the Sumudu transform method with the new iterative method. First, the linear component of DDEs is solved using the Sumudu transform method. To simplify the complexity of the novel term from the nonlinear term, a posttreatment new iterative method is employed as illustrated in Section3. We provide the fundamental definitions and terminology for the DDEs, the new iterative approach, and the Sumudu transform method. The validity and consistency of SIM have been verified with the help of five significant problems. The absolute, recurrence, and relative errors of all considered examples are interpreted graphically and numerically, for different values of the time variable t. From the demonstrative examples, the results reveal that the current technique SIM generates a decent approximation that is extremely close to the precise answers with a low amount of error. Therefore, SIM is quite valuable, as it allows us to improve accuracy and efficiency and provides a mathematical tool for nonlinear DDEs. Finally, we hope that this work is a step toward examining this approach to tackling some exciting problems in various areas of science and engineering, given the ongoing use of nonlinear DDEs as models in several different disciplines.



---

*Source: 2466367-2022-10-19.xml*