Solution of Laguerre’s Differential Equations via Modified Adomian Decomposition Method

This paper presents a technique for obtaining an exact solution for the well-known Laguerre’s differential equations that arise in the modeling of several phenomena in quantum mechanics and engineering. We utilize an efficient procedure based on the modified Adomian decomposition method to obtain closed-form solutions of the Laguerre’s and the associated Laguerre’s differential equations. The proposed technique makes sense as the attitudes of the acquired solutions towards the neighboring singular points are correctly taken care of.

• Modification Method
• Singular Ordinary Differential Equations
• Laguerre’s Equation
• Associated Laguerre’s Equation

1. Introduction

Mathematical models featuring both the ordinary and partial differential equations are realized in modeling different scenarios arising from physical and social sciences among others. Various efforts have been undertaken in recent decades to come up with dissimilar computational procedures for solving such models in numerous sectors of research, including modern technological situations. In particular, Laguerre’s differential equation is a type of differential equation that is found in a variety of engineering problems [1], and in quantum mechanics, because it is one of several equations that appear in the quantum mechanical description of the hydrogen atom [2].

More explicitly, let us consider the equation,

x v ″ ( x ) + ( 1 − x ) v ′ ( x ) + n v ( x ) = 0. (1)

This equation is called Laguerre’s differential equation of order n, where n is a real-valued constant. One crucial attribute of the present model is having a solution in form of a polynomial, which is usually referred to as Laguerre’s polynomial. The Laguerre’s polynomial being the solution of the Laguerre’s differential equation is denoted by L n ( x ) , and further expressed as

L n ( x ) = e x n ! d n d x n ( e − x x n ) . (2)

Moreover, the generalized version of Equation (1) is the so-called associated Laguerre’s differential equation, that is expressed as

x v ″ ( x ) + ( k + 1 − x ) v ′ ( x ) + n v ( x ) = 0, (3)

where k and n are real numbers [1] [3]; clearly, Equation (3) reduces to (1) when k = 0 .

Further, Laguerre’s differential equation was solved in [1] by using the Haar wavelet method; while [4] solved the same model by using G-transform, a generalized Laplace-typed transform method. Also, the differential transformation method [5] was applied to solve Laguerre’s differential equation. Furthermore, in recent times, research activities regarding second-order differential equations with initial data have drawn the inquisitiveness of different researchers. Various methods have been proposed in the past and present literature towards devising promising unified techniques to tackle a variety of differential equations; one could easily find the Adomian decomposition method [6] [7], and its related modifications and extensions to attract so many minds in this regard, see the following references [8] - [14] and the cited references therein to explore numerous scientific models in the presence of the method. Moreover, certain Adomian-based approaches have equally been utilized in the literature while treating various classes of linear and nonlinear integer and non-integer order differential equations, read [15] - [20] as an instance.

However, the current research focuses on the relevance of the modification of Adomian’s approach in tackling Laguerre’s and the associated Laguerre’s equations, respectively. These equations are well-known models that arise in the modeling of several phenomena in engineering and quantum mechanics to state a few. Our main goal here is to demonstrate the advantages and the efficiency of using this modified version of the Adomian’s method to obtain an optimal approximate solution of the mentioned Laguerre’s equations. Additionally, we organize the paper in the following manner: Section 2 gives the classical Adomian’s method; while its modification to be utilized in this study is presented in Section 3. Section 4 makes consideration to certain numerical applications as illustrative examples, and lastly, we give certain concluding remarks in Section 5.

2. Adomian Decomposition Method

Let us begin by giving a general survey of the Adomian’s method by considering the following generalized second-order differential equation

L v + R v + N v = g , (4)

with L denoting the second-order linear differential operator, R is also a linear operator, but less than L, and N is the nonlinear differential operator, while g is a source term. Thus, we rewrite the above equation as follows

L v = g − R v − N v . (5)

Next, premultiplying each term of Equation (5) with the inverse operator L − 1 , we obtain

L − 1 L v = L − 1 g − L − 1 R v − L − 1 N v . (6)

Therefore, making use of an infinite series via the Adomian’s method to represent the solution v ( x ) as

v ( x ) = ∑ m = 0 ∞     v m ( x ) , (7)

and the nonlinear term N ( v ) through

N v = ∑ m = 0 ∞     A m , (8)

with A m ’s representing the polynomials by Adomian. Therefore, we substitute Equations (7) and (8) into Equation (6) to obtain

∑ m = 0 ∞     v m = φ 0 + L − 1 g − L − 1 R ∑ m = 0 ∞     v m − L − 1 ∑ m = 0 ∞     A m , (9)

where

φ 0 = { v 0 ( 0 ) , if   L = d d x , v 0 ( 0 ) + x v ′ 0 ( 0 ) , if   L = d 2 d x 2 , v 0 ( 0 ) + x v ′ 0 ( 0 ) + x 2 2 ! v ″ 0 ( 0 ) , if   L = d 3 d x 3 ,                           ⋮ v 0 ( 0 ) + x v ′ 0 ( 0 ) + x 2 2 ! v ″ 0 ( 0 ) + ⋯ + x m m ! v 0 ( m ) ( 0 ) , if   L = d m + 1 d x m + 1 . (10)

Therefore,

{ v 0 ( x ) = φ 0 + L − 1 g , v 1 ( x ) = − L − 1 R v 0 − L − 1 A 0 , v 2 ( x ) = − L − 1 R v 1 − L − 1 A 1 , v 3 ( x ) = − L − 1 R v 2 − L − 1 A 2 ,                   ⋮ v m + 1 ( x ) = − L − 1 R v m − L − 1 A m ,   m ≥ 0 , (11)

where A m ’s are the polynomials by Adomian, which are to be computed using the following formula

A m = 1 m ! d m d λ m [ N ( ∑ i = 0     λ i v i ( x ) ) ] λ = 0 ,   m = 0 , 1 , 2 , ⋯ (12)

Now, from Equation (12), the polynomials by Adomian are recurrently determined as

{ A 0 = N ( v 0 ) , A 1 = N ′ ( v 0 ) v 1 , A 2 = N ′ ( v 0 ) v 2 + 1 2 N ″ ( v 0 ) v 1 2 , A 3 = N ′ ( v 0 ) v 3 + N ″ ( v 0 ) v 1 v 2 + 1 3 ! N ‴ ( v 0 ) v 1 3 ,             ⋮ (13)

Hence, the recurrent solution for the n-term scheme is, therefore, obtained as follows

ϕ m = ∑ i = 0 m − 1     v i ( x ) , (14)

where

v ( x ) = lim m → ∞ ϕ m ( x ) = ∑ i = 0 ∞     v i ( x ) .

Note also that, the convergence analysis of the classical Adomian’s method was discussed by many researchers, including the famous research by Cherruault et al. [21] [22] [23] [24] and other notable works like Gabet [25] and Babolian and Biazar [26], to state a few.

3. Modified Adomian Decomposition Method

Here, we give two important algorithms based on certain modifications of Adomian’s method to solve the governing equations under consideration.

3.1. Algorithm 1

The Adomian decomposition method has been slightly modified in the following way as suggested by Dita and Grama [27]. First, we make consideration to the following generalized second-order linear equation

L ( x , Δ ) v ( x ) − R ( x , v , Δ v , Δ 2 v ) = 0, (15)

where L ( x , Δ ) is the principal linear operator given by

L ( x , Δ ) = h ( x ) Δ p ( x ) Δ , (16)

and R is the outstanding linear operator tackling all the other operators less than L. More so, the functions h ( x ) together with p ( x ) are all continuously differentiable functions. The minus sign in Equation (15) is taken for convenience. At this point, for brevity, proper choices of the operator L and R should be made in such a way that the resultant pseudo-Volterra integral equation can be solved easily.

However, sometimes writing Equation (15) in its standard form complicates the matter. Recall that we are aiming at obtaining an inverse for the general form in Equation (16) and make use of it to look for different known formulae for the solutions of certain special ordinary differential equations. The second proposal entails writing Equation (15) in a form of an inhomogeneous equation by utilizing a modified version of the variation of parameters method to obtain a transformed equation as a pseudo-Volterra integral equation. This will then be considered to be the generalized version of Adomian’s approach for tackling ordinary differential equations of the second-order. Most of the equations of the form given in Equation (15) are called the classical special functions, together with their principal linear part given in Equation (16) with a lot of these equations having h ( x ) = 1 . What is more, the functions h ( x ) together with p ( x ) are both assumed continuously differentiable, and further 1 p ( x ) is locally integrable near a certain point; such that without loss of generality, it can be chosen to be near x = 0 . The decomposition approach involves determining the inverse operator L − 1 such that through it many cases of the exact solution of the governing model are constructed. Again, an inverse corresponding to the principal linear operator given in Equation (15) is thus readily suggested as follows

L − 1 ( x , Δ ) v ( x ) = ∫ 0 x d t p ( t ) ∫ 0 t d y h ( y ) v ( y ) . (17)

Additionally, one sees that

( L L − 1 ) v ( x ) = I ⋅ v ( x ) . (18)

However,

( L − 1 L ) v ( x ) ≠ I ⋅ v ( x ) , (19)

with I denoting the identity operator. Equation (19) also shows the inverse operator L − 1 , indicating that it is not a true inversion of the principal operator; rather, it is only so when the prescribed initial data are taken into account, and that is similar to providing the respective values of v ( 0 ) and v ′ ( 0 ) . Hence,

( L − 1 L ) v ( x ) = ∫ 0 x d t p ( t ) ∫ 0 t d y h ( y ) h ( y ) d d y p ( y ) d v ( y ) d y , = ∫ 0 x d t p ( t ) [ p ( y ) d v d y ] 0 t = ∫ 0 x d v ( t ) d t − p ( 0 ) v ′ ( 0 ) ∫ 0 x d t p ( t ) , = v ( x ) − v ( 0 ) − p ( 0 ) v ′ ( 0 ) ∫ 0 x d t p ( t ) . (20)

Therefore, the following result is obtained from Equation (17),

v ( x ) = v ( 0 ) + p ( 0 ) v ′ ( 0 ) ∫ 0 x d t p ( t ) + ∫ 0 x d y p ( t ) ∫ 0 t d t h ( y ) R ( y , Δ v ) . (21)

Further, Equation (21) is a Volterra integral equation, which assumes the following series solution

v ( x ) = ∑ k = 0 ∞     v k ( x ) , (22)

where

v 0 = v ( 0 ) + p ( 0 ) v ′ ( 0 ) ∫ 0 x d t p ( t ) , (23)

and v k ( x ) is thus determined via the Picard approach of successive approximation as follows

v k = L − 1 ( x , Δ ) v k − 1 . (24)

3.2. Algorithm 2

Consider the generalized second-order linear differential equation [27]

v ″ + a ( x ) v ′ + b ( x ) v = h ( x ) , (25)

with φ ( x ) ≠ 0 presumed to be a regular solution (of Equation (25)) admitted by the homogeneous part of the equation, which would be obtained by using a modified version of the variation of parameters method. Thus, the following solution is obtained via a more general integral representation as follows

v ( x ) = s 1 φ ( x ) + s 2 φ ( x ) ∫ d x I ( x ) φ 2 ( x ) + φ ( x ) ∫ d x I ( x ) φ 2 ( x ) ∫     I ( x ) φ ( x ) h ( x ) d x , (26)

with s 1 and s 2 denoting the real constants; while I ( x ) is the integrating factor given by

I ( x ) = e ∫ a ( x ) d x .

Moreover, the inverse differential operator L − 1 becomes an indefinite integral in the above; that is, for each problem it has to be transformed into a definite integral according to the required solution. Additionally, Equation (26) can be considered as the beginning step with regard to the implementation of the decomposition approach in most general cases. More so, a linear homogeneous differential equation is transformed to a pseudo-Volterra integral equation via Equation (25). An important issue here is the separation of the convenient component on the left-hand side of Equation (25) such that the solution of this component can easily be found. The behavior of the solution around the point where the solution is expected to have to be taken into account, in order to maximize the chances of obtaining the complete explicit infinite series form. This easy separation procedure is carried out through shifting the b ( x ) v term to the right-hand side of the equation, such that the solution corresponding to the left-hand side only is v ( x ) = 1 .

4. Illustrative Examples

Here, the applicability of the devised schemes is exhibited in the current section on Laguerre’s and the associated Laguerre’s differential equations. Besides, it is an attempt to deploy the proposed algorithms in acquiring the known solutions of the governing models.

4.1. Laguerre’s Differential Equation

Let us make a reconsideration of Laguerre’s differential equation expressed as

x v ″ ( x ) + ( 1 − x ) v ′ ( x ) + n v ( x ) = 0. (27)

Algorithm 1: Rewrite Equation (27) as

L v ( x ) = x v ″ ( x ) + v ′ ( x ) = d d x [ x v ′ ( x ) ] = x v ′ ( x ) − n v ( x ) . (28)

Here, we consider h ( x ) = 1 and p ( x ) = x ; and also decompose the solution function v ( x ) via the stated infinite series of the form

v ( x ) = ∑ m = 0 ∞     v m ( x ) , (29)

together with the following initial data

v 0 = 1 , v ′ ( 0 ) = 0. (30)

Then, upon applying the form of Equation (21), a recurrence scheme is obtained of the following form

v 0 = 1 v r + 1 = L − 1 [ x v ′ r − n v r ( x ) ] = ∫ 0 x     x − 1 ∫ 0 x [ x v ′ r − n v r ( x ) ] d x d x , (31)

such that

v 1 = L − 1 [ x v ′ 0 − n v 0 ( x ) ] = ∫ 0 x     x − 1 ∫ 0 x [ − n ] d x d x = − n x = − n ! ( n − 1 ) ! x , v 2 = L − 1 [ x v ′ 1 − n v 1 ( x ) ] = ∫ 0 x     x − 1 ∫ 0 x [ n 2 − n ] x d x d x           = n ( n − 1 ) 4 x 2 = n ! ( n − 2 ) ! ( 2 ! ) 2 x 2 , v 3 = L − 1 [ x v ′ 2 − n v 2 ( x ) ] = ∫ 0 x     x − 1 ∫ 0 x [ n ( n − 1 ) 2 − n 2 ( n − 1 ) 4 ] x 2 d x d x           = − n ( n − 1 ) ( n − 2 ) 36 x 3 = − n ! ( n − 3 ) ! ( 3 ! ) 2 x 3 ,         ⋮ (32)

Hence, upon taking the net sum of the above components, we obtain following known series solution

v ( x ) = L n ( x ) = ∑ r = 0 ∞ ( − 1 ) r n ! ( n − r ) ! ( r ! ) 2 x r . (33)

Algorithm 2: Rewrite the Laguerre’s equation as follows

v ″ ( x ) + 1 x v ′ ( x ) = v ′ ( x ) − n x v ( x ) . (34)

Now, considering the right-hand side entirely as a normal inhomogeneous term, we then solve for the other side of the equation as a normal homogeneous component.

Next, if the solutions are φ + = 1 and φ − = ln x , we start off by considering φ + and fix the constants s 1 = 1 and s 2 = 0 . Then, since an exact solution is searched at x = 0 , a two-fold integral operator is adopted as the inverse operator L − 1 , occupying the area from 0 to x, and thus determine from Equation (25) the following Volterra integral equation

v ( x ) = 1 + ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ ( x ) − n x v ( x ) ] d x d x . (35)

We, therefore, solve Equation (35) iteratively by considering the zeroth-order approximating the inhomogeneous term v ( 0 ) = 1 = v 0 and thus get

v 0 ( x ) = 1 , (36)

and

v r + 1 ( x ) = ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ r ( x ) − n x v r ( x ) ] d x d x . (37)

More iteratively, we find that

v 1 = ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ 0 ( x ) − n x v 0 ( x ) ] d x d x = ∫ 0 x     x − 1 ∫ 0 x     x [ − n x ] d x d x       = − n x = − n ! ( n − 1 ) ! x , v 2 = ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ 1 ( x ) − n x v 1 ( x ) ] d x d x = ∫ 0 x     x − 1 ∫ 0 x     x [ n 2 − n ] d x d x           = n ( n − 1 ) 4 x 2 = n ! ( n − 2 ) ! ( 2 ! ) 2 x 2 ,

v 3 = ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ 2 ( x ) − n x v 2 ( x ) ] d x d x           = ∫ 0 x     x − 1 ∫ 0 x     x [ n ( n − 1 ) 2 x − n ( n − 1 ) 4 x ] d x d x           = − n ( n − 1 ) ( n − 2 ) 36 x 3 = n ! ( n − 3 ) ! ( 3 ! ) 2 x 3 ,         ⋮ (38)

Hence, upon taking the sum of the above components, we get the following well-known series solution

v ( x ) = L n ( x ) = ∑ r = 0 ∞ ( − 1 ) r n ! ( n − r ) ! ( r ! ) 2 x r . (39)

Example 4.1

Let us consider Laguerre’s differential equation of n = 2

x v ″ ( x ) + ( 1 − x ) v ′ ( x ) + 2 v ( x ) = 0 , (40)

v ( 0 ) = 1 , v ′ ( 0 ) = 0.

Algorithm 1: Rewrite Equation (40) as

L v ( x ) = x v ″ ( x ) + v ′ ( x ) = d d x [ x v ′ ( x ) ] = x v ′ ( x ) − 2 v ( x ) . (41)

Here, we consider h ( x ) = 1 and p ( x ) = x ; and also decompose the solution function v ( x ) via the stated infinite series of the form

v ( x ) = ∑ m = 0 ∞     v m ( x ) , (42)

Then, upon applying the form of Equation (21), a recurrence scheme is obtained of the following form

v 0 = 1 v r + 1 = L − 1 [ x v ′ r − 2 v r ( x ) ] = ∫ 0 x     x − 1 ∫ 0 x [ x v ′ r − 2 v r ( x ) ] d x d x , (43)

such that

v 1 = L − 1 [ x v ′ 0 − 2 v 0 ( x ) ] = ∫ 0 x     x − 1 ∫ 0 x [ − 2 ] d x d x = − 2 x , v 2 = L − 1 [ x v ′ 1 − 2 v 1 ( x ) ] = ∫ 0 x     x − 1 ∫ 0 x [ − 2 x + 4 x ] d x d x = ∫ 0 x     x − 1 ∫ 0 x [ 2 x ] d x d x = 1 2 x 2 , v 3 = L − 1 [ x v ′ 2 − 2 v 2 ( x ) ] = ∫ 0 x     x − 1 ∫ 0 x [ x − x ] d x d x = 0 , v r + 1 = 0 , r ≥ 2. (44)

Hence, upon taking the net sum of the above components, we obtain following known series solution

v ( x ) = L 2 ( x ) = 1 − 2 x + 1 2 x 2 = 1 2 ! ( x 2 − 4 x + 2 ) . (45)

Algorithm 2: Rewrite the Laguerre’s equation for n = 2 as follows

v ″ ( x ) + 1 x v ′ ( x ) = v ′ ( x ) − 2 x v ( x ) . (46)

Now, considering the right-hand side entirely as a normal inhomogeneous term, we then solve for the other side of the equation as a normal homogeneous component.

Next, if the solutions are φ + = 1 and φ − = ln x , we start off by considering φ + and fix the constants s 1 = 1 and s 2 = 0 . Then, since an exact solution is searched at x = 0 , a two-fold integral operator is adopted as the inverse operator L − 1 , occupying the area from 0 to x, and thus determine from Equation (25) the following Volterra integral equation

v ( x ) = 1 + ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ ( x ) − 2 x v ( x ) ] d x d x . (47)

We, therefore, solve Equation (47) iteratively by considering the zeroth-order approximating the inhomogeneous term v ( 0 ) = 1 = v 0 and thus get

v 0 ( x ) = 1 , (48)

and

v r + 1 ( x ) = ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ r ( x ) − 2 x v r ( x ) ] d x d x . (49)

More iteratively, we find that

v 1 = ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ 0 ( x ) − 2 x v 0 ( x ) ] d x d x = ∫ 0 x     x − 1 ∫ 0 x     x [ − 2 x ] d x d x = − 2 x , v 2 = ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ 1 ( x ) − 2 x v 1 ( x ) ] d x d x = ∫ 0 x     x − 1 ∫ 0 x     x [ − 2 + 4 ] d x d x         = ∫ 0 x     x − 1 ∫ 0 x     2 x d x d x = 1 2 x 2 , v 3 = ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ 2 ( x ) − 2 x v 2 ( x ) ] d x d x = ∫ 0 x     x − 1 ∫ 0 x     x [ x − x ] d x d x = 0 , v r + 1 = 0 , r ≥ 2 (50)

Hence, upon taking the sum of the above components, we get the following well-known series solution

v ( x ) = L 2 ( x ) = 1 − 2 x + 1 2 x 2 = 1 2 ! ( x 2 − 4 x + 2 ) . (51)

4.2. Associated Laguerre’s Differential Equation

Let us make a reconsideration of the associated Laguerre’s differential equation expressed as

x v ″ ( x ) + ( k + 1 − x ) v ′ ( x ) + n v ( x ) = 0. (52)

Algorithm 1: Rewrite Equation (52) as follows

L v ( x ) = x v ″ ( x ) + ( k + 1 ) v ′ ( x ) = x − k d d x [ x k + 1 v ′ ( x ) ] = x v ′ ( x ) − n v ( x ) . (53)

Here, we consider the following functions h ( x ) = x − k , and p ( x ) = x k + 1 . Next, we decompose the solution function v ( x ) via infinite series expansion follows

v ( x ) = ∑ m = 0 ∞     v m ( x ) , (54)

and further choose the following initial data

v ( 0 ) = ( n + k ) ! n ! k ! , v ′ ( 0 ) = 0. (55)

Then, on employing the form of Equation (21), we get the recurrence relation below

v 0 = ( n + k ) ! n ! k ! v r + 1 = L − 1 [ x v ′ r − n v r ( x ) ] = ∫ 0 x     x − k − 1 ∫ 0 x     x k [ x v ′ r − n v r ( x ) ] d x d x , (56)

such that

v 1 = L − 1 [ x v ′ 0 − n v 0 ( x ) ] = ∫ 0 x     x − k − 1 ∫ 0 x     x k [ − n ( n + k ) ! n ! k ! ] d x d x       = − n ( n + k ) ! n ! ( k + 1 ) ! x = − ( n + k ) ! ( n − 1 ) ! ( k + 1 ) ! x ,

v 2 = L − 1 [ x v ′ 1 − n v 1 ( x ) ]         = ∫ 0 x     x − k − 1 ∫ 0 x     x k [ − ( n + k ) ! ( n − 1 ) ! ( k + 1 ) ! + n ( n + k ) ! ( n − 1 ) ! ( k + 1 ) ! ] x d x d x         = ( n − 1 ) ( n + k ) ! ( n − 1 ) ! ( k + 2 ) ! x 2 2 = ( n + k ) ! ( n − 2 ) ! ( k + 2 ) ! x 2 2 ,

v 3 = L − 1 [ x v ′ 2 − n v 2 ( x ) ]         = ∫ 0 x     x − k − 1 ∫ 0 x     x k [ ( n + k ) ! ( n − 2 ) ! ( k + 2 ) ! − n ( n + k ) ! 2 ( n − 2 ) ! ( k + 2 ) ! ] x 2 d x d x         = − ( n − 2 ) ( n + k ) ! ( n − 2 ) ! ( k + 3 ) ! x 3 6 = − ( n + k ) ! ( n − 3 ) ! ( k + 3 ) ! x 3 3 ! ,         ⋮ (57)

Finally, on summing the above components, the following documented series solution is yielded

v ( x ) = L n k ( x ) = ∑ r = 0 n ( − 1 ) r ( n + k ) ! ( n − r ) ! ( k + r ) ! r ! x r . (58)

Algorithm 2: We firstly rewrite Equation (68) as

v ″ ( x ) + k + 1 x v ′ ( x ) = v ′ ( x ) − n x v ( x ) . (59)

Therefore, considering the right-hand side of the above equation as a normal inhomogeneous component, we then solve for the other side of the equation as a normal homogeneous component.

Additionally, with admitting the solutions φ + = 1 and φ − = x − k , we start off by considering φ + and fix the constants s 1 = ( n + k ) ! n ! k ! and s 2 = 0 . Then, since

we are looking for the exact solution at x = 0 , a two-fold integral operator is adopted as an inverse differential operator L − 1 from 0 to x and thus determine from Equation (25) the following Volterra integral equation

v ( x ) = ( n + k ) ! n ! k ! + ∫ 0 x     x − 1 ∫ 0 x     x [ v ′ ( x ) − n x v ( x ) ] d x d x . (60)

We then solve Equation (60) iteratively by considering the zeroth-order approximation as the inhomogeneous term v ( 0 ) = ( n + k ) ! n ! k ! = v 0 and thus obtain the remaining recurrent components from

v 0 = ( n + k ) ! n ! k ! , v r + 1 = L − 1 [ v ′ r ( x ) − n x v r ( x ) ]             = ∫ 0 x     x − k − 1 ∫ 0 x     x k + 1 [ v ′ r ( x ) − n x v r ( x ) ] d x d x , (61)

such that

v 1 = L − 1 [ v ′ 0 − n x v 0 ( x ) ] = ∫ 0 x     x − k − 1 ∫ 0 x     x k + 1 [ − n x ( n + k ) ! n ! k ! ] d x d x       = − n ( n + k ) ! n ! ( k + 1 ) ! x = − ( n + k ) ! ( n − 1 ) ! ( k + 1 ) ! x , v 2 = L − 1 [ v ′ 1 − n x v 1 ( x ) ]         = ∫ 0 x     x − k − 1 ∫ 0 x     x k + 1 [ − ( n + k ) ! ( n − 1 ) ! ( k + 1 ) ! + n ( n + k ) ! ( n − 1 ) ! ( k + 1 ) ! ] d x d x         = ( n − 1 ) ( n + k ) ! ( n − 1 ) ! ( k + 2 ) ! x 2 2 = ( n + k ) ! ( n − 2 ) ! ( k + 2 ) ! x 2 2 ,

v 3 = L − 1 [ v ′ 2 − n x v 2 ( x ) ]         = ∫ 0 x     x − k − 1 ∫ 0 x     x k + 1 [ ( n + k ) ! ( n − 2 ) ! ( k + 2 ) ! − n ( n + k ) ! 2 ( n − 2 ) ! ( k + 2 ) ! ] x d x d x         = − ( n − 2 ) ( n + k ) ! ( n − 2 ) ! ( k + 3 ) ! x 3 6 = − ( n + k ) ! ( n − 3 ) ! ( k + 3 ) ! x 3 3 ! ,         ⋮ (62)

Thus, the overall series solution is obtained as follows

v ( x ) = L n k ( x ) = ∑ r = 0 n ( − 1 ) r ( n + k ) ! ( n − r ) ! ( k + r ) ! r ! x r . (63)

Alternatively, if we choose the initial data as s 1 = 0 and s 2 = k ( n + k ) ! n ! k ! , and further choose φ − = x − k ; we find from Equation (25) the following Volterra integral equation

v ( x ) = k ( n + k ) ! n ! k ! x − k ∫ 0 x     x k − 1 d x + x − k ∫ 0 x     x k − 1 ∫ 0 x [ v ′ ( x ) − n x v ( x ) ] x d x d x . (64)

We then solve Equation (64) iteratively by considering the zeroth-order approximation as the inhomogeneous term v 0 = k ( n + k ) ! n ! k ! x − k ∫ 0 x     x k − 1 d x = ( n + k ) ! n ! k ! = v ( 0 ) , and thus get

v r + 1 = L − 1 [ v ′ r ( x ) − n x v r ( x ) ]             = x − k ∫ 0 x     x k − 1 ∫ 0 x     x [ v ′ r ( x ) − n x v r ( x ) ] d x d x , (65)

where the individual components are explicitly expressed as

v 1 = L − 1 [ v ′ 0 − n x v 0 ( x ) ] = x − k ∫ 0 x     x k − 1 ∫ 0 x     x [ − n x ( n + k ) ! n ! k ! ] d x d x       = − x − k n ( n + k ) ! n ! ( k + 1 ) ! x k + 1 = − ( n + k ) ! ( n − 1 ) ! ( k + 1 ) ! x ,

v 2 = L − 1 [ v ′ 1 − n x v 1 ( x ) ]         = x − k ∫ 0 x     x k − 1 ∫ 0 x     x [ − ( n + k ) ! ( n − 1 ) ! ( k + 1 ) ! + n ( n + k ) ! ( n − 1 ) ! ( k + 1 ) ! ] d x d x         = x − k ( n − 1 ) ( n + k ) ! ( n − 1 ) ! ( k + 2 ) ! x 2 + k 2 = ( n + k ) ! ( n − 2 ) ! ( k + 2 ) ! x 2 2 ,

v 3 = L − 1 [ v ′ 2 − n x v 2 ( x ) ]         = x − k ∫ 0 x     x k − 1 ∫ 0 x     x [ ( n + k ) ! ( n − 2 ) ! ( k + 2 ) ! − n ( n + k ) ! 2 ( n − 2 ) ! ( k + 2 ) ! ] x d x d x         = − x − k ( n − 2 ) ( n + k ) ! ( n − 2 ) ! ( k + 3 ) ! x k + 3 6 = − ( n + k ) ! ( n − 3 ) ! ( k + 3 ) ! x 3 3 ! ,         ⋮ (66)

Finally, as expected, similar series solution is obtained upon taking the net sum of the above components as follows

v ( x ) = L n k ( x ) = ∑ r = 0 n ( − 1 ) r ( n + k ) ! ( n − r ) ! ( k + r ) ! r ! x r . (67)

Example 4.2

Let us consider the associated Laguerre’s differential for n = 2 , k = 1 equation expressed as

x v ″ ( x ) + ( 2 − x ) v ′ ( x ) + 2 v ( x ) = 0. (68)

Algorithm 1: Rewrite Equation (68) as follows

L v ( x ) = x v ″ ( x ) + 2 v ′ ( x ) = x − 1 d d x [ x 2 v ′ ( x ) ] = x v ′ ( x ) − 2 v ( x ) . (69)

Here, we consider the following functions h ( x ) = x − 1 , and p ( x ) = x 2 . Next, we decompose the solution function v ( x ) via infinite series expansion follows

v ( x ) = ∑ m = 0 ∞     v m ( x ) , (70)

and further choose the following initial data

v ( 0 ) = 3 ! 2 ! 1 ! = 3 , v ′ ( 0 ) = 0. (71)

Then, on employing the form of Equation (21), we get the recurrence relation below

v 0 = 3 v r + 1 = L − 1 [ x v ′ r − 2 v r ( x ) ] = ∫ 0 x     x − 2 ∫ 0 x     x [ x v ′ r − 2 v r ( x ) ] d x d x , (72)

such that

v 1 = L − 1 [ x v ′ 0 − 2 v 0 ( x ) ] = ∫ 0 x     x − 2 ∫ 0 x     x [ − 2 ( 3 ) ] d x d x = − 3 x , v 2 = L − 1 [ x v ′ 1 − 2 v 1 ( x ) ] = ∫ 0 x     x − 2 ∫ 0 x     x [ − 3 x + 6 x ] d x d x = x 2 2 ,

v 3 = L − 1 [ x v ′ 2 − 2 v 2 ( x ) ] = ∫ 0 x     x − 2 ∫ 0 x     x [ x 2 − x 2 ] d x d x = 0 , v r + 1 = 0 , r ≥ 2. (73)

Finally, on summing the above components, the following documented series solution is yielded

v ( x ) = L 2 1 ( x ) = 3 − 3 x + x 2 2 = ∑ r = 0 2 ( − 1 ) r 3 ! ( 2 − r ) ! ( 1 + r ) ! r ! x r . (74)

Algorithm 2: We firstly rewrite Equation (68) as

v ″ ( x ) + 2 x v ′ ( x ) = v ′ ( x ) − 2 x v ( x ) . (75)

Therefore, considering the right-hand side of the above equation as a normal inhomogeneous component, we then solve for the other side of the equation as a normal homogeneous component.

Additionally, with admitting the solutions φ + = 1 and φ − = x − 1 , we start off by considering φ + and fix the constants s 1 = 3 and s 2 = 0 . Then, since we are looking for the exact solution at x = 0 , a two-fold integral operator is adopted as an inverse differential operator L − 1 from 0 to x and thus determine from Equation (25) the following Volterra integral equation

v ( x ) = 3 + ∫ 0 x     x − 2 ∫ 0 x     x 2 [ v ′ ( x ) − 2 x v ( x ) ] d x d x . (76)

We then solve Equation (76) iteratively by considering the zeroth-order approximation as the inhomogeneous term v ( 0 ) = 3 = v 0 and thus obtain the remaining recurrent components from

v 0 = 3 v r + 1 = L − 1 [ v ′ r ( x ) − 2 x v r ( x ) ] = ∫ 0 x     x − 2 ∫ 0 x     x 2 [ v ′ r ( x ) − 2 x v r ( x ) ] d x d x , (77)

such that

v 1 = L − 1 [ v ′ 0 − 2 x v 0 ( x ) ] = ∫ 0 x     x − 2 ∫ 0 x     x 2 [ − 6 x ] d x d x = − 3 x , v 2 = L − 1 [ v ′ 1 − 2 x v 1 ( x ) ] = ∫ 0 x     x 2 ∫ 0 x     x 2 [ − 3 + 6 ] d x d x = x 2 2 , v 3 = L − 1 [ v ′ 2 − 2 x v 2 ( x ) ] = ∫ 0 x     x − 2 ∫ 0 x     x 2 [ x − x ] d x d x = 0 , v r + 1 = 0 , r ≥ 2. (78)

Thus, the overall series solution is obtained as follows

v ( x ) = L 2 1 ( x ) = 3 − 3 x + x 2 2 = ∑ r = 0 2 ( − 1 ) r ( 2 + 1 ) ! ( 2 − r ) ! ( 1 + r ) ! r ! x r . (79)

5. Conclusion

In conclusion, we have successfully determined the well-known closed-form series solutions of the Laguerre’s and the associated Laguerre’s equations, respectively, by devising modification methodologies that are based upon the application of the Adomian decomposition technique. These modifications are highly accurate, efficient, and further converge rapidly within a few numbers of steps. Additionally, the obtained series of solutions affirm the available results in the literature. Besides, the resulting integration procedures that arise from the proposed inverse operators L − 1 are calculated with the help of the Maple 18 package programmer. Therefore, the proposed schemes can be used to securitize different classes of both the ordinary and partial differential equations, which modeled diverse real-life circumstances.

Conflicts of Interest

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

References

1. Singh, I., Arora, S. and Kumar, S. (2015) Efficiency and Accuracy of Numerical Solution of Laguerre’s Differential Equation Using Haar Wavelet. International Journal of Pure and Applied Mathematics, 104, 495-508. https://doi.org/10.12732/ijpam.v104i4.1

2. Andrews, L.C. (1998) Special Functions of Mathematics for Engineers. 2nd Edition, Oxford University Press, Oxford.

3. Bell, W.W. (2004) Special Functions for Scientists and Engineers. Courier Corporation, Chelmsford.

4. Kim H. ,et al. (2017)The Solution of Laguerre’s Equation by Using G-Transform International Journal of Applied Engineering Research 12, 16083-16086.

5. Suresh, P., Krishna, G., Maheswari, K. and Ramanaiah, J. (2017) Solutions of Gausss Hypergeometric Equation, Leguerre’s Equation by Differential Transform Method. International Journal of Current Engineering and Scientific Research, 4, 32-38.

6. Adomian, G. (1990) A Review of the Decomposition Method and Some Recent Results for Nonlinear Equations. Mathematical and Computer Modelling, 13, 17-43. https://doi.org/10.1016/0895-7177(90)90125-7

7. Adomian, G. (1994) Solving Frontier Problems of Physics: The Decomposition Method. Fundamental Theories of Physics. Kluwer Academic Publishers Group, Dordrecht. https://doi.org/10.1007/978-94-015-8289-6

8. Wazwaz, A.M. (1999) A Reliable Modification of Adomian Decomposition Method. Applied Mathematics and Computation, 102, 77-86. https://doi.org/10.1016/S0096-3003(98)10024-3

9. Wazwaz, A.M. (2002) A New Method for Solving Singular Initial Value Problems in the Second-Order Ordinary Differential Equations. Applied Mathematics and Computation, 128, 45-57. https://doi.org/10.1016/S0096-3003(01)00021-2

10. Nuruddeen, R.I., Muhammad, L., Nass, A.M. and Sulaiman, T.A. (2018) A Review of the Integral Transforms-Based Decomposition Methods and Their Applications in Solving Nonlinear PDEs. Palestine Journal of Mathematics, 7, 262-280.

11. Bakodah, H., Banaja, M., Alrigi, B., et al. (2019) An Efficient Modification of the Decomposition Method with a Convergence Parameter for Solving Korteweg-de-Vries Equations. Journal of King Saud University—Science, 31, 1424-1430. https://doi.org/10.1016/j.jksus.2018.11.010

12. Alsulami, A.A., AL-Mazmumy, M., Bakodah, H.O. and Alzaid, N. (2022) A Method for the Solution of Coupled System of Emden-Fowler-Type Equations. Symmetry, 14, Article 843. https://doi.org/10.3390/sym14050843

13. Bakodah, H.O., Al-Mazmumy, M. and Almuhalbedi, S.O. (2019) Solving System of Integro-Differential Equations Using Discrete Adomian Decomposition Method. Journal of Taibah University for Science, 13, 805-812. https://doi.org/10.1080/16583655.2019.1625189

14. Al-Mazmumy, M. and Al-Malki, H. (2015) The Modified Adomian Decomposition method for Solving Nonlinear Coupled Burgers Equations. Nonlinear Analysis and Differential Equations, 3, 111-122. https://doi.org/10.12988/nade.2015.41226

15. Albalawi, W., Salas, A.H., El-Tantawy, S.A. and Youssef, A.A. (2021) Approximate Analytical and Numerical Solutions to the Damped Pendulum Oscillator: Newton-Raphson and Moving Boundary Methods. Journal of Taibah University for Science, 15, 479-485. https://doi.org/10.1080/16583655.2021.1989739

16. Talib, I., Raza, A., Atangana, A. and Riaz, M.B. (2022) Numerical Study of Multi-Order Fractional Differential Equations with Constant and Variable Coefficients. Journal of Taibah University for Science, 16, 608-620. https://doi.org/10.1080/16583655.2022.2089831

17. Mubaraki, A., Kim, H., Nuruddeen, R.I., Akram, U. and Akbar, Y. (2022) Wave Solutions and Numerical Validation for the Coupled Reaction-Advection-Diffusion Dynamical Model in a Porous Medium. Communications in Theoretical Physics, 74, Article ID: 125002. https://doi.org/10.1088/1572-9494/ac822a

18. Eltayeb H. ,et al. (2018)The Combined Laplace Transform and New Homotopy Perturbation Methods for Lane-Emden Type Differential Equations Journal of Nonlinear Analysis and Application 2, 95-105.

19. Biazar, J. and Hosseini, K. (2017) An Effective Modification of Adomian Decomposition Method for Solving Emden-Fowler Type Systems. National Academy Science Letters, 40, 285-290. https://doi.org/10.1007/s40009-017-0571-4

20. Al-Khaled, K. and Momani, S. (2005) An Approximate Solution for a Fractional Diffusion-Wave Equation Using the Decomposition Method. Applied Mathematics and Computation, 165, 473-483. https://doi.org/10.1016/j.amc.2004.06.026

21. Cherruault, Y. (1990) Convergence of Adomian’s Method. Mathematical and Computer Modelling, 14, 83-86. https://doi.org/10.1016/0895-7177(90)90152-D

22. Cherruault, Y. and Adomian, G. (1993) Decomposition Methods: A New Proof of Convergence. Mathematical and Computer Modelling, 18, 103-106. https://doi.org/10.1016/0895-7177(93)90233-O

23. Abbaoui, K. and Cherruault, Y. (1994) Convergence of Adomian’s Method Applied to Nonlinear Equations. Mathematical and Computer Modelling, 20, 69-73. https://doi.org/10.1016/0895-7177(94)00163-4

24. Cherruault, Y., Saccomandi, G. and Some, B. (1992) New Results for Convergence of Adomian’s Method Applied to Integral Equations. Mathematical and Computer Modelling, 16, 85-93. https://doi.org/10.1016/0895-7177(92)90009-A

25. Gabet, L. (1994) The Theoretical Foundation of the Adomian Method. Computers & Mathematics with Applications, 27, 41-52. https://doi.org/10.1016/0898-1221(94)90084-1

26. Babolian, E. and Biazar, J. (2002) On the Order of Convergence of Adomian Method. Applied Mathematics and Computation, 130, 383-387. https://doi.org/10.1016/S0096-3003(01)00103-5

27. Dita, P. and Grama, N. (1997) On Adomian’s Decomposition Method for Solving Differential Equations. ArXiv: Solv-int/9705008.