- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Applied Mathematics

Volume 2012 (2012), Article ID 370894, 12 pages

http://dx.doi.org/10.1155/2012/370894

## Fixed-Point Iterative Algorithm for the Linear Fredholm-Volterra Integro-Differential Equation

Departamento de Matemática Aplicada, E.T.S. de Ingeniería de Edificación, Universidad de Granada, 18071 Granada, Spain

Received 23 March 2012; Revised 30 April 2012; Accepted 1 May 2012

Academic Editor: Rudong Chen

Copyright © 2012 M. I. Berenguer et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

With the aid of fixed-point theorem (an equivalent version for the linear case) and biorthogonal systems in adequate Banach spaces, the problem of approximating the solution of a linear Fredholm-Volterra integro-differential equation is turned into a numerical algorithm, so that it can be solved numerically.

#### 1. **Introduction**

Denoting by and the Banach space of all continuous and real-valued functions defined on and , respectively, equipped with their usual sup-sup norm, let us consider the following problem associated to the Fredholm-Volterra integro-differential equation: given , and , find such that

Observe that if and in (1.1), the equation is transformed into a linear Volterra integro-differential equation; and if and , it becomes a linear Fredholm integro-differential. Additionally, if , (1.1) is transformed into a linear differential equation of the first order.

Frequently the mathematical modelling of problems arising from the real world (see [1] and the references therein) deals with problem (1.1). These are usually difficult to solve analytically, and in many cases, the solution must be approximated. Therefore, in recent years, several numerical approaches have been proposed (see, e.g., [2–4]). The numerical methods usually transform the integro-differential equation into a linear system that can be solved by direct or iterative methods. On the other hand, the use of fixed-point techniques in the numerical study of linear differential, integral, and integro-differential equations has also proven successful in some works, as [5–11]. The purpose of this paper is to develop an effective method for approximating the solution of (1.1) using Schauder basis and another classical tool in analysis: an equivalent version of the fixed-point theorem for the linear case (the geometric series theorem). This algorithm generalizes the developed ones in [7, 8, 10] for Volterra integro-differential, Fredholm integro-differential, and differential equation, respectively.

To establish our numerical method, we first need to review some results of a theoretical nature in Section 2. We arrive at a numerical method for approximating the solution of (1.1) in Section 3, and in order to state the results about convergence and to study the error of the proposed algorithm, we will assume that and and . Finally, in Section 4, we illustrate the theoretical results with two examples.

#### 2. **Two Tools of a Theoretical Nature**

Two fundamental tools will be used to establish the algorithm needed to solve the problem (1.1). The first is the following equivalent version (for the linear case) of the Banach fixed-point theorem (see [12]).

**Geometric Series Theorem**

Let be a Banach space, and let be a continuous and linear operator such that . Then, is a continuous, linear, and bijective operator and .

In particular, given , the equation has a unique solution .

The second tool applied consists of biorthogonal systems in Banach spaces and . We will make use of the usual Schauder basis for simplicity in the exposition, although the numerical method given works equally well by replacing it with any complete biorthogonal system in . For this reason, we will now briefly recall the main issues and notations regarding Schauder bases in and .

Let us consider the usual Schauder basis in the space , that is, for a dense sequence of distinct real numbers in such that and , we define for , and for , is the piecewise linear continuous function on with nodes at , uniquely determined by the relations and for . For each function , there exists a unique sequence of scalars such that . We denote by the sequence of (continuous and linear) biorthogonal functionals in the dual space of , defined by
whereas the sequence of (continuous and linear) *projections * is defined by the partial sums

For the respective sequence of biorthogonal systems and each , the equalities are valid (see [13]). As a consequence, the sequence of associated projections satisfies the following interpolation property:

We now evoke the construction of the usual Schauder basis for the Banach space , endowed with its usual sup-norm (see [13, 14]). To this end, we consider the bijective mapping (where denotes the integer part of ) given by Then it suffices to define whenever . Let and stand for the corresponding sequences of biorthogonal functionals and projections, respectively. The Schauder basis has similar properties to those of the one-dimensional basis : (a)for all , and for , (b)if , then , and for all , if , ,(c)the sequence of associated projections satisfies , whenever and ,(d)this Schauder basis is monotone, that is,

Observe that for each , the definition of the projections and requires only the first points of the sequence . These points, sorted in increasing order, constitute a partition of the interval , which will be denoted as ; let denote the maximum distance between two consecutive points of . Under some weak conditions, from (2.4) and (c), respectively, and the mean-value theorem, we can estimate the rate of convergence of the sequence of projections:

#### 3. **The Algorithm: Convergence and Error**

Our starting point is the formulation of (1.1) in terms of a certain operator as follows: let be the linear and continuous operator defined by

It is a simple matter to check that a function is the solution of (1.1) if and only if , where .

It can be shown by an induction argument and Fubini's theorem that for , ; hence, The condition assumed on and the geometric series theorem allow us to establish the existence of one and only one solution of (1.1), which is Besides,

In view of (3.3), we consider the sequence defined as follows: , and for ,

The sequence converges to the solution of (1.1) and

We can then calculate iteratively using (3.5), at least in a theoretical way, the solution of (1.1). From a practical viewpoint, in general these calculations are not possible explicitly. The idea of our numerical method is to use an appropriate Schauder basis in the spaces , truncating the functions of such spaces by means of the projections of the Schauder bases and , and replacing each () in (3.5) by a new function , easier to calculate, and in such a way that the error be small enough. Given these functions, each will be approximation of the solution of (1.1).

Specifically, we begin with and consider Letting , we inductively define the functions where are natural numbers.

We will show that the sequence approximates the solution of (1.1) while in order to study the error , let us assume that and .

In the first place, we show the following.

Lemma 3.1. * The sequences and are bounded.*

* Proof. * First we show, using an inductive argument, that for all , . Since the Schauder basis is monotone, we have

Suppose that the result holds for , in other words , and using the monotony of , we prove for the following:
Therefore, .

On the other hand, with similar arguments,
and thus, .

*Remark 3.2. *Given that for and ,
denoting by
we have that the sequence is also bounded.

Theorem 3.3. *With the previous notation, if , with and , then
*

*Proof. *The triangle inequality gives . Because of the inequality (3.6), we have
For the second one, by an inductive argument, we can show that
Indeed, for , the result is clearly true
Suppose it holds for , that is, , and we prove for the following:
Then
For ,

And thus, applying (2.7), we obtain the following bound:

The proof is complete in view of the triangular inequality and of (3.6) and (3.16).

*Remark 3.4 3.4. *Under the hypothesis of Theorem 3.3, for all , we can find and positive integers such that . Furthermore, since and the points of partition can be chosen such that is as small as we desire, is as small as we desire, and (3.14) also provides a quota of the error committed when we approach by .

*Remark 3.5. *It follows from Theorem 3.3 that the proposed method with the chosen Schauder bases has order of convergence one. This choice has been done by simplicity in the exhibition of the results, and it has allowed us to obtain satisfactory numerical results as we show in the following section. Nevertheless, by integrating the considered basis in (and adding the one constant function), we obtain new bases of and . Considering these bases, the order of convergence is 2. In general, integrating times, we would obtain order of convergence .

#### 4. **Some Numerical Example**

We now turn our attention to show two numerical performance results. For each example, we have fixed the subset chosen for constructing the Schauder basis in and in , specifically, , ; and for , if where are integers. To define the sequence , we take (for all ). In addition we include, a table exhibiting, for , and , the absolute errors committed for certain representative points of when we approximate the exact solution by means of the iteration where is shown in the table. The algorithms associated with the numerical method were performed using Mathematica 7. We have checked that when more points are used, the accuracy improves significantly, unlike the number of iterations.

In order to provide some details, we synthesize the steps of the programmed algorithm: (1)we introduce the nodes; we construct the base and the base , (2)we calculate (if it is not possible to explicitly arrive at , we can apply a quadrature method), (3)we define and , (4)we calculate and using the base and , , , and using the base . Note that we calculate the projections by integrals of piecewise univariate and bivariate polynomials of degrees 1 and 2 and the calculation of the coefficients of such polynomials just requires linear combinations of several evaluations of the basic functions at adequate points. We do not have to solve systems of algebraic equations, (5)we calculate the expression using Definition (3.8), (6)repeat the process.

*Example 4.1. *For the first example, we consider the following linear Fredholm-Volterra integro-differential equation with the exact solution . Its numerical results are given in Table 1 and Figure 1:

*Example 4.2. *For the second example, we consider the following linear Fredholm-Volterra integro-differential equation with the exact solution . Its numerical results are given in Table 2 and Figure 2:

#### 5. **Conclusions**

An efficient approach easy to implement is proposed to solve the linear Fredholm-Volterra integro-differential equations. The approximating functions are the sum of integrals of piecewise bivariate polynomials of degree 2, and the calculation of the coefficients of such polynomials just requires linear combinations of several evaluations of the basic functions at adequate points. The approach leads to an approximate solution of the integro-differential equation, which can be expressed explicitly in simple closed form, and which can be effectively computed using symbolic computing codes on any personal computer.

#### Acknowledgments

This research is partially supported by Junta de Andalucía Grant FQM359 and the ETSIE of the University of Granada.

#### References

- M. Rahman, Z. Jackiewicz, and B. D. Welfert, “Stochastic approximations of perturbed Fredholm Volterra integro-differential equation arising in mathematical neurosciences,”
*Applied Mathematics and Computation*, vol. 186, no. 2, pp. 1173–1182, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - Y. Huang and X.-F. Li, “Approximate solution of a class of linear integro-differential equations by Taylor expansion method,”
*International Journal of Computer Mathematics*, vol. 87, no. 6, pp. 1277–1288, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - K. Maleknejad, B. Basirat, and E. Hashemizadeh, “A Berstein operational matrix approach for solving a system of high order linear Volterra-Fredholm integro-differential equations,”
*Mathematical and Computer Modelling*, vol. 55, pp. 1363–1372, 2012. - S. Yalçınbaş and M. Sezer, “The approximate solution of high-order linear Volterra-Fredholm integro-differential equations in terms of Taylor polynomials,”
*Applied Mathematics and Computation*, vol. 112, no. 2-3, pp. 291–308, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - M. I. Berenguer, A. I. Garralda-Guillem, and M. Ruiz Galán, “An approximation method for solving systems of Volterra integro-differential equations,”
*Applied Numerical Mathematics*. In press. View at Publisher · View at Google Scholar - M. I. Berenguer, D. Gámez, A. I. Garralda-Guillem, M. Ruiz Galán, and M. C. Serrano Pérez, “Analytical techniques for a numerical solution of the linear Volterra integral equation of the second kind,”
*Abstract and Applied Analysis*, vol. 2009, Article ID 149367, 12 pages, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - M. I. Berenguer, M. A. Fortes, A. I. Garralda Guillem, and M. Ruiz Galán, “Linear Volterra integro-differential equation and Schauder bases,”
*Applied Mathematics and Computation*, vol. 159, no. 2, pp. 495–507, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - M. I. Berenguer, M. V. Fernández Muñoz, A. I. Garralda-Guillem, and M. Ruiz Galán, “A sequential approach for solving the Fredholm integro-differential equation,”
*Applied Numerical Mathematics*, vol. 62, pp. 297–304, 2012. - F. Caliò, M. V. Fernández Muñoz, and E. Marchetti, “Direct and iterative methods for the numerical solution of mixed integral equations,”
*Applied Mathematics and Computation*, vol. 216, no. 12, pp. 3739–3746, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - E. Castro, D. Gámez, A. I. Garralda Guillem, and M. Ruiz Galán, “High order linear initialvalue problems and Schauder bases,”
*Applied Mathematical Modelling*, vol. 31, pp. 2629–2638, 2007. - A. Palomares and M. R. Galán, “Isomorphisms, Schauder bases in Banach spaces, and numerical solution of integral and differential equations,”
*Numerical Functional Analysis and Optimization*, vol. 26, no. 1, pp. 129–137, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - K. Atkinson and W. Han,
*Theoretical Numerical Analysis*, vol. 39, Springer, New York, NY, USA, 2nd edition, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - Z. Semadeni, “Product Schauder bases and approximation with nodes in spaces of continuous functions,”
*Bulletin de l'Académie Polonaise des Sciences*, vol. 11, pp. 387–391, 1963. View at Zentralblatt MATH - B. R. Gelbaum and J. Gil de Lamadrid, “Bases of tensor products of Banach spaces,”
*Pacific Journal of Mathematics*, vol. 11, pp. 1281–1286, 1961. View at Zentralblatt MATH