MPE Mathematical Problems in Engineering 1563-5147 1024-123X Hindawi Publishing Corporation 434753 10.1155/2013/434753 434753 Research Article Numerical and Analytical Study for Fourth-Order Integro-Differential Equations Using a Pseudospectral Method Sweilam N. H. 1 Khader M. M. 2 Kota W. Y. 3 Ribeiro Pedro 1 Department of Mathematics Faculty of Science Cairo University Giza 12613 Egypt cu.edu.eg 2 Department of Mathematics Faculty of Science Benha University Benha 13511 Egypt bu.edu.eg 3 Department of Mathematics Faculty of Science Mansoura University Damietta 35516 Egypt mans.edu.eg 2013 18 2 2013 2013 16 07 2012 02 12 2012 2013 Copyright © 2013 N. H. Sweilam 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.

A numerical method for solving fourth-order integro-differential equations is presented. This method is based on replacement of the unknown function by a truncated series of well-known shifted Chebyshev expansion of functions. An approximate formula of the integer derivative is introduced. The introduced method converts the proposed equation by means of collocation points to system of algebraic equations with shifted Chebyshev coefficients. Thus, by solving this system of equations, the shifted Chebyshev coefficients are obtained. Special attention is given to study the convergence analysis and derive an upper bound of the error of the presented approximate formula. Numerical results are performed in order to illustrate the usefulness and show the efficiency and the accuracy of the present work.

1. Introduction

The integro-differential equation (IDE) is an equation that involves both integrals and derivatives of an unknown function. Mathematical modeling of real-life problems usually results in functional equations, like ordinary or partial differential equations, and integral and integro-differential equations, stochastic equations. Many mathematical formulations of physical phenomena contain integro-differential equations; these equations arise in many fields like physics, astronomy, potential theory, fluid dynamics, biological models, and chemical kinetics. Integro-differential equations; are usually difficult to solve analytically; so, it is required to obtain an efficient approximate solution . Recently, several numerical methods to solve IDEs have been given such as variational iteration method [6, 7], homotopy perturbation method [8, 9], spline functions expansion [10, 11], and collocation method .

Chebyshev polynomials are well-known family of orthogonal polynomials on the interval [-1,1] that have many applications [4, 6, 8, 13]. They are widely used because of their good properties in the approximation of functions. However, with our best knowledge, very little work was done to adapt these polynomials to the solution of integro-differential equations. Orthogonal polynomials have a great variety and wealth of properties. Some of these properties take a very concise form in the case of the Chebyshev polynomials, making Chebyshev polynomials of leading importance among orthogonal polynomials. The Chebyshev polynomials belong to an exclusive band of orthogonal polynomials, known as Jacobi polynomials, which correspond to weight functions of the form (1-x)α(1+x)β and which are solutions of Sturm-Liouville equations .

In this work, we derive an approximate formula of the integral derivative y(n)(x) and derive an upper bound of the error of this formula, and then we use this formula to solve a class of two-point boundary value problems (BVPs) for the fourth-order integro-differential equations as (1)y(iv)(x)=f(x)+γy(x)+0x[p(t)y(t)+q(t)Θ(y(t))]dt,  0x,t1, under the boundary and initial conditions (2)y(0)=α0,y′′(0)=α1,y(1)=β0,y′′(1)=β1, where f(x),p(x),and  q(x) are known functions and γ,α0,α1,β0, and β1 are suitable constants. Several numerical methods to solve the fourth-order integro-differential equations have been given such as Chebyshev cardinal functions , variational iteration method , and others.

2. Some Basic Properties and Derivation of an Approximate Formula of the Derivative for Chebyshev Polynomials Expansion

The Chebyshev polynomial of the first kind is a polynomial in z of degree n, defined by the relation (3)Tn(z)=cosnθ,when  z=cosθ. The Chebyshev polynomials of degree n>0 of the first kind have precisely n zeros and n+1 local extrema in the interval [-1,1]. The zeros of Tn(z) are denoted by (4)zk=cos(k-1/2)πn,k=1,2,,n. The Chebyshev polynomials can be determined with the aid of the following recurrence formula : (5)Tn+1(z)=2zTn(z)-Tn-1(z),T0(z)=1,T1(z)=z,n=1,2,. The analytic form of the Chebyshev polynomials Tn(z) of degree n is given by (6)Tn(z)=ni=0[n/2](-1)i2n-2i-1  (n-i-1)!(i)!(n-2i)!  zn-2i, where [n/2] denotes the integer part of n/2. The orthogonality condition is (7)-11Ti(z)Tj(z)1-z2dx={π,fori=j=0;π2,fori=j0;0,forij.   In order to use these polynomials on the interval [0,1], we define the so called shifted Chebyshev polynomials by introducing the change of variable z=2x-1. The shifted Chebyshev polynomials are denoted by Tn*(x) and defined as Tn*(x)=Tn(2x-1)=T2n(x).

The function y(x), which belongs to the space of square integrable in [0,1], may be expressed in terms of shifted Chebyshev polynomials as (8)y(x)=i=0ciTi*(x), where the coefficients ci are given by (9)c0=1π01y(x)T0*(x)x-x2  dx,ci=2π01y(x)Ti*(x)x-x2  dx,i=1,2,.

In practice, only the first (m+1) terms of shifted Chebyshev polynomials are considered. Then, we have that (10)ym(x)=i=0mciTi*(x).

Lemma 1.

The analytic form of the shifted Chebyshev polynomials Tn*(x) of degree n is given by (11)Tn*(x)=nk=0n(-1)n-k22k(n+k-1)!(2k)!(n-k)!xk,n=1,2,.

Proof.

Since we have Tn*(x)=T2n(x), then by substituting in (6), we can obtain that (12)Tn*(x)=2ni=0n(-1)i22n-2i-1(2n-i-1)!(i)!(2n-2i)!xn-i,n=1,2,. Now, we put k=n-i in (12) we obtain the desired result (11).

The main approximate formula of the derivative of ym(x), and is given in the following theorem.

Theorem 2.

Let y(x) be approximated by shifted Chebyshev polynomials as (10), and also suppose that r is integer; then, (13)Dr(ym(x))=i=rmk=riciλi,k,rxk-r, where λi,k,r is given by (14)λi,k,r=(-1)i-k22ki(i+k-1)!k!(i-k)!(2k)!(k-r)!.

Proof.

Since the differential operator Dr is linear, we can obtain that (15)Dr(ym(x))=i=0mciDr(Ti*(x)). Since Drc=0,c is a constant, and (16)Drxn={0,fornN,n<r,n!(n-r)!xn-r,fornN,nr. Then, we have that (17)DrTi*(x)=0,i=0,1,,r-1, and for i=r,r+1,,m, and by using (16), we get that (18)DrTi*(x)=ik=ri(-1)i-k22k(i+k-1)!(i-k)!(2k)!Drxk=ik=ri(-1)i-k22k(i+k-1)!k!(i-k)!(2k)!(k-r)!xk-r. A combination of (17), (18), and (14) leads to the desired result and completes the proof of the theorem.

3. Error Analysis

In this section, special attention is given to study the convergence analysis and evaluate the upper bound of the error of the proposed formula.

Theorem 3 (Chebyshev truncation theorem; see [<xref ref-type="bibr" rid="B18">18</xref>]).

The error in approximating y(x) by the sum of its first m terms is bounded by the sum of the absolute values of all the neglected coefficients. If (19)ym(x)=k=0mckTk(x), then (20)ET(m)|y(x)-ym(x)|k=m+1|ck|, for all y(x), all m, and all x[-1,1].

Theorem 4.

The derivative of order r for the shifted Chebyshev polynomials can be expressed in terms of the shifted Chebyshev polynomials themselves in the following form: (21)Dr(Ti*(x))=k=rij=0k-rΘi,j,kTj*(x), where (22)Θi,j,k=(-1)i-k  2i(i+k-1)!Γ(k-r+1/2)hjΓ(k+1/2)(i-k)!(k-r-j)!(k+j-r)!,h0=2,hj=1,j=0,1,.

Proof.

We use the properties of the shifted Chebyshev polynomials  and expand xk-r in (18) in the following form: (23)xk-r=j=0k-rckjTj*(x), where ckj can be obtained using (9), andy(x)=xk-r; then, (24)ckj=2hjπ01xk-rTj*(x)x-x2dx,h0=2,hj=1,j=1,2,.

At j=0,  we  find that   ck0 = (1/π)01(xk-rT0*(x)/x-x2)dx = (1/π)(Γ(k-r+1/2)/(k-r)!); also, at any j and using the formula (10), we can find that (25)ckj=jπl=0j(-1)j-l(j+l-1)!22l+1Γ(k+l-r+1/2)(j-l)!(2l)!(k+l-r)!,j=1,2,3,, employing (18) and (23) gives (26)Dr(Ti*(x))=k=rij=0k-rΘi,j,kTj*(x),i=r,r+1,, where (27)Θi,j,k={i  (-1)i-k(i+k-1)!22kk!Γ(k-r+1/2)(i-k)!(2k)!π  (Γ(k+1-r))2  ,j=0;    (-1)i-kij(i+k-1)!22k+1  k!π(k-r)!(i-k)!(2k)!  ×l=0j(-1)j-l(j+l-1)!22lΓ(k+l-r+1/2)(j-l)!(2l)!(k+l-r)!,j=1,2,3,.After some lengthy manipulation, Θi,j,k can be put in the following form: (28)Θi,j,k=(-1)i-k2i(i+k-1)!Γ(k-r+1/2)hjΓ(k+1/2)(i-k)!(k-r-j)!(k+j-r)!,j=0,1,, and this completes the proof of the theorem.

Theorem 5.

The error |ET(m)|=|Dry(x)-Drym(x)| in approximating Dry(x) by Drym(x) is bounded by (29)|ET(m)||i=m+1ci(k=rij=0k-rΘi,j,k)|.

Proof.

A combination of (8), (10), and (21) leads to (30)|ET(m)|=|Dry(x)-Drym(x)|=|i=m+1ci(k=rij=0k-rΘi,j,kTj*(x))|, but |Tj*(x)|1; so, we can obtain that (31)|ET(m)||i=m+1ci(k=rij=0k-rΘi,j,k)|, and subtracting the truncated series from the infinite series, bounding each term in the difference, and summing the bounds complete the proof of the theorem.

4. Procedure Solution for the Fourth-Order Integro-Differential Equation

In this section, we will present the proposed method to solve numerically the fourth-order integro-differential equation of the form in (1). The unknown function y(x) may be expanded by finite series of shifted Chebyshev polynomials as in the following approximation: (32)ym(x)=n=0mcnTn*(x), and approximated formula of its derivatives can be defined in Theorem 2. From (1), (32), and Theorem 2, we have that (33)i=rm  k=riciλi,k,r  xk-r=f(x)+γn=0mcnTn*(x)+0x[p(t)(n=0mcnTn*(t))+q(t)Θ(n=0mcnTn*(t))]dt. We now collocate (33) at (m-1+r) points xs,s=0,1,,m-r as (34)i=4m  k=4iciλi,k,4  xsk-4=f(xs)+γn=0mcnTn*(xs)+0xs[p(t)(n=0mcnTn*(t))+q(t)Θ(n=0mcnTn*(t))]dt. For suitable collocation points, we use roots of shifted Chebyshev polynomial Tm+1-r*(x). The integral terms in (34) can be found using composite trapezoidal integration technique as (35)0xs[p(t)(n=0mcnTn*(t))+q(t)Θ(n=0mcnTn*(t))]dths2(Ω(t0)+Ω(tL)+2k=1L-1Ω(tk)), where Ω(t)=p(t)n=0mcnTn*(t)+q(t)Θ(n=0mcnTn*(t)),hs=xs/L, for an arbitrary integer L,tj+1=tj+hs,    s=0,1,,m-r,  and  j=0,1,,L. So, by using (34) and (35), we obtain (36)i=4m  k=4iciλi,k,rxsk-r=f(xs)+γn=0mcnTn*(xs)+hs2(Ω(t0)+Ω(tL)+2k=1L-1Ω(tk)). Also, by substituting (32) in the boundary conditions (2), we can obtain r equations as follows: (37)i=0m(-1)ici=α0,i=0mci=β0,i=2mciTi*′′(0)=α1,i=2mciTi*′′(1)=β1. Equation (36), together with r equations of the boundary conditions (37), give (m+1) of system of algebraic equations which can be solved, for the unknowns cn,n=0,1,,m, using conjugate gradient method or Newton iteration method.

5. Numerical Results

In this section, to verify the validity and the accuracy and support our theoretical discussion of the proposed method, we give some computations results of numerical examples.

Example 6.

Consider the nonlinear fourth-order integro-differential equation as in (1) and (2) with f(x)=1,  γ=0,  p(t)=0,  q(t)=e-t,  and  Θ(y)=y2(x); then, the integro-differential equation will be (38)y(iv)(x)=1+0xe-ty2(t)dt,0x1, subject to the boundary conditions (39)y(0)=y′′(0)=1,y(1)=y′′(1)=e. The exact solution of this problem is y(x)=ex .

We apply the suggested method with m=5 and approximate the solution y(x) as follows: (40)y5(x)=n=05cnTn*(x). From (38), (40), and Theorem 2, we have that (41)i=45  k=4iciλi,k,4xk-4=1+0xe-t(n=05cnTn*(t))2dt. We now collocate (41) at points, xs, s=0,1 as (42)i=45  k=4ici  λi,k,4xsk-4=1+0xse-t(n=05cnTn*(t))2dt. For suitable collocation points we use roots of shifted Chebyshev polynomial T2*(x). The integral terms in (42) can be found using composite trapezoidal integration technique as (43)0xse-t(n=05cnTn*(t))2dt=hs2(Ω(t0)+Ω(tL)+2k=1L-1Ω(tk)), where Ω(t)=e-t(n=05cnTn*(t))2,hs=xs/L, for an arbitrary integer L,tj+1=tj+hs,    s=0,1,  and      j=0,1,,L. So, by using (43) and (42), we obtain (44)i=45  k=4ici  λi,k,4  xsk-4=1+hs2(Ω(t0)+Ω(tL)+2k=1L-1Ω(tk)). Also, by substituting (40) in the boundary conditions (39), we can obtain four equations as follows: (45)c0-c1+c2-c3+c4-c5=1,c0+c1+c2+c3+c4+c5=e,l0c0+l1c1+l2c2+l3c3+l4c4+l5c5=1,s0c0+s1c1+s2c2+s3c3+s4c4+s5c5=e, where li=Ti*′′(0) and si=Ti*′′(1).

Equation (44), together with four equations of the boundary conditions (45), represent, a nonlinear system of six algebraic equations in the coefficients cn; by solving it using the Newton iteration method, we obtain (46)c0=1.75379,c1=0.85039,c2=0.10478,c3=0.00872,c4=0.00057,c5=0.00003. The behavior of the approximate solution using the proposed method with m=5, the approximate solution using variational iteration method (VIM), and the exact solution are presented in Figure 1. Table 1 shows the behavior of the absolute error between exact solution and approximate solution using the presented method at m=6 and m=8. From Figure 1 and Table 1, it is clear that the proposed method can be considered as an efficient method to solve the non-linear integro-differential equations. Table 1 indicates that as m increases the errors decrease more rapidly; hence, for better results, using number m is recommended. Also, we can conclude that the obtained approximated solution is in excellent agreement with the exact solution.

The behavior of the absolute error between the exact solution and approximate solution at m=6 and m=8.

x | y ex . - y ap . | at m=6 | y ex . - y ap . | at m=8
0.0 2.2548 e - 10 2.0254 e - 10
0.2 2.3654 e - 04 1.2548 e - 06
0.4 3.5687 e - 04 3.2541 e - 06
0.6 0.1587 e - 04 5.2548 e - 06
0.8 9.2450 e - 04 7.2581 e - 06
1.0 1.2589 e - 10 2.2548 e - 10

The behavior of the exact solution, the approximate solution using VIM, and the approximate solution using the proposed method at m=5.

Example 7.

Consider the linear fourth-order integro-differential equation as in (1) and (2) with f(x)=x+(x+3)ex,  γ=1,  p(t)=-1,  h(t)=0,  and  Θ(y)=y(x); then, the integro-differential equation will be (47)y(iv)(x)=x+(x+3)ex+y(x)-0xy(t)dt,0x1, subject to the boundary conditions (48)y(0)=1,(1)=1+e,y′′(0)=2,y′′(1)=3e. The exact solution of this problem is y(x)=1+xex .

We apply the suggested method with m=5 and approximate the solution y(x) as follows: (49)y(x)n=05cnTn*(x). By the same procedure in the previous example, we have (50)i=45  k=4iciλi,k,4xsk-4=f(xs)+n=05cnTn*(xs)+hs2×(Ω(t0)+Ω(tL)+2k=1L-1Ω(tk)),s=0,1,2, where Ω(t)=n=05cnTn*(t), and the nodes tj+1=tj+hs,  j=0,1,,L, t0=0,  and    hs=xs/L. We can write the initialboundary conditions in the form (51)c0-c1+c2-c3+c4-c5+c6=1,c0+c1+c2+c3+c4+c5+c6=1+e,l0c0+l1c1+l2c2+l3c3+l4c4+l5c5+l6c6=2,s0c0+s1c1+s2c2+s3c3+s4c4+s5c5+s6c6=3e. By using (50) and (51), we obtain a linear system of seven algebraic equations in the coefficients cn; by solving it using the conjugate gradient method, we obtain (52)c0=2.09189,c1=1.32820,          c2=0.26461,c3=0.03079,c4=0.00264,c5=0.00015. The behavior of the approximate solution using the proposed method with m=6, the approximate solution using variational iteration method (VIM) and the exact solution are presented in Figure 2. Table 2 shows the behaviour of the absolute error between exact solution and approximate solution using the presented method at m=7 and m=9. From this figure, it is clear that the proposed method can be considered as an efficient method to solve the linear integro-differential equations. Also, we can conclude that the obtained approximate solution is in excellent agreement with the exact solution.

The behaviour of the absolute error between the exact solution and approximate solution at m=7 and m=9.

x | y ex . - y ap . | at m=7 | y ex . - y ap . | at m=9
0.0 1.2587 e - 08 5.1236 e - 09
0.2 6.2548 e - 03 2.2258 e - 05
0.4 2.0254 e - 03 9.2154 e - 05
0.6 1.3654 e - 03 2.0054 e - 05
0.8 0.2540 e - 03 2.3690 e - 05
1.0 6.0254 e - 08 5.2478 e - 09

The behavior of the exact solution, the approximate solution using VIM, and the approximate solution using the proposed method at m=6.

6. Conclusion and Discussion

Integro-differential equations are usually difficult to solve analytically; so, it is required to obtain the approximate solution. In this paper, we proposed the pseudospectral method using shifted Chebyshev method for solving the integro-differential equations. The Chebyshev method is useful for acquiring both the general solution and particular solution as demonstrated in examples. Special attention is given to study the convergence analysis and derive an upper bound of the error of the derived approximate formula. From our obtained results, we can conclude that the proposed method gives solutions in excellent agreement with the exact solution and better than the other methods. An interesting feature of this method is that when an integral system has linearly independent polynomial solution of degree m or less than m, the method can be used for finding the analytical solution. All computations are done using MATLAB 8.

Agarwal R. P. Boundary value problems for higher order integro-differential equations Nonlinear Analysis: Theory, Methods & Applications 1983 7 3 259 270 10.1016/0362-546X(83)90070-6 MR693443 ZBL0505.45002 Babolian E. Fattahzadeh F. Raboky E. G. A Chebyshev approximation for solving nonlinear integral equations of Hammerstein type Applied Mathematics and Computation 2007 189 1 641 646 10.1016/j.amc.2006.11.181 MR2330241 ZBL1122.65409 Borzabadi A. H. Kamyad A. V. Mehne H. H. A different approach for solving the nonlinear Fredholm integral equations of the second kind Applied Mathematics and Computation 2006 173 2 724 735 10.1016/j.amc.2005.04.008 MR2207090 ZBL1092.65117 Khader M. M. On the numerical solutions for the fractional diffusion equation Communications in Nonlinear Science and Numerical Simulation 2011 16 6 2535 2542 10.1016/j.cnsns.2010.09.007 MR2765206 ZBL1221.65263 Sweilam N. H. Khader M. M. Nagy A. M. Numerical solution of two-sided space-fractional wave equation using finite difference method Journal of Computational and Applied Mathematics 2011 235 8 2832 2841 10.1016/j.cam.2010.12.002 MR2763189 ZBL1209.65089 Khader M. M. Introducing an efficient modification of the variational iteration method by using Chebyshev polynomials Applications and Applied Mathematics 2012 7 1 283 299 MR2945915 ZBL1245.65088 Sweilam N. H. Fourth order integro-differential equations using variational iteration method Computers & Mathematics with Applications 2007 54 7-8 1086 1091 10.1016/j.camwa.2006.12.055 MR2398130 ZBL1141.65399 Khader M. M. Introducing an efficient modification of the homotopy perturbation method by using Chebyshev polynomials Arab Journal of Mathematical Sciences 2012 18 1 61 71 10.1016/j.ajmsc.2011.09.001 MR2872219 ZBL1236.65079 Sweilam N. H. Khader M. M. Al-Bar R. F. Homotopy perturbation method for linear and nonlinear system of fractional integro-differential equations International Journal of Computational Mathematics and Numerical Simulation 2008 1 1 73 87 Khader M. M. Mohamed S. T. Numerical treatment for first order neutral delay differential equations using spline functions Engineering Mathematics Letters 2012 1 1 32 43 Mohamed S. T. Khader M. M. Numerical solutions to the second order Fredholm integro-differential equations using the spline functions expansion Global Journal of Pure and Applied Mathematics 2011 34 21 29 Khader M. M. Hendy A. S. The approximate and exact solutions of the fractional-order delay differential equations using Legendre pseudo-spectral method International Journal of Pure and Applied Mathematics 2012 74 3 287 297 Khader M. M. Sweilam N. H. Mahdy A. M. S. An efficient numerical method for solving the fractional difusion equation Journal of Applied Mathematics and Bioinformatics 2011 1 2 1 12 Sweilam N. H. Khader M. M. Kota W. Y. On the numerical solution of Hammerstein integral equations using Legendre approximation International Journal of Applied Mathematical Research 2012 1 1 65 76 Yousefi S. Razzaghi M. Legendre wavelets method for the nonlinear Volterra-Fredholm integral equations Mathematics and Computers in Simulation 2005 70 1 1 8 10.1016/j.matcom.2005.02.035 MR2165759 ZBL1205.65342 Mason J. C. Handscomb D. C. Chebyshev Polynomials 2003 Washington, DC, USA Chapman & Hall/CRC MR1937591 Lakestani M. Dehghan M. Numerical solution of fourth-order integro-differential equations using Chebyshev cardinal functions International Journal of Computer Mathematics 2010 87 6 1389 1394 10.1080/00207160802322357 MR2665737 ZBL1191.65183 Snyder M. A. Chebyshev Methods in Numerical Approximation 1966 Englewood Cliffs, NJ, USA Prentice-Hall Inc. MR0205429