1. Introduction

In the present work, we present a formulation of a new numerical approach which is based on the generalized integrodifferential quadrature method and applied to weakly singular Volterra and Fredholm integrodifferential equations in the linear case. This method studies the situation in which the unknown function is identified as the Lagrange polynomial and the interpolating points of the Tchebychev type are used. The accuracy and efficiency of solving integrodifferential equations are still an ongoing research in numerical analysis. Several different methods have also been modeled for the solutions of linear and nonlinear problem [1–27].

The central argument for the interest of the type of this problem comes naturally from its wide applications almost in any branches of science and engineering described by systems of ODEs and PDEs [28–38] which in some situations can be transformed into a set of integral equations. Much attention has been devoted to the investigation of new mathematical models and numerical approaches to evaluate the solutions of the integral equations.

New calculations are performed for the construction of the solution by a suitable choice of the interpolating points using the unified integrodifferential quadrature method. Based on this fact, this technique is a very promising and powerful methodology in successfully locating best solutions of the problem. Our main purpose is to develop a general numerical schema for the integrodifferential equations that is universally applicable.

The contents of this paper are organized as follows. In Section 2, a formulation adapted to the problem of construction of the solution of the one-dimensional weakly singular integrodifferential equation by using a summary limited to some aspects of the unified integrodifferential quadrature method is qualitatively presented. Section 3 exposes some essential examples for the construction of the unknown solution. The comments and conclusion are given in Section 4.

2. Unified Integrodifferential Quadrature Method

The description of generalized integrodifferential quadrature method is summarized as follows: the starting point of the weakly singular integrodifferential equation is written as where is given by and we set with prescribed boundary condition .

and are parameters with . , and are given functions, and is a regular kernel of the integrodifferential equation. It is assumed that the function involved in (1) is sufficiently regular. The above equations, for , become regular integrodifferential equations.

In order to avoid the singularity, (1) is integrated by part and with little effort; we obtain Now the relation (1) becomes where , and and for Volterra type and Fredholm type, respectively.

At this stage, we introduce the quadrature aspect of solutions: the derivatives and integral in expression (6) are approximated by where are interpolating points, taken as the points of Tchebychev of the form , . and are the weighting coefficients linked with Lagrange interpolated polynomials and are explicitly given by

With little effort the original problems (1) can be converted to an algebraic system and take, respectively, the following compact forms: for Volterra type, and for Fredholm type, where

The relations (12) and (13) are real systems of equations in the unknown real coefficients and , respectively, where . In order to avoid unnecessary calculation and to optimize the computational aspect, it is therefore more convenient to get the desired coefficients , , and in the following forms:

Now the expressions (14), (15), (16), (17), and (18) provide the charmingly practical formulae for the weighting coefficients. Once the function values at all grid points are obtained, it is then easy to determine the function values in the overall domain in terms of polynomial approximation, such that

The practical part of this study is examined in the following section.

3. Worked Examples

We shall consider the solution of some crack situations in order to show the application and the effectiveness of the method described in Section 2. Four examples are considered for this purpose.

We write (1) in the form where and stand for the values of and , respectively. and denote the values of and , respectively.

Evaluating (20) and (21) at , the linear systems of algebraic equations follow, respectively, where the vectors and have components and , respectively, is a matrix with the elements , and the components of and are given by (14) and (15) together with (16), (17), and (18). The equations (20) and (21) are explicit prescriptions that give the solutions in operations.

The accuracy of solutions can be checked by using the error tolerance , where “” is a positive integer. We continue evaluating the solution until the above relation was satisfied.

In order to verify the efficiency of the method developed in the previous section, the following examples have been selected to provide a comparison with previously published work.

3.1. Example  1

In this example we use Volterra’s integrodifferential equation [39] given by where , from the governing equation (1) and (24) subject to , we deduce the following: , and . The exact solution is .

Illustrated in Figure 1 is the basic application of the problem (24). The numerical result displayed in Figure 1 is qualitatively in good agreement with the exact solution in which the error tolerance, .

Figure 1: Solution of (23). Solid curve: exact solution: , dash curve: present work.

3.2. Example  2

We consider the numerical solution of the following Volterra’s integrodifferential equation [40]: where , and from this equation we deduce the following: , and the kernel .

The above equation has the exact solution .

The result is displayed in Figure 2, where the error tolerance, . With this tolerance and for the number of the interpolation points , the results under consideration are very satisfactory.

Figure 2: Solution of (24). Solid line: exact solution: , dash curve: present work.

3.3. Example  3

Consider the Fredholm integrodifferential equation [41]: where , and from this equation we deduce the following: , , , , , , , , and the kernel . The exact solution has the form .

In Figure 3, the number of interpolation points is taken equal to to solve this problem with . We see from this Figure that the method provides accurate results in the full range, where the error tolerance, .

Figure 3: Solution of (25). Solid curve: exact solution: , dash curve: present work.

3.4. Example  4

We apply the mentioned technique to solve the fifth-order Fredholm integrodifferential equation [42]: where , and from this equation we deduce the following: , and the kernel . The exact solution has the form . Figure 4 presents computer simulations of this example, that is generated using the number of interpolating points . The result is compared with the exact solution. From Figure 4, we see that the agreement between the numerical result of the present method and the exact result is very good, with an error tolerance .

Figure 4: Solution of the equation (26). Solid curve: exact solution: , dash curve: present work.

4. Comments and Conclusions

This paper has introduced a new formulation that uses the unified integrodifferential quadrature method to handle some integrodifferential equations. The main advantage of Lagrange polynomial is that the weighting coefficients that have to be computed do not depend on the and it is independent on the manner the discrete points are ordered.

The preliminary results, obtained through the use of this method, show that the resulting solutions are quite good for all examples which have been selected here as a testbed. We can note that similar patterns of convergence are seen for all four examples with a common tolerance .

This method seems to be a powerful alternative and consequently gives very accurate solutions to the problems under consideration. It would be interesting to generalize this method to the nonlinear case. This matter deserves a further work.

Acknowledgments

The authors gratefully acknowledge helpful conversations with Professor W. Cramer. This work was sponsored in part by the M.E.R.S (Ministère de l’Enseignement et de la Recherche Scientifique): under contract no. D01420060012.