**ABSTRACT**

In this study, approximate and/or exact analytical solutions of the Retarded Delay Differential Systems (RDDSs) are obtained by Telescoping Decomposition Method (TDM). TDM is a modified form of the well-known Adomian Decomposition Method (ADM). The main features of the TDM are that it deforms a difficult problem into a set of problems which are easier to solve and avoids calculating the Adomian polynomials. The analytical approximations with high accuracy are obtained using the TDM which agree well with the numerical results. Some illustrative linear and nonlinear experiments are given to indicate the validity and great potential of the proposed method for solving RDDSs.

PDF Abstract XML References Citation

**Received:**March 05, 2012;

**Accepted:**July 11, 2012;

**Published:**August 01, 2012

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

*Journal of Applied Sciences, 12: 1513-1517.*

**DOI:**10.3923/jas.2012.1513.1517

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

**INTRODUCTION**

Retarded delay differential systems with proportional delays represent a particular class of delay differential systems. Such systems play an important role in the **mathematical modeling** of real world phenomena such as physical problems, circuit analysis, computer-aided design, power systems, simulation of mechanical systems and more general **optimal control** problems; thus, they have attracted the attention of numerical analysts (Hale and Lunel, 1993; Taiwo and Odetunde, 2010; Hafshejani * et al*., 2011; Shieh * et al*., 2011; Vanani * et al*., 2011a; Vanani and Aminataei, 2009, 2010). A RDDS is presented as follows (Bellen and Zennaro, 2003):

(1) |

Where:

(2) |

is the state vector and:

(3) |

such that {α_{k} (x)≤b}^{m}_{k = 0} are delay functions; A(x) and B(x) are (m+1)-dimensional matrices which their entries are complex functions of x. Also:

(4) |

(5) |

represent the initial vector function and known vector function, respectively.

Obviously, most of these systems cannot be solved exactly. It is therefore necessary to design efficient numerical methods to approximate their solutions. TDM as a modification of ADM is considered as a efficient method for solving RDDSs. The ADM was first introduced by Adomian (1968, 1988) and has been used to integrate various systems of functional equations (Adomian, 1988). Recently, many literatures have been developed for the application of ADM (Adomian, 1988, 1994; Adomian and Rach, 1992; Chowdhury, 2011; Jaradat, 2008; Kooch and Abadyan, 2011, 2012). Several modifications of ADM have been presented various fields of applied mathematics and physics (Hosseini, 2006; Wazwaz, 1999a, b, 2000, 2002; Vanani *et al*., 2011b).

The difficult parts of ADM is to calculate the Adomian polynomials. There are large number of literature to present an efficient algorithm for computing Adomian polynomials (Wazwaz and El-Sayed, 2001). The most popular one is the formula obtained bu Adomian (1994, 1988) as:

(6) |

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 should b noted that the calculation of the Adomian polynomials is too difficult for large n and Eq. 6 can not be applied if f is a function of more than one variable, such as f = f(u, u') In addition, the ADM may diverge for some problems with special conditions (Hosseini and Nasabzadeh, 2006). Hence, to remove this difficulty we proposed a new and efficient method (TDM) for solving desired RDDS.

**APPLICATION OF TDM ON RDDSs**

The structure of TDM is as follows. Let us the problem (1) is given. So, we can consider its solution in the following form:

(7) |

Where:

(8) |

have to be determined sequentially upon the following algorithm:

(9) |

and so on.

Adding the above equations, we obtain:

(10) |

This method is called TDM which is useful for different problems in finite, infinite, regular and irregular domains. The convergency and more details of this method are given (Al-Refai *et al*., 2008).

**ILLUSTRATIVE NUMERICAL EXPERIMENTS**

Here, three experiments of RDDSs are given to illustrate the efficiency and validity of the method. All experiments are considered on the interval [0, 1]. To simplify the computations, we have used Taylor series expansion of each iteration. The computations associated with the experiments discussed below were performed in Maple 14 on a PC with a CPU of 2.4 GHz.

**Experiment 1:** Consider the RDDS (1) with the following conditions:

(11) |

The exact solution is U(x) = [e^{x}, e^{-x}].

We have solved this problem using TDM with n = 4. The sequence of approximate solution is obtained as follows:

(12) |

Hence, we get:

(13) |

Therefore, we conclude that:

(14) |

This has the closed form U(x) = [e^{x}, e^{-x}]^{T} which is the exact solution of the problem. To show the fastness of the method, the runtime of the proposed algorithm is also computed. Table 1 shows the results including the maximum absolute error and runtime of the method for different n.

Table 1 illustrates that the solutions of TDM are in good agreement with the exact solution. Also, the runtime of the proposed algorithm illustrate the method as a fast and powerful tool.

**Experiment 2:** Consider the RDDS (1) with the following conditions:

(15) |

The exact solution is U(x) = [sin(x), e^{x}, cos(x)]^{T}.

We have solved this problem using TDM with n = 6. The sequence of approximate solution is obtained as follows:

| (16) |

Thus, we obtain:

(17) |

Therefore, we conclude that:

(18) |

This has the closed form U(x) = [sin(x), e^{x}, cos(x)]^{T}, which is the exact solution of the problem. The runtime of the method is also computed for different n to obtain a suitable approximation. Table 2 shows the results including the maximum absolute error and runtime of the method for different n.

The results also confirm the method as a fast method. Therefore, using the proposed method is preferred to facilitate the computations as shown in Table 2.

Table 1: | Maximum absolute error and runtime of the method for different n of experiment 1 |

Table 2: | Maximum absolute error and runtime of the method for different n of experiment 2 |

**Experiment 3:** Consider the RDDS (1) with the following conditions:

(19) |

The exact solution is U(x) = [sinh(x), cosh(x), sin(x), e^{x2}]^{T}.

We have solved this problem using TDM with n = 7. The s following results are obtained:

(20) |

Therefore, we conclude that:

(21) |

This has the closed form U(x) = [sinh(x), cosh(x), sin(x) e^{x2}]^{T} which is the exact solution of the problem. Table 3 shows the results including the maximum absolute error and runtime of the method for different n.

The high accuracy of the method can be observed again. Therefore, we prefer the proposed method for solving RDDSs.

Table 3: | Maximum absolute error and runtime of the method for different n of experiment 3 |

**CONCLUSION**

This study has presented a reliable algorithm based on the TDM to solve RDDSs. Some experiments are given to illustrate the validity and accuracy of the proposed method. The main feature of the TDM is to avoid calculating the Adomian polynomials. 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. The reliability of TDM and the reduction in computations give TDM a wider applicability.

####
**REFERENCES**

- 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 - Chowdhury, S.H., 2011. A comparison between the modified homotopy perturbation method and adomian decomposition method for solving nonlinear heat transfer equations. J. Applied Sci., 11: 1416-1420.

CrossRef - Hafshejani, J.S., S.K. Vanani and J. Esmaily, 2011. Operational Tau approximation for neutral delay differential systems. J. Applied Sci., 11: 2585-2591.

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

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

CrossRef - Kooch, A. and M. Abadyan, 2011. Evaluating the ability of modified Adomian decomposition method to simulate the instability of freestanding carbon nanotube: comparison with conventional decomposition method. J. Applied Sci., 11: 3421-3428.

CrossRef - Kooch, A. and M. Abadyan, 2012. Efficiency of modified adomian decomposition for simulating the instability of nano-electromechanical switches: Comparison with the conventional decomposition method. Trends Applied Sci. Res., 7: 57-67.

CrossRefDirect Link - Shieh, M.Y., J.S. Chiou and C.M. Cheng, 2011. Delay independence stability analysis and switching law design for the switched time-delay systems. Inform. Technol. J., 10: 1201-1207.

CrossRefDirect Link - Taiwo, O.A. and O.S. Odetunde, 2010. On the numerical approximation of delay differential equations by a decomposition method. Asian J. Math. Stat., 3: 237-243.

CrossRefDirect 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 - Vanani, S.K., S. Heidari and M. Avaji, 2011. A low-cost numerical algorithm for the solution of nonlinear delay boundary integral equations. J. Applied Sci., 11: 3504-3509.

CrossRefDirect Link - 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. 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 - 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 - Jaradat, O.K., 2008. Adomian decomposition method for solving abelian differential equations. J. Applied Sci., 8: 1962-1966.

CrossRefDirect Link