This paper proposes the Laplace Discrete Adomian Decomposition Method and its application for solving nonlinear integro-differential equations. This method is based upon the Laplace Adomian decomposition method coupled with some quadrature rules of numerical integration. Four numerical examples of integro-differential equations in both Volterra and Fredholm integrals are used to be solved by the proposed method. The performance of the proposed method is verified through absolute error measures between the approximated solutions and exact solutions. The series of experimental numerical results show that our proposed method performs in high accuracy and efficiency. The study clearly highlights that the proposed method could be used to overcome the analytical approaches in solving nonlinear integro-differential equations.

Integro-Differential Equation Volterra Integro-Differential Equation Fredholm Integro-Differential Equation Laplace Adomian Decomposition Method Quadrature Rules
1. Introduction

One of the issues in finding the solutions of integro-differential equations is the choices of approaches used that are either analytical or numerical. Previous literature suggested that analytical solutions of integro-differential equations are not usually obtainable especially when the equations are entangled with nonlinear terms. Therefore, it is required to find an efficient approximate solution numerically. Much attention has been devoted for the search of better and more efficient methods in recent years with the introduction of several numerical methods such as the Galerkin methods  , Runge-Kutta methods  , Chebyshev collocation method  , Taylor collection method  , rationalized Haar functions method  , Galerkin methods with hybrid functions  , and Adomian Decomposition Method (ADM)  -  . In addition to these numerical methods, Khuri   used Laplace transform numerical scheme, based on the ADM to solve nonlinear differential equations and Bratu’s problem, respectively. This method is popularly known as Laplace Adomian Decomposition Method (LADM) where the ADM and Laplace transforms are combined.

2. Laplace Discrete Adomian Decomposition Method

In this section, we present the Laplace discrete Adomian decomposition method over the integro-differential equation of the form

u ″ ( x ) = f ( x ) + ∫ a b k ( x , t ) ⋅ ( R u ( t ) + N ( u ( t ) ) ) d t , (2.1)

Subject to the following initial conditions

u ( 0 ) = α ,     u ′ ( 0 ) = β .

To solve the nonlinear integro-differential Equation (2.1) using the Laplace transform method, we recall the Laplace transform of the second derivative of u ( x ) , that is L { u ″ ( x ) } = s 2 L { u ( x ) } − s u ( 0 ) − u ′ ( 0 ) . Thus on applying the Laplace transform to both sides of Equation (2.1) we obtain

s 2 L { u ( x ) } − s u ( 0 ) − u ′ ( 0 ) = L { f ( x ) } + L { ∫ a b k ( x , t ) ⋅ ( R u ( t ) + N ( u ( t ) ) ) d t } (2.2)

We thus obtain the following equation after using the above prescribed initial conditions

L { u ( x ) } = α s + β s 2 + 1 s 2 L { f ( x ) } + 1 s 2 L ∫ a b k ( x , t ) ( R u ( t ) + N ( u ( t ) ) ) d t . (2.3)

The decomposition method represents the solution u ( x ) as a series of the form:

u ( x ) = ∑ n = 0 ∞ u n ( x ) , (2.4)

and the nonlinear term N u ( t ) is decomposed into an infinite series of the form:

N ( u ( t ) ) = ∑ n = 0 ∞ A n , (2.5)

where A n ’s are the Adomian polynomials of u 0 , u 1 , ⋯ , u n given by the formula

A n = 1 n ! d n d λ n [ N ( ∑ i = 0 n λ i u i ) ] λ = 0 ,     i = 0 , 1 , 2 , ⋯ (2.6)

On substituting Equation’s (2.4) and (2.5) in Equation (2.3) and making comparison between the right and left hand sides, we thus obtain:

{ L { u 0 ( x ) } = α s + β s 2 + 1 s 2 L ( f ( x ) ) L { u k + 1 ( x ) } = 1 s 2 L ∫ a b k ( x , t ) ( R u k ( x ) + A k ( x ) ) ,     k ≥ 0. (2.7)

Furthermore, if the evaluation of the integrals in Equation (2.7) is analytically possible, the ADM can be applied directly. However, in the case where the evaluation of integrals is analytically impossible we consider the numerical integration scheme given by the following formula:

∫ a b f ( t ) d t ≈ ∑ j = 0 0 w n , i f ( t n , i ) , (2.8)

where f ( t ) is continuous function on [ a , b ] , t n , i = a + i h are the nodes of the numerical integration, h = b − a n is the fixed step length and w n , i , i = 0 , 1 , 2 , ⋯ , n are the weights functions. Now, applying the formula given in Equation (2.8) on Equation (2.7) to obtain

{ L { u 0 ( x ) } = α s + β s 2 + 1 s 2 L ( f ( x ) ) L { u k + 1 ( x ) } = 1 s 2 L ( ∑ i = 0 n w n , i k ( x , t n , i ) ⋅ ( R ( u k ( t n , i ) ) + A k ( t n , i ) ) ) ,   k ≥ 0. (2.9)

Finally, on applying the inverse Laplace transform to the first part of Equation (2.9) gives u 0 ( x ) , and, consequently will define A 0 . Also, using A 0 enables us to evaluate u 1 ( x ) . The determination of u 0 ( x ) and u 1 ( x ) leads to the determination of A 1 that will allow us to determine u 2 ( x ) , and so on. This in turn will lead to the complete determination of the components of u k , k ≥ 0 upon using the second part of Equation (2.9).

{ u 0 ( x ) = L − 1 { α s + β s 2 + 1 s 2 L ( f ( x ) ) } u k + 1 ( x ) = L − 1 { 1 s 2 L ( ∑ i = 0 n w n , i k ( x , t n , i ) ⋅ ( R ( u k ( t n , i ) ) + A k ( t n , i ) ) ) } ,   k ≥ 0 (2.10)

From this recursive relation in Equation (2.10), u 0 , u 1 , u 2 , ⋯ can be calculated. The solution of Equation (2.1) is now determined in Equation (2.10). However, in practice the series ∑ n = 0 ∞ u n must be truncated to the series:

φ n = ∑ i = 0 n u i with lim n → ∞ φ n = u (2.11)

2.1. Trapezoidal Method (TR)

We couple the trapezoidal method (TR) to Equation (2.10) to obtain:

{ u 0 ( x ) = α + β x + L − 1 f ( x ) u k + 1 ( x ) = L − 1 ( h 2 ( k ( x , a ) ( R ( u k ( a ) ) + A k ( a ) )                           + 2 ∑ i = 1 n − 1 k ( x , x i ) ( R ( u k ( x i ) ) + A k ( x i ) )                           + k ( x , b ) ( R ( u k ( b ) ) + A k ( b ) ) ) ,     k ≥ 0. (2.12)

2.2. Simpson’s Method (SM)

Also, on coupling the Simpson’s method (SM) to Equation (2.10), we get:

{ u 0 ( x ) = α + β x + L − 1 f ( x ) u k + 1 ( x ) = L − 1 ( h 2 ( k ( x , a ) ( R ( u k ( a ) ) + A k ( a ) )                           + 4 ∑ i = 1 n 2 k ( x , x 2 i − 1 ) ( R ( u ( x 2 i − 1 ) ) + A k ( x 2 i − 1 ) )                           + 2 ∑ i = 1 n 2 − 1 k ( x , x 2 i ) ( R ( u ( x 2 i ) ) + A k ( x 2 i ) )                           + k ( x , b ) ( R ( u k ( b ) ) + A k ( b ) ) ) ,     k ≥ 0. (2.13)

3. Computational Results and Analysis

In this section, we consider several nonlinear integro-differential equations as examples in order to show the efficiency and the simplicity of the proposed method. We start with the nonlinear Volterra and Fredholm integro-differential equations down to their systems, respectively.

Example 3.1

Consider the nonlinear Volterra integro-differential equation

u ′ ( x ) = 1 5 x 5 − ∫ 0 x ( u 2 ( t ) − 2 ) d t ,     u ( 0 ) = 0 , (3.1)

with the exact solution given by u ( x ) = x 2 .

In order to use the quadrature rule for Equation (3.1), let t = x ⋅ v , we get

u ′ ( x ) = 1 5 x 5 − x ∫ 0 1 ( u 2 ( x ⋅ v ) − 2 ) d v ,     u ( 0 ) = 0.

Taking the Laplace transform of both sides of the above equation gives

L { u ′ ( x ) } = L ( 1 5 x 5 ) − L ( x ∫ 0 1 ( u 2 ( x ⋅ v ) − 2 ) d v ) .

So that,

s L { u ( x ) } − u ( 0 ) = 24 s 6 − L ( x ∫ 0 1 ( u 2 ( x ⋅ v ) − 2 ) d v ) ,

or equivalently

L { u ( x ) } = 24 s 7 − 1 s L ( x ∫ 0 1 ( u 2 ( x ⋅ v ) − 2 ) d v ) .

1) Trapezoidal Method (TM)

We divide the interval (0, 1) into subinterval of equal lengths h = 0.2 , n = 5 and denote v i = a + i h , 0 ≤ i ≤ 5 .

The recursive relation is given by

{ L { u 0 ( x ) } = 24 s 7 , L { u k + 1 ( x ) } = − 0.1 s L ( x ⋅ ( x A k ( v 0 ) + 2 ∑ i = 1 4 x A k ( v i ) + x A k ( v 5 ) ) ) , k ≥ 0

or

{ L { u 1 ( x ) } = 2 s 3 − 7.900194170 s 15 , L { u 2 ( x ) } = − 3315.398639 s 11 − 3.15801038 s 23 ,                               ⋮

Taking the inverse Laplace transform of both sides of the first part of recursive relation, and using this recursive relation gives

{ u 0 ( x ) = 1 30 x 6 u 1 ( x ) = x 2 − 0.00000906 x 14                   ⋮

The series solution is obtained by summing the following iterates

u ( x ) = u 0 + u 1 + u 2 + ⋯ .

The results produced by the present method with only few components (m = 5) are in a very good agreement with the exact solution results as shown in Table 1 and illustrated graphically in Figure 1.

2) Simpson’s Method (SM)

We divide the interval (0, 1) into subinterval of equal lengths h = 0.1 , n = 10 and denote x i = a + i h , 0 ≤ i ≤ 10 . The recursive relation is given by

{ L { u 0 ( x ) } = 24 s 7 , L { u k + 1 ( x ) } = − 0.1 3 s L ( x A k ( v 0 ) + 4 ∑ i = 1 5 x A k ( v 2 i − 1 )                                       + 2 ∑ i = 1 4 x A k ( v 2 i ) + x A k ( v 10 ) ) ,   k ≥ 0 ,

Comparison between the exact solution u ( x ) and approximate solution using LDADM based on TM in EX. 3.1
0000
0.200.040000000.039999861.41640000e−07
0.400.160000000.159990949.05930000e−06
0.600.360000000.359897121.02878600e−04
0.800.640000000.639427425.72582800e−04
11.000000000.997872952.12705460e−03

Or

{ L { u 1 ( x ) } = 2 s 3 − 5.36881755 s 15 , L { u 2 ( x ) } = − 2692.40899737 s 11 + 1.05763414 s 23 ,                               ⋮

Taking the inverse Laplace transform of both sides of the first part of recursive relation, and using this recursive relation gives

{ u 0 ( x ) = 1 30 x 6 , u 1 ( x ) = x 2 − 0.00000616 x 14 ,                     ⋮

The series solution is obtained by summing the following iterates

u ( x ) = u 0 + u 1 + u 2 + ⋯ .

The results produced by the present method with only few components (m = 5) are in a very good agreement with the exact solution results as shown in Table 2 and illustrated graphically in Figure 2.

Example 3.2

Consider the nonlinear Fredholm integro-differential equation

Comparison between the exact solution u ( x ) and approximate solution using LDADM based on SM in EX. 3.1
0000
0.100.010000000.010000002.22221713e−12
0.200.040000000.040000001.42214800e−10
0.300.090000000.090000001.61901986e−09
0.400.160000000.159999999.05840967e−09
0.500.250000000.249999973.37952007e−08

u ″ ( x ) = 1 2 e x + 1 2 ∫ 0 1 e x − 2 t ⋅ u 2 ( t ) d t ,     u ′ ( 0 ) = u ( 0 ) = 1 ,

with the exact solution is u ( x ) = e x .

Taking the Laplace transform of both sides of the given equation gives

L { u ″ ( x ) } = L ( 1 2 e x ) + 1 2 L ( ∫ 0 1 e x − 2 t ⋅ u 2 ( t ) d t ) .

So that

s 2 L { u ( x ) } − s u ( 0 ) − u ′ ( 0 ) = 1 2 ( s − 1 ) + 1 2 L ( ∫ 0 1 e x − 2 t ⋅ u 2 ( t ) d t ) ,

or equivalently

L { u ( x ) } = 1 s + 1 s 2 + 1 2 s 2 ( s − 1 ) + 1 2 s 2 L ( ∫ 0 1 e x − 2 t ⋅ u 2 ( t ) d t ) .

1) Trapezoidal Method (TM)

Let h = 0.2 , n = 5 , the recursive relation is given by

{ L { u 0 ( x ) } = 1 s + 1 s 2 + 1 2 s 2 ( s − 1 ) , L { u k + 1 ( x ) } = 0.2 4 s 2 L ( e x − 2 t 0 ⋅ A k ( t 0 ) + 2 ∑ i = 1 4 e x − 2 t i ⋅ A k ( t i )                                         + e x − 2 t 5 ⋅ A k ( t 5 ) ) , k ≥ 0.

Taking the inverse Laplace transform of both sides of the first part of recursive relation, and using this recursive relation gives

{ u 0 ( x ) = 1 2 + 1 2 x + 1 2 e x , u 1 ( x ) = − 0.44983021 − 0.44983021 x + 0.44983021 e x ,                     ⋮

The series solution is obtained by summing the following iterates

u ( x ) = u 0 + u 1 + u 2 + ⋯ .

The results produced by the present method with only few components (m = 5) are in a very good agreement with the exact solution results as shown in Table 3 and illustrated graphically in Figure 3.

2) Simpson’s Method (SM)

Let h = 0.1 , n = 10 , the recursive relation is given by

{ L { u 0 ( x ) } = 1 s + 1 s 2 + 1 2 s 2 ( s − 1 ) , L { u k + 1 ( x ) } = 0.1 6 s 2 L ( e x − 2 t 0 ⋅ A k ( t 0 ) + 4 ∑ i = 1 5 e x − 2 t 2 i − 1 ⋅ A k ( t 2 i − 1 )                                     + 2 ∑ i = 1 2 e x − 2 t 2 i ⋅ A k ( t 2 i ) + e x − 2 t 5 ⋅ A k ( t 5 ) ) ,   k ≥ 0.

Comparison between the exact solution u ( x ) and Approximate solution using LDADM based on RM in EX. 3.2
01.000000001.000000000
0.201.221402761.221402067.03000000e−07
0.401.491824701.491821683.01500000e−06
0.601.822118801.822111507.29500000e−06
0.802.225540932.225526951.39750000e−05
12.718281832.718258242.35900000e−05

Taking the inverse Laplace transform of both sides of the first part of recursive relation, and using this recursive relation gives

{ u 0 ( x ) = 1 2 + 1 2 x + 1 2 e x , u 1 ( x ) = − 0.45035999 − 0.45035999 x + 0.450359991 e x ,                     ⋮

The series solution is obtained by summing the following iterates

u ( x ) = u 0 + u 1 + u 2 + ⋯ .

The results produced by the present method with only few components (m = 5) are in a very good agreement with the exact solution results as shown in Table 4 and illustrated graphically in Figure 4.

Example 3.3

Consider the system of nonlinear Volterra integro differential equation

{ u ′ ( x ) = 3 x 2 − 2 3 x 3 − 1 126 x 9 + ∫ 0 x ( x − t ) 2 ( u 2 ( t ) + v 2 ( t ) ) d t ,   u ( 0 ) = 1 , v ′ ( x ) = − 3 x 2 − 1 35 x 7 + ∫ 0 x ( x − t ) 2 ( u 2 ( t ) − v 2 ( t ) ) d t ,   v ( 0 ) = 1 , (3.2)

with the exact solution ( u ( x ) , v ( x ) ) = ( 1 + x 3 , 1 − x 3 ) .

In order to use the quadrature rule for Equation (3.2), let t = x ⋅ v , we get

Comparison between the exact solution u ( x ) and approximate solution using LDADM based on SM in EX. 3.2
01.000000001.000000000
0.101.105170921.105170761.58713332e−07
0.201.221402761.221402106.56924555e−07
0.301.349858811.349857281.53033898e−06
0.401.491824701.491821882.81841706e−06
0.501.648721271.648716714.56476936e−06

{ u ′ ( x ) = 3 x 2 − 2 3 x 3 − 1 126 x 9 + x ∫ 0 1 ( x − x ⋅ v ) 2 ( u 2 ( x ⋅ v ) + v 2 ( x ⋅ v ) ) d v ,   u ( 0 ) = 1 , v ′ ( x ) = − 3 x 2 − 1 35 x 7 + x ∫ 0 1 ( x − x ⋅ v ) 2 ( u 2 ( x ⋅ v ) − v 2 ( x ⋅ v ) ) d v ,   v ( 0 ) = 1.

Taking the Laplace transform of both sides of the above equation gives

{ s L { u ( x ) } − 1 = L ( 3 x 2 − 2 3 x 3 − 1 126 x 9 ) + L ( x ∫ 0 1 ( x − x ⋅ v ) 2 ( u 2 ( x ⋅ v ) + v 2 ( x ⋅ v ) ) d v ) , s L { v ( x ) } − 1 = L ( − 3 x 2 − 1 35 x 7 ) + L ( x ∫ 0 1 ( x − x ⋅ v ) 2 ( u 2 ( x ⋅ v ) − v 2 ( x ⋅ v ) ) d v ) .

So that

{ L { u ( x ) } = 1 s + 6 s 4 − 4 s 5 − 2880 s 11 + 1 s L ( x ∫ 0 1 ( x − x ⋅ v ) 2 ( u 2 ( x ⋅ v ) + v 2 ( x ⋅ v ) ) d v ) , L { v ( x ) } = 1 s − 6 s 4 − 144 s 9 + 1 s L ( x ∫ 0 1 ( x − x ⋅ v ) 2 ( u 2 ( x ⋅ v ) − v 2 ( x ⋅ v ) ) d v ) .

1) Trapezoidal Method (TM)

We divide the interval (0, 1) into subinterval of equal lengths h = 0.2 , n = 5 and denote v i = a + i h , 0 ≤ i ≤ 5 . The recursive relations as

{ L { u 0 ( x ) } = 1 s + 6 s 4 − 4 s 5 − 2880 s 11 , L { v 0 ( x ) } = 1 s − 6 s 4 − 144 s 9 ,

{ L ( u k + 1 ( x ) ) = 1 s L ( x ( ( x − x ⋅ v 0 ) 2 ( A k ( v 0 ) + B k ( v 0 ) ) )                                     + 2 ∑ i = 1 4 ( x − x ⋅ v i ) 2 ( A k ( v i ) + B k ( v i ) )                                     + ( x − x ⋅ v 5 ) 2 ( A k ( v 5 ) + B k ( v 5 ) ) ) ,   k ≥ 0 L ( v k + 1 ( x ) ) = 1 s L ( x ( ( x − x ⋅ v 0 ) 2 ( A k ( v 0 ) − B k ( v 0 ) ) )                                     + 2 ∑ i = 1 4 ( x − x ⋅ v i ) 2 ( A k ( v i ) − B k ( v i ) )                                     + ( x − x ⋅ v 5 ) 2 ( A k ( v 5 ) − B k ( v 5 ) ) ) ,   k ≥ 0

Taking the inverse Laplace transform of both sides of the first part of recursive relation, and using this recursive relation gives

{ u 0 = 1 + x 3 − 1 6 x 4 − 1 1260 x 10 v 0 = 1 − x 3 − 1 280 x 8 u 1 = 0.17 x 4 − 0.00039467 x 8 v 1 = 0.00950857 x 7 − 0.00039467 x 8           ⋮

The series solutions are

{ u ( x ) = u 0 + u 1 + u 2 + ⋯ v ( x ) = v 0 + v 1 + v 2 + ⋯

The results produced by the method with only few components (m = 5) are in a very good agreement with the exact solution results as shown in Table 5 and Table 6 and illustrated graphically given in Figure 5 and Figure 6.

2) Simpson’s Method (SM)

We divide the interval (0, 1) into subinterval with equal length h = 0.1 , n = 10 and denote x i = a + i h , 0 ≤ i ≤ 10 . The recursive relation is given by

{ L { u 0 ( x ) } = 1 s + 6 s 4 − 4 s 5 − 2880 s 11 , L { v 0 ( x ) } = 1 s − 6 s 4 − 144 s 9 ,

{ L ( u k + 1 ( x ) ) = 0.1 3 s L ( x ( ( x − x ⋅ v 0 ) 2 ( A k ( v 0 ) + B k ( v 0 ) ) )                                     + 4 ∑ i = 1 4 ( x − x ⋅ v 2 i − 1 ) 2 ( A k ( v 2 i − 1 ) + B k ( v 2 i − 1 ) )                                     + 2 ∑ i = 1 4 ( x − x ⋅ v 2 i ) 2 ( A k ( v 2 i ) + B k ( v 2 i ) )                                     + ( x − x ⋅ v 10 ) 2 ( A k ( v 10 ) + B k ( v 10 ) ) ) ,   k ≥ 0 L ( v k + 1 ( x ) ) = 0.1 3 s L ( x ( ( x − x ⋅ v 0 ) 2 ( A k ( v 0 ) − B k ( v 0 ) ) )                                     + 4 ∑ i = 1 4 ( x − x ⋅ v 2 i − 1 ) 2 ( A k ( v 2 i − 1 ) − B k ( v 2 i − 1 ) )                                     + 2 ∑ i = 1 4 ( x − x ⋅ v 2 i ) 2 ( A k ( v 2 i ) − B k ( v 2 i ) )                                     + ( x − x ⋅ v 10 ) 2 ( A k ( v 10 ) − B k ( v 10 ) ) ) ,   k ≥ 0

Taking the inverse Laplace transform of both sides of the first part of recursive relation, and using this recursive relation gives

{ u 0 = 1 + x 3 − 1 6 x 4 − 1 1260 x 10 , v 0 = 1 − x 3 − 1 280 x 8 , u 1 = 0.16666667 x 4 − 0.00039736 x 8 , v 1 = 0.00952761 x 7 − 0.00039736 x 8 ,           ⋮

Comparison between the exact solution u ( x ) and approximate solution using LDADM based on TM in EX. 3.3
01.000000001.000000000
0.201.008000001.008005335.33335213e−06
0.401.064000001.064085348.53371745e−05
0.601.216000001.216432064.32061253e−04
0.801.512000001.513365461.36545876e−03
12.000000002.003330323.33031586e−03
Comparison between the exact solution v ( x ) and approximate solution using LDADM based on TM
01.000000001.000000000
0.200.992000000.992000111.12587007e−07
0.400.936000000.936013241.32433409e−05
0.600.784000000.784206322.06317915e−04
0.800.488000000.489396101.39609894e−03
10.000000000.005944225.94421577e−03

The series solutions are

{ u ( x ) = u 0 + u 1 + u 2 + ⋯ v ( x ) = v 0 + v 1 + v 2 + ⋯

The results produced by the method with only few components (m = 5) are in a very good agreement with the exact solution results as shown in Table 7 and Table 8 and illustrated graphically given in Figure 7 and Figure 8.

Comparison between the exact solution u ( x ) and approximate solution using LDADM based on SM in EX. 3.3
01.000000001.000000000
0.101.001000001.001000004.16058963e−16
0.201.008000001.008000004.71714828e−13
0.301.027000001.027000002.96484081e−11
0.401.064000001.064000005.65791067e−10
0.501.125000001.125000015.58673293e−09
Comparison between the exact solution v ( x ) and approximate solution using LDADM based on SM in EX. 3.3
01.000000001.000000000
0.100.999000000.999000009.17047572e−10
0.200.992000000.992000111.12810573e−07
0.300.973000000.973001851.84936099e−06
0.400.936000000.936013271.32693006e−05
0.500.875000000.875060486.04816460e−05

Example 3.4

Consider the system of nonlinear Fredholm integro differential equation

{ u ″ ( x ) = 2 + 12 5 x − ∫ 0 1 x ( u 2 + v 2 ) d t ,     u ( 0 ) = 1 , u ′ ( 0 ) = 0 , v ″ ( x ) = − 2 + 4 3 x − ∫ 0 1 x ( u 2 − v 2 ) d t ,     v ( 0 ) = 1 , v ′ ( 0 ) = 0 ,

with the exact solution ( u ( x ) , v ( x ) ) = ( 1 + x 2 , 1 − x 2 ) .

As usual, on taking the Laplace transform of both sides of the above equation gives

{ s 2 L { u ( x ) } − s = L ( 2 + 12 5 x ) − L ( ∫ 0 1 x ( u 2 + v 2 ) d t ) , s 2 L { v ( x ) } − s = L ( − 2 + 4 3 x ) − L ( ∫ 0 1 x ( u 2 − v 2 ) d t ) .

So that

{ L { u ( x ) } = 1 s + 2 s 3 + 12 5 s 4 − 1 s 2 L ( ∫ 0 1 x ( u 2 + v 2 ) d t ) , L { u ( x ) } = 1 s − 2 s 3 + 4 3 s 4 − 1 s 2 L ( ∫ 0 1 x ( u 2 − v 2 ) d t ) .

1) Trapezoidal Method (TM)

We divide the interval (0, 1) into subinterval of equal lengths h = 0.2 , n = 5 and denote v i = a + i h , 0 ≤ i ≤ 5 . The recursive relations are

{ L { u 0 ( x ) } = 1 s + 2 s 3 + 12 5 s 4 , L { v 0 ( x ) } = 1 s − 2 s 3 + 4 3 s 4 .

{ L ( u k + 1 ( x ) ) = 0.2 2 s 2 L ( x ( A k ( t 0 ) + B k ( t 0 ) ) + 2 ∑ i = 1 4 ( A k ( v i ) + B k ( v i ) )                                     + ( A k ( v 5 ) + B k ( v 5 ) ) ) ,   k ≥ 0 L ( v k + 1 ( x ) ) = 0.2 2 s 2 L ( x ( A k ( t 0 ) − B k ( t 0 ) ) + 2 ∑ i = 1 4 ( A k ( v i ) − B k ( v i ) )                                     + ( A k ( v 5 ) − B k ( v 5 ) ) ) ,   k ≥ 0

Taking the inverse Laplace transform of both sides of the first part of recursive relation, and using this recursive relation gives

{ u 0 ( x ) = 1 + x 2 + 2 5 x 3 , v 0 ( x ) = 1 − x 2 + 2 9 x 3 , u 1 ( x ) = − 0.47488288 x 3 , v 1 ( x ) = − 0.28306869 x 3 ,                   ⋮

The series solutions are

{ u ( x ) = u 0 + u 1 + u 2 + ⋯ v ( x ) = v 0 + v 1 + v 2 + ⋯

The results produced by the method with only few components (m = 5) are in a very good agreement with the exact solution results as shown in Table 9 and Table 10 and illustrated graphically given in Figure 9 and Figure 10.

2) Simpson’s Method (SM)

We divide the interval (0, 1) into subinterval of equal lengths h = 0.1 , n = 10 and denote x i = a + i h , 0 ≤ i ≤ 10 . The recursive relation is given by

{ L { u 0 ( x ) } = 1 s + 2 s 3 + 12 5 s 4 , L { v 0 ( x ) } = 1 s − 2 s 3 + 4 3 s 4 ,

{ L ( u k + 1 ( x ) ) = 0.1 3 s 2 L ( x ( A k ( t 0 ) + B k ( t 0 ) ) + 4 ∑ i = 1 5 x ⋅ ( A k ( t 2 i − 1 ) + B k ( t 2 i − 1 ) )                                     + 2 ∑ i = 1 4 x ⋅ ( A k ( t 2 i ) + B k ( t 2 i ) ) + x ( A k ( t 10 ) + B k ( t 10 ) ) ) ,   k ≥ 0 L ( v k + 1 ( x ) ) = 0.1 3 s 2 L ( x ( A k ( t 0 ) − B k ( t 0 ) ) + 4 ∑ i = 1 5 x ⋅ ( A k ( t 2 i − 1 ) − B k ( t 2 i − 1 ) )                                     + 2 ∑ i = 1 4 x ⋅ ( A k ( t 2 i ) − B k ( t 2 i ) ) + x ( A k ( t 10 ) − B k ( t 10 ) ) ) ,   k ≥ 0

Taking the inverse Laplace transform of both sides of the first part of recursive relation, and using this recursive relation gives

Comparison between the exact solution u ( x ) and approximate solution using LDADM based on TM in EX. 3.4
01.000000001.000000000
0.201.040000001.039963703.62969667e−05
0.401.160000001.159709622.90375734e−04
0.601.360000001.359019989.80018101e−04
0.801.640000001.637676992.32300587e−03
12.000000001.995462884.53712084e−03
Comparison between the exact solution v ( x ) and approximate solution using LDADM based on TM in EX. 3.4
01.000000001.000000000
0.200.960000000.959964363.56392238e−05
0.400.840000000.839714892.85113790e−04
0.600.640000000.639037749.62259042e−04
0.800.360000000.357719092.28091032e−03
10−0.004454904.45490297e−03

{ u 0 ( x ) = 1 + x 2 + 2 5 x 3 , v 0 ( x ) = 1 − x 2 + 2 9 x 3 , u 1 ( x ) = − 0.46672242 x 3 , v 1 ( x ) = − 0.27424681 x 3 ,                   ⋮

The series solutions are

{ u ( x ) = u 0 + u 1 + u 2 + ⋯ v ( x ) = v 0 + v 1 + v 2 + ⋯

The results produced by the method with only few components (m = 5) are in a very good agreement with the exact solution results as shown in Table 11 and Table 12 and illustrated graphically given in Figure 11 and Figure 12.

Comparison between the exact solution u ( x ) and approximate solution using LDADM based on SM in EX. 3.4
01.000000001.000000000
0.101.010000001.009999455.51111213e−07
0.201.040000001.039995594.40888971e−06
0.301.090000001.089985121.48800028e−05
0.401.160000001.159964733.52711177e−05
0.501.250000001.249931116.88889017e−05
Comparison between the exact solution v ( x ) and approximate solution using LDADM based on SM in EX. 3.4
01.000000001.000000000
0.100.990000000.989999673.28616130e−07
0.200.960000000.959997372.62892904e−06
0.300.910000000.909991138.87263551e−06
0.400.840000000.839978972.10314323e−05
0.500.750000000.749958924.10770163e−05
4. Conclusion

In this paper, a modification of the Laplace Adomian decomposition method inspired by property of discretization is proposed. We developed a new Laplace Discrete Adomian decomposition method (LDADM) in which has been successfully applied to finding efficient numerical solutions of integro-differential equations featuring both nonlinear Volterra and Fredholm integrals. The method was based on the well-known Adomian decomposition method coupled with some numerical integration schemes (quadrature rules) alongside utilizing the famous and most used Laplace transform. The method gives approximate solutions iteratively with less number of computational steps. The results reveal that the proposed method is simple to execute and effective. Thus, many highly nonlinear integro-differential equations can be solved using the proposed method.

Conflicts of Interest

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

Cite this paper

Bakodah, H.O., Al-Mazmumy, M., Almuhalbedi, S.O. and Abdullah, L. (2019) Laplace Discrete Adomian Decomposition Method for Solving Nonlinear Integro Differential Equations. Journal of Applied Mathematics and Physics, 7, 1388-1407. https://doi.org/10.4236/jamp.2019.76093