**ABSTRACT**

Telescoping Decomposition Method (TDM) as a new modification of the well-known Adomian Decomposition Method (ADM) for solving Delay Boundaries Integral Equations (DBIEs) is presented. The proposed method yields an iterative algorithm to obtain the numerical and analytical solutions of DBIEs including linear and nonlinear terms. The main characteristic of the proposed method is to avoid calculating the Adomian polynomials and yields a simple algorithm. In the obtained algorithm, some orthogonal polynomials are effectively implemented to achieve better approximation for the nonhomogeneous and nonlinear terms that leads to facilitate the computational work. Some illustrative linear and nonlinear experiments are given to show the capability and validity of the proposed algorithm.

PDF Abstract XML References Citation

**Received:**July 29, 2011;

**Accepted:**October 16, 2011;

**Published:**December 12, 2011

####
**How to cite this article**

*Journal of Applied Sciences, 11: 3504-3509.*

**DOI:**10.3923/jas.2011.3504.3509

**URL:**https://scialert.net/abstract/?doi=jas.2011.3504.3509

**INTRODUCTION**

A time delay phenomenon is encountered in a wide variety of scientific and engineering applications, such as physics and physical models (Brunner, 1994; Cahlon and Schimidt, 1997; Alnasr, 2004), biomathematics and biological models (Baker and Derakhshan, 1993; Hu, 1999; Precup, 1995), population growth, infectious diseases and epidemics (Canada and Zertiti, 1994) and the influence of noise (Ashwin *et al*., 2001; Brunner and Hu, 2005; Vanani *et al*., 2011a; Vanani and Aminataei, 2009) etc. In this study, we consider the following DBIE:

(1) |

where, f and g are given smooth functions, τ(x) and σ(x) represent the delay functions such that a≤x-σ(x), x-τ(x)≤b. Also λ is a constant.

We are interested in solving Eq. 1 using a new modification of ADM. The ADM was first introduced by Adomian (1986, 1988). In recent years a large amount of literatures developed concerning ADM (Adomian, 1994; Rach *et al*., 1992; Adomian *et al*., 1995; Wazwaz, 1997; Adomian and Rach, 1992) and the related modification to investigate various scientific models (Hosseini, 2006; Wazwaz, 1999a, b; Wazwaz, 2000; Wazwaz, 2002; Vanani *et al*., 2011b).

Calculating the Adomian polynomials is the main part of the ADM. Many researchers have discussed this issue and presented different approaches for calculating the Adomian polynomials (Wazwaz and El-Sayed, 2001).

The most popular one is the formula obtained by Adomian (1994) and Adomian (1988) as:

(2) |

where, A_{n} denotes the Adomian polynomial of degree n:

is the exact solution of the problem and f(u) is the nonlinear term in the equation. It is worth noting that calculating the Admian polynomials is difficult for large n and formula (2) can not be applied if f is a function of more than one variable, such as f = f(u, u'). Also, the ADM is shown to be divergent for certain problems (Hosseini and Nasabzadeh, 2006). Therefore, we desire to overcome these problem using TDM.

**APPLICATION OF TDM ON DBIES**

The structure of TDM is as follows:

Let, the problem (1) is given. Therefore, we consider its solution of the form:

where u_{n}(x) has to be determined sequentially upon the following algorithm:

Adding the above equations, we obtain:

This is the so-called Telescoping Decomposition Method which is applicable for finite, infinite, regular and irregular domains. It is noticeable that the convergency of this algorithm has been proven by Al-Refai *et al*. (2008).

Although, this algorithm provides an approximate solution for a wide class of nonlinear problems in terms of convergent series with easily computable components, some times it is difficult to calculate the complicated integrals in each iteration. To overcome this problem, we use orthogonal series such as Chebyshev and Legendre polynomials to obtain the operational and computational forms of each iteration u_{i}(x), i = 0, 1,..., n. This idea improves the method and decreases the volume of computations. We extend the aforementioned idea as follows:

Let us suppose that ψ(x) and φ(x) are integrable functions on [a, b], we define the inner product <,> by:

where, = <ψ)(x), ψ(x)>_{ω} and ω(x) is a weight function. Let L^{2}_{ω}[a, b] be the space of all functions f: [a, b], with

The main object is to seek an orthogonal series expansion of the exact solution of i-th step u_{i}(x)∈L^{2}_{ω}[a, b], i = 0, 1,...

Suppose that:

(3) |

or,

(4) |

to be an orthogonal series expansion of the exact solution of i-th step. Also {φ_{j}(x)}^{n}_{j = 0} = ΦX_{x} is a set of arbitrary orthogonal polynomial bases defined by a lower triangular matrix Φ, X_{x} = [1, x, x^{2},..., x^{n}]^{T}.

It is obvious that the functions x-σ(x), x-τ(x) and G(x, t, u(t)) can be written as:

(5) |

(6) |

and

(7) |

It is easily can be shown that there exist a matrix G such that G(x, t, u(t)) = GΦX_{t}. Therefore, each step is expressed as a series expansion based on orthogonal polynomials and calculating the integrals of each step is done, easily.

Let us suppose that:

(8) |

where, :φ_{k}(x)}^{∞}_{k = 0} = ΦX_{x} is a set of arbitrary orthogonal polynomial bases defined by a lower triangular matrix Φ, u_{i} = [u_{i0}, u_{i1}, u_{i2},...] and X_{x} = [1, x, x^{2},...]^{T}. Therefore, we have:

(9) |

Thus, the approximate series of the exact solution of Eq. 1 is considered as:

This modification decreases the volume of computations and runtime of the algorithm of the method due to the orthogonality of the polynomials using in the aforementioned procedure.

**SOME ORTHOGONAL POLYNOMIALS**

Orthogonal functions can be used to obtain a good approximation for transcendental functions. Since, Chebyshev and Legendre polynomials are more applicable orthogonal functions for a wide range of problems therefore we consider them, briefly.

**Chebyshev polynomials:** The Chebyshev polynomials are defined on [-1, 1] as:

(10) |

or,

and shifted Chebyshev polynomials are defined as:

(11) |

**Legendre polynomials:** The Legendre polynomials on [-1, 1] are defined as:

(12) |

or,

and shifted Legendre polynomials are defined as:

(13) |

**ILLUSTRATIVE NUMERICAL EXPERIMENTS**

Here, we consider four test problems corresponding to the DBIE (1) to demonstrate the efficiency of the proposed method. In all experiments, we use orthogonal polynomials to decrease the volume of computations. The computations associated with these experiments were performed in Maple 13 on a PC, CPU 2.4 GHz.

**Experiment 1:** Consider the following DBIE:

where:

The exact solution is u(x) = e^{x} and the delay functions are σ(x) = x-x^{3} and τ(x) = x-x^{2}.

We have solved this experiment using TDM with shifted Legendre polynomials and n = 10. The sequence of approximate solution is obtained as follows:

Thus, we obtain:

Hence, we get:

This has the closed form u(x) = e^{x} which is the exact solution of the problem.

Also, we test the runtime of the algorithm of the method for different n. For n = 5, 10, 15 and 20 the runtimes are obtained as 0.109, 0.250, 0.437 and 0.733 in sec, respectively.

**Experiment 2:** Consider the following DBIE:

where:

The exact solution is u(x) = sin(x). Also, delay functions are as σ(x) = x-x/10 and τ(x) = x-x/2.

We have solved this problem using TDM with shifted Chebyshev polynomials and n = 10. The sequence of approximate solution is obtained as follows:

Thus, we obtain:

Therefore, we conclude that:

This convergent series solution has the closed form u(x) = sinx which is the exact solution of the problem.

The runtime of the algorithm of the method for n = 4, 8 and 12 are obtained as 0.094, 0.921 and 3.760 in sec, respectively.

**Experiment 3:** Consider the following nonlinear DBIE:

with the exact solution u(x) = e^{-x}. Delay functions are σ(x) = x-x/6 and τ(x) = x-x/3.

We have solved this problem using OTM with shifted Legendre polynomials and n = 5. The sequence of approximate solution is obtained as follows:

Thus, we obtain:

Hence, we conclude that:

This has the closed form u(x0 = e^{-x} which is the exact solution of the problem. The runtime of the algorithm of the method for n = 5, 10,15 and 20 are obtained as 0.015, 0.063, 0.109 and 0.203 in sec, respectively.

**Experiment 4:** Consider the following nonlinear DBIE:

The exact solution is u(x) = cosx and the delay functions are σ(x) = x-x/2 and τ(x) = x-x^{3}.

We have solved this problem using OTM with shifted Chebyshev polynomials and n = 9. The sequence of approximate solution is obtained as follows:

Thus, we obtain:

Hence, we conclude that:

This has the closed form u(x) = cosx(x), which is the exact solution of the problem.

For n = 5, 10, 15 and 20 the runtime of the method are obtained as 0.140, 0.624, 1.201 and 2.262 in sec, respectively.

**CONCLUSION **

In this study, the TDM was made applicable to DBIEs. TDM provides the solution of the problem without calculating Adomian’s polynomials which is an important advantage over the Adomian decomposition method. Also, the orthogonality of the polynomials using in the proposed method reduced the volume computations of the resolvent algorithm. This modification considerably is capable for solving a wide range class of linear and nonlinear equations. This purpose was satisfied by solving some linear and nonlinear experiments. Furthermore, this method yields the desired accuracy only in a few terms in a series form of the exact solution. The method is also quite straightforward to write computer code. These facts illustrate the TDM as a fast, reliable, valid and powerful tool for solving DBIEs.

####
**REFERENCES**

- Brunner, H., 1994. Collocation and continuous implicit Runge-Kutta methods for a class of delay volterra integral equations. J. Comput. Applied Math., 53: 61-72.

CrossRef - Cahlon, B. and D. Schimidt, 1997. Stability criteria for certain delay integral equations of volterra type. J. Comput. Applied Math., 84: 161-188.

CrossRef - Alnasr, M.H., 2004. The numerical stability of multistep methods for volterra Integral equations with many delays. Int. J. Comput. Math., 81: 1257-1263.

CrossRefDirect Link - Baker, C.T.H. and M.S. Derakhshan, 1993. Convergence and stability of quadrature methods applied to volterra equations with delay. IMA J. Numer. Anal., 13: 67-91.

CrossRefDirect Link - Hu, Q., 1999. Multilevel correction for discrete collocation solutions of volterra integral equations with delay arguments. Applied Numer. Math., 31: 159-171.

CrossRef - Canada, A. and A. Zertiti, 1994. Method of upper and lower solutions for nonlinear delay integral equations modelling epidemics and population growth. Math. Models Methods Applied Sci., 4: 107-119.

CrossRef - Ashwin, P., E. Covas and R. Tavakol, 2001. Influence of noise on scalings for in out intermittency. Phys. Rev., E 64: 66204-66215.

CrossRefDirect Link - Brunner, H. and Q. Hu, 2005. Super convergence of iterated collocation solutions for Volterra integral equations with variable delays. Soc. Ind. Applied Math. J. Numer. Anal., 43: 1943-1949.

Direct Link - Vanani, S.K. and A. Aminataei, 2009. Multiquadric approximation scheme on the numerical solution of delay differential systems of neutral type. Math. Comput. Modell., 49: 234-241.

CrossRef - Adomian, G., 1988. A review of decomposition method in applied mathematics. J. Math. Anal. Appl., 135: 501-544.

CrossRef - Adomian, G. and R. Rach, 1992. Noise terms in decomposition solution series. Comput. Math. Applic., 24: 61-64.

CrossRef - Hosseini, M.M., 2006. Adomian decomposition method with Chebyshev polynomials. Appl. Math. Comput., 175: 1685-1693.

CrossRef - Wazwaz, A.M., 1999. A reliable modification of adomian decomposition method. Applied Math. Comput., 102: 77-86.

CrossRef - Wazwaz, A.M., 1999. Analytical approximations and Pade approximants for Volterra's population model. Applied Math. Comput., 100: 13-25.

CrossRef - Wazwaz, A.M., 2000. A new algorithm for calculating Adomian polynomials for non-linear operators. Applied Math. Comput., 111: 33-51.

CrossRef - Wazwaz, A.M., 2002. A new method for solving singular initial value problems in the second-order ordinary differential equations. Applied Math. Comput., 128: 45-57.

CrossRef - Wazwaz, A.M. and S.M. El-Sayed, 2001. A new modification of the adomian decomposition method for linear and nonlinear operators. Applied Math. Comput., 122: 393-405.

CrossRefDirect Link - Hosseini, M.M. and H. Nasabzadeh, 2006. On the convergence of adomian decomposition method. Appl. Math. Comp., 1: 536-543.

CrossRef