Professional Documents
Culture Documents
5402/2012/139514
Research Article On Some Volterra and Fredholm Problems via the Unied Integrodifferential Quadrature Method
Abdelwahab Zerarka, Abdesselam Soukeur, and Hanane Saidi
Laboratory of Applied Mathematics, Mohamed Khider University of Biskra, BP145, 07000 Biskra, Algeria Correspondence should be addressed to Abdelwahab Zerarka, abzerarka@yahoo.fr Received 6 September 2011; Accepted 20 October 2011 Academic Editors: V. Rai and K. Wang Copyright 2012 Abdelwahab Zerarka 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. We present a new approach based on the formulation of the integrodierential quadrature method (hereafter called IDQ) to handle Volterras and Fredholms equations. This approach is constructed and tested with some realistic numerical examples using the basic computational aspects.
1. Introduction
In the present work, we present a formulation of a new numerical approach which is based on the generalized integrodierential quadrature method and applied to weakly singular Volterra and Fredholm integrodierential equations in the linear case. This method studies the situation in which the unknown function is identied as the Lagrange polynomial and the interpolating points of the Tchebychev type are used. The accuracy and eciency of solving integrodierential equations are still an ongoing research in numerical analysis. Several dierent methods have also been modeled for the solutions of linear and nonlinear problem [127]. 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 [2838] 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 unied integrodierential 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 integrodierential 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 integrodierential equation by using a summary limited to some aspects of the unied integrodierential 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.
k ( x )
k=1
a x T, (1)
(x s) K (x, s) f (s)ds,
(2)
2 and we set for Volterra type, W (x, z) = W (x, T ), for Fredholm type,
W (x, x),
ISRN Computational Mathematics linked with Lagrange interpolated polynomials PN , j (x) and are explicitly given by (3)
k Dm j = xm 0 T 0
(9)
with prescribed boundary condition f (a) = fa . and are parameters with 0 < < 1. (x), (x), and k (x) (k = 0, . . . , m) are given functions, and K (x, s) is a regular kernel of the integrodierential equation. It is assumed that the function involved in (1) is suciently regular. The above equations, for = 0, become regular integrodifferential equations. In order to avoid the singularity, (1) is integrated by part and with little eort; we obtain W (x, z) = 1 ( 1) (x z)1 K (x, z) f (z)
(x a)
1
Im j =
(xm s)1
(10) ds.
Jm j =
(xm s)
With little eort the original problems (1) can be converted to an algebraic system and take, respectively, the following compact forms:
N
I Um j f xj ,
m = 0, . . . , N , (11)
(4)
1 ( 1)
z a
(x s)1
j =0
J Um j f xj ,
m = 0, . . . , N , (12)
k (x)
k=1
Im j , (1 ) Jm j . (1 )
(13)
(x s)1
J Um j =
(14)
where (x, z) = (x) + (/ ( 1))((x z)1 K (x, z) f (z) (x a)1 K (x, a) f (a)), and z = x and z = T 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 dk f (xm ) = dxk
xm a N j =0 k Dm j
The relations (12) and (13) are real systems of M M I equations in the M M unknown real coecients Um j and J Um j , respectively, where M = N + 1. In order to avoid unnecessary calculation and to optimize the computational aspect, it is therefore more convenient to get the desired coecients Dii , Iii , and Jii in the following forms:
N k Dii =
f xj ,
N
(6)
j =0, j = /i
Dikj ,
for i = 0, . . . , N , k = 1, . . . , l,
(15)
(xm s)1
d K (xm , s) f (s) ds = ds
Im j f x j ,
j =0
(7)
Iii =
xi a
(xi s)1
dK (xi , s) Ii j , ds ds j =0, j = /i
for i = 0, . . . , N , (16)
(xm s)1
d K (xm , s) f (s) ds = ds
Jm j f x j ,
j =0
(8)
Jii =
T a
(xi s)1
for Fredholm type, where {xk }N k=0 are interpolating points, taken as the points of Tchebychev of the form x j = (1/ 2)T [1 cos((2 j + 1)/ (2N + 2) )], 0 j N . Di j and Im j are the weighting coecients
dK (xi , s) Ji j , ds ds j =0, j = /i
for i = 0, . . . , N. (17)
Now the expressions (14), (15), (16), (17), and (18) provide the charmingly practical formulae for the weighting coecients. Once the function values at all grid points are
ISRN Computational Mathematics obtained, it is then easy to determine the function values in the overall domain in terms of polynomial approximation, such that
N j =0
3
1 0.8 0.6 f (x) 0.4 0.2
f (x) =
f x j PN , j (x).
(18)
3. Worked Examples
We shall consider the solution of some crack situations in order to show the application and the eectiveness of the method described in Section 2. Four examples are considered for this purpose. We write (1) in the form
N
0.2
0.4 x
0.6
0.8
Figure 1: Solution f (x) of (23). Solid curve: exact solution: f (x) = x3/2 , dash curve: present work.
p f p + , pp =
j =0 N
I Up j fj,
p = 0, . . . , N ,
(19)
p f p + , pT =
j =0
J Up j fj,
p = 0, . . . , N ,
(20)
where (x) = (3/ 2) x + x x + (3/ 8)x2 , from the governing equation (1) and (24) subject to K (x, s) = 1, we deduce the following: l = 1, 1 (x) = 1, (x) = 1, = 1, = 1/ 2, a = 0, T = 1, and f0 = 0. The exact solution is f (x) = x3/2 . 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, TOLV = 105 . 3.2. Example 2. We consider the numerical solution of the following Volterras integrodierential equation [40]: d2 f (x) = f (x) + (x) + dx2
x 0
where f j and i stand for the values of f (xi ) and (xi ), respectively. , pp and , pT denote the values of (x p , x p ) and (x p , T ), respectively. Evaluating (20) and (21) at x p , the linear systems of algebraic equations follow, respectively, [IA U1 ]F = B1 , [IA U2 ]F = B2 , (21) (22)
xs f (s)ds,
(24)
0 x 1, f (0) = 1, where (x) = x(x + 1) + x(1 x) exp(x) + 2 x5 / 4, and from this equation we deduce the following: l = 2, 1 (x) = 0, 2 (x) = 1, (x) = 1, = 1, = 0, a = 0, T = 1, f0 = 1, and the kernel K (x, s) = xs. The above equation has the exact solution f (x) = x2 + exp(x). The result is displayed in Figure 2, where the error tolerance, TOLV = 106 . With this tolerance and for the number of the interpolation points N = 10, the results under consideration are very satisfactory. 3.3. Example 3. Consider the Fredholm integrodierential equation [41]: df (x) d2 f (x) +x = x f (x) + (x) + 2 dx dx
1
1
where the vectors F and B1 (B2 ) have components f p and , pp (, pT ), respectively, U1 (U2 ) is a matrix with the elements U1,i j = UiIj (U2,i j = UiJj ), and the components of U I and U I 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 O((N + 1)2 ) operations. The accuracy of solutions can be checked by using the error tolerance E(xi ) = | f (xi ) fexact (xi )| = 10 j , where j is a positive integer. We continue evaluating the solution until the above relation was satised. In order to verify the eciency 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 Volterras integrodifferential equation [39] given by df (x) = f (x) + (x) dx
x 0
1 x 1, f (1) =
(x s)1/2 f (s)ds,
(23)
0 x 1, f (0) = 0,
where (x) = exp(x) 2 sin(x), and from this equation we deduce the following: l = 2, 1 (x) = x, 2 (x) = 1, (x) = x, = 1, = 0, a = 1, T = 1, f1 = 1/e, and the kernel K (x, s) = es sin(x). The exact solution has the form f (x) = exp(x).
0.5
0.2
0.4 x
0.6
0.8
0.75
Figure 2: Solution f (x) of (24). Solid line: exact solution: f (x) = x2 + exp(x), dash curve: present work.
Figure 4: Solution f (x) of the equation (26). Solid curve: exact solution: f (x) = sin(x), dash curve: present work.
0.5 x
Figure 3: Solution f (x) of (25). Solid curve: exact solution: f (x) = exp(x), dash curve: present work.
In Figure 3, the number of interpolation points is taken equal to N = 10 to solve this problem with TOLV = 108 . We see from this Figure that the method provides accurate results in the full range, where the error tolerance, TOLV = 106 . 3.4. Example 4. We apply the mentioned technique to solve the fth-order Fredholm integrodierential equation [42]:
3 df (x) d5 f (x) 2 d f (x ) x = x f (x) + (x) + dx5 dx3 dx 1
1
This paper has introduced a new formulation that uses the unied integrodierential quadrature method to handle some integrodierential equations. The main advantage of Lagrange polynomial is that the weighting coecients that have to be computed do not depend on the f (xi ) 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 TOLV = 106 . 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` ere de lEnseignement et de la Recherche Scientique): under contract no. D01420060012.
f (s)ds,
References
[1] R. K. Miller and A. Feldstein, Smoothness of solutions of Volterra integral equations with weakly singular kernels, SIAM Journal on Mathematical Analysis, vol. 2, pp. 242258, 1971. [2] J. Norbury and A. M. Stuart, Volterra integral equations and a new Gronwall inequality. I. The linear case, Proceedings of the Royal Society of Edinburgh Section A, vol. 106, no. 3-4, pp. 361373, 1987. [3] J. Norbury and A. M. Stuart, Volterra integral equations and a new Gronwall inequality. II. The nonlinear case, Proceedings of the Royal Society of Edinburgh Section A, vol. 106, no. 3-4, pp. 375384, 1987. [4] A. Zerarka, S. Hassouni, H. Saidi, and Y. Boumedjane, Energy spectra of the Schr odinger equation and the dierential quadrature method, Communications in Nonlinear Science and Numerical Simulation, vol. 10, no. 7, pp. 737745, 2005.
1 x 1, f (1) = sin(1),
(26) where (x) = x2 cos(x) x sin(x), and from this equation we deduce the following: l = 5, 1 (x) = 1, 2 (x) = 4 (x) = 0, 3 (x) = x2 , 5 (x) = 1, (x) = x, = 1, = 0, a = 1, T = 1, f1 = sin(1), and the kernel K (x, s) = 1. The exact solution has the form f (x) = sin(x). Figure 4 presents computer simulations of this example, that is generated using the number of interpolating points N = 8. 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 TOLV = 106 .
5
[24] M. Federson, R. Bianconi, and L. Barbanti, Linear Volterra integral equations, Acta Mathematicae Applicatae Sinica, vol. 18, no. 4, pp. 553560, 2002. [25] M. Federson, R. Bianconi, and L. Barbanti, Linear Volterra integral equations as the limit of discrete systems, Cadernos de Matem atica, vol. 4, pp. 331352, 2003. [26] P. Linz, Analytical and Numerical Methods for Volterra Equations, vol. 7, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pa, USA, 1985. [27] U. Kulisch and W. L. Miranker, A New Approach to Scientic Computation, Academic Press, New York, NY, USA, 1983. [28] R. Hammer, M. Hocks, U. Kulisch, and D. Ratz, Numerical Toolbox for Veried Computing I, Springer, Berlin, Germany, 1995. [29] D. Bugajewski, On dierential and integral equations in locally convex spaces, Demonstratio Mathematica, vol. 28, no. 4, pp. 961966, 1995. [30] H.-J. Dobner, Bounds for the solution of hyperbolic problems, Computing, vol. 38, no. 3, pp. 209218, 1987. [31] E. T. Copson, Partial Dierential Equations, Cambridge University Press, Cambridge, UK, 1975. [32] D. Bugajewska, Topological properties of solution sets of some problems for dierential equations, Ph.D. thesis, Poznan, 1999. [33] A. Constantin, On the unicity of solutions for the dierential equation x(n) = f(t, x), Rendiconti del Circolo Matematico di Palermo Serie II, vol. 42, no. 1, pp. 5964, 1993. [34] D. Bugajewski and S. Szua, Knesers theorem for weak solutions of the Darboux problem in Banach spaces, Nonlinear Analysis, Theory, Methods & Applications, vol. 20, no. 2, pp. 169173, 1993. [35] M. Maron and R. Lopez, Numerical Analysis, Wadsworth Publishing Company, Belmont, Calif, USA, 1991. [36] M. Hukuhara, Th eor` emes fondamentaux de la th eorie des quations die rentielles ordinaires dans lespace vectoriel e topologique, Journal of the Faculty of Science, University of Tokyo, Section IA, vol. 8, pp. 111138, 1959. [37] R. K. Miller and A. Feldstein, Smoothness of solutions of Volterra integral equations with weakly singular kernels, SIAM Journal on Mathematical Analysis, vol. 2, pp. 242258, 1971. [38] G. Adomian, Random Volterra integral equations, Mathematical and Computer Modelling, vol. 22, no. 8, pp. 101102, 1995. [39] H. Brunner, Polynomial spline collocation methods for Volterra integrodierential equations with weakly singular kernels, IMA Journal of Numerical Analysis, vol. 6, no. 2, pp. 221239, 1986. [40] E. Rawashdeh, D. McDowell, and L. Rakesh, Polynomial spline collocation methods for second-order Volterra integrodierential equations, International Journal of Mathematics and Mathematical Sciences, vol. 2004, no. 56, pp. 3011 3022, 2004. [41] K. Al-Khaled and F. Allan, Decomposition method for solving nonlinear integro-dierential equations, Journal of Applied Mathematics & Computing, vol. 19, no. 1-2, pp. 415425, 2005. [42] A. Aky uz-Das co glu, A Chebyshev polynomial approach for linear Fredholm-Volterra integro-dierential equations in the most general form, Applied Mathematics and Computation, vol. 181, no. 1, pp. 103112, 2006.
Complex Analysis
Journal of
Algebra
Advancesin
Decision Sciences
Volume 2013
Volume 2013
Volume 2013
HindawiPublishingCorporation http://www.hindawi.com
Volume2013
Volume 2013
Complex Systems
Hindawi Publishing Corporation http://www.hindawi.com Volume 2013
Journal of
Mathematics
Hindawi Publishing Corporation http://www.hindawi.com Volume 2013
Journal of
Industrial Mathematics
Hindawi Publishing Corporation http://www.hindawi.com Volume 2013
Journal of
Discrete Mathematics
Journal of
Optimization
Journal of
Game Theory
Hindawi Publishing Corporation http://www.hindawi.com Volume 2013
Geometry
Volume 2013
Hindawi Publishing Corporation http://www.hindawi.com Volume 2013
Volume 2013
Volume 2013
ISRN Combinatorics
Hindawi Publishing Corporation http://www.hindawi.com Volume 2013