An-Najah National University Faculty of Graduate Studies Linear Fredholm Integro-Differential Equation of the Second Kind By Khulood Nedal Iseed Thaher Supervised Prof. Naji Qatanani This Thesis is Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science of Mathematics, Faculty of Graduate Studies, An-Najah National University, Nablus, Palestine. 2016 iii Dedication I dedicate this thesis to my beloved Palestine, my parents, my love my husband Ayman, my children Sandra and Kareem, my brother Khaled and my sisters Amany and Farah. Without their patience, understanding, support and most of all love, this work would not have been possible. iv ACKNOWLEDGMENT First of all, I thank my God for all the blessing he bestowed on me and continues to bestow on me. I would sincerely like to thank and deeply greatful to my supervisor Prof. Dr. Naji Qatanani who without his support, kind supervision, helpful suggestions and valuable remarks, my work would have been more difficult. My thanks also to my external examiner Dr. Maher Qarawani and to my internal examiner Dr. Hadi Hamad for their useful and valuable comments. Also, my great thanks are due to my family for their support, encouragement and great efforts for me. Finally, I would also like to acknowledge to all my teachers in An-Najah National University department of mathematics. vi Table of Contents Page Content No. iii Dedication iv Acknowledgement v Declaration viii List of Figures ix List of Tables x Abstract 1 Introduction 3 Chapter One: Mathematical Preliminaries 3 Classification of integro-differential equations 1.1 3 Types of integro-differential equations 1.1.1 5 Linearity of integro-differential equations 1.1.2 5 Homogenity of integro-differential equations 1.1.3 6 Singularity of integro-differential equations 1.1.4 7 Systems of Fredholm integro-differential equations 1.2 8 Systems of Volterra integro-differential equations 1.3 8 Kinds of kernels 1.4 10 Chapter Two: Analytical Methods for Solving Fredholm Integro-Differential Equation 10 Direct computation method 2.1 12 Variational iteration method 2.2 15 Adomian decomposition method 2.3 18 Modified decomposition method 2.4 21 Noise terms phenomenon 2.5 22 Series solution method 2.6 26 Chapter Three: Numerical Methods for Solving Fredholm Integro-Differential Equation 26 B-spline scaling functions and wavelets 3.1 35 Homotopy perturbation method (HPM) 3.2 37 Legendre polynomial method 3.3 47 Taylor collocation method 3.4 55 Chapter Four: Numerical Examples and Results 55 The numerical realization of equation (4.1) using the B-spline scaling functions and wavelets 4.1 vii 59 The numerical realization of equation (4.1) using the Homotopy perturbation method 4.2 61 The numerical realization of equation (4.2) using the B-spline scaling functions and wavelets 4.3 63 The numerical realization of equation (4.2) using the Homotopy perturbation method 4.4 66 The numerical realization of equation (4.3) using the Legendre polynomial method 4.5 72 The numerical realization of equation (4.3) using the Taylor collocation method 4.6 79 Conclusions 80 References 86 Appendix 86 Maple code for B-spline scaling functions and wavelets for example 4.1 93 Maple code for Homotopy perturbation method for example 4.1 94 Maple code for B-spline scaling functions and wavelets method for example 4.2 101 Maple code for Homotopy perturbation method for example 4.2 103 Matlab code for Legendre polynomial method 110 Matlab code for Taylor collocation method الملخص ب viii List of Figures Page Title No. 58 The exact and numerical solutions of applying Algorithm 4.1 for equation (4.1). 4.1 58 The error resulting of applying algorithm 4.1 on equation (4.1). 4.2 60 The exact and numerical solutions of applying Algorithm 4.2 for equation (4.1). 4.3 61 The error resulting of applying algorithm 4.2 on equation (4.1). 4.4 62 The exact and numerical solutions of applying Algorithm 4.1for equation (4.2). 4.5 63 The error resulting of applying algorithm 4.1 on equation (4.2) 4.6 65 The exact and numerical solutions of applying Algorithm 4.2 for equation (4.2). 4.7 65 The error resulting of applying algorithm 4.2 on equation (4.2) 4.8 71 The exact and numerical solutions of applying Algorithm 4.3 for equation (4.3). 4.9 71 the error resulting of applying algorithm 4.3 on equation (4.2). 4.10 78 The exact and numerical solutions of applying Algorithm 4.4 for equation (4.3). 4.11 78 the error resulting of applying algorithm 4.4 on equation (4.3). 4.12 ix List of Tables Page Title No. 57 The exact and numerical solutions of applying Algorithm 4.1 for equation (4.1). 4.1 60 The exact and numerical solutions of applying Algorithm 4.2 for equation (4.1). 4.2 62 The exact and numerical solutions of applying Algorithm 4.1 for equation (4.2). 4.3 64 The exact and numerical solutions of applying Algorithm 4.2 for equation (4.2). 4.4 70 The exact and numerical solutions of applying Algorithm 4.3 for equation (4.3). 4.5 77 The exact and numerical solutions of applying Algorithm 4.4 for equation (4.3). 4.6 x Linear Fredholm Integro-Differential Equation of the Second Kind By Khulood Nedal Iseed Thaher Supervisor Prof. Naji Qatanani Abstract In this thesis we focus on solving linear Fredholm integro-differential equation of the second kind due to it's wide range of physical applica- tions. We will investigate some analytical and numerical methods to solve this equation. The discussed analytical methods include: Direct computation method, variational iteration method, Adomian decompos- ition method, modified decomposition method, noise terms phenomenon and series solution method. The numerical methods that will be presented here are: B-spline scaling function and wavelet method, Homotopy perturbation method, Legendre polynomial method and Taylor collocation method. Particular numerical examples demonstrating these numerical methods have been implement- ed for solving linear Fredholm integro-differential of the second kind. A comparison has been drawn between these numerical methods. Our numerical results show that the Homotopy perturbation method and Legendre polynomial method have proved to be the most efficient in comparison to the other numerical methods regarding their performance on the used examples. 1 Introduction The subject of integro-differential equations is one of the most important mathematical tools in both pure and applied mathematics. Integro- differential equations play a very important role in modern science and technology such as heat transfer, diffusion processes, neutron diffusion and biological species. More details about the sources where these equations a rise can be found in physics, biology and engineering applications as well as in advanced integral equations books. (see [2, 4, 5, 8, 18, 19, 20, 22]). Some valid numerical methods, for solving Fredholm integro-differential equations have been developed by many researchers. In [7] Behiry and Hashish used wavelet methods for the numerical solution of Fredholm integro-differential equation. Lakestani, Razzaghi and Dehghan [25] applied linear semiorthogonal B-spline wavelets, specially constructed for the bounded interval to solve linear Fredholm integro-differential equation. In [16] Ji-Huan He solved linear Fredholm integro-differential equation by a Homotopy perturbation method. This method yields a very rapid convergence of the solution series in most cases, usually only few iterations leading to very accurate solutions. A Legendre collocation matrix method is presented to solve high-order linear Fredholm integro-differential equations under the mixed conditions in terms of Legendre polynomials were used in [42] by Yalcinbas, Sezer and Sorkan. In [23] Karamete and Sezer solved Fredholm integro-differential equation by a truncated Taylor series. Using the Taylor collocation points, this method transforms the 2 integro-differential equation to a matrix equation which corresponds to a system of linear algebraic equations with unknown Taylor coefficients. However many approaches for solving the linear and nonlinear kind of these equations may be found in [10], [11], [13], [14], [15], [29], [30], [32], [36], [39] and [43]. In this work, some analytical methods have been used to solve the Fredholm integro-differential equation of the second kind. These methods are: direct computation method, variational iteration method, Adomian decomposition method, modified decomposition method, noise terms phenomenon and series solution method. For the numerical treatment of the Fredholm integro-differential equation of the second kind, we have implemented the following methods: B-spline scaling functions and wavelets, Homotopy perturbation method, Legendre polynomial method and Taylor collocation method. This thesis is organized as follow: In chapter one, we introduce some basic concepts of integro-differential equations. In chapter two, we investigate some analytical methods to solve the Fredholm integro-differential equation. These have been mentioned before. In chapter three, we implement some numerical methods for solving Fredholm integro- differential equation. These have mentioned before. Numerical examples and results are presented in chapter four and conclusions have been drawn. 3 Chapter One Mathematical Preliminaries Definition 1.1 [39] An integro-differential equation is the equation in which the unknown function appears inside an integral sign and contains ordinary derivatives. A standard integro-differential equation is of the form: ( ) ( ) ( ) ( ) ( ) ( , ) h x n g x v x f x G x y   ( )v y ,dy (1.1) where ( )( ) n n n d v v x dx  , n integer,  is a constant, ( )g x and ( )h x are limits of integration that may be both variables, constants, or mixed, ( , )G x y is a known function of two variables x and y called the kernel or the nucleus of the integro-differential equation. The function v that will be determined appears under the integral sign, and sometimes outside the integral sign. The function ( )f x and ( , )G x y are given . 1.1 Classification of Integro-Differential Equations 1.1.1 Types of integro-differential equations There are three types of integro-differential equations: 4 1. Fredholm integro- differential equation The Fredholm integro-differential equation of the second kind appears in the form: ( )( ) ( ) ( , ) b n a v x f x G x y   ( )v y .dy (1.2) 2. Volterra integro-differential equation The Volterra integro-differential equation of the second kind appears in the form: ( )( ) ( ) ( , ) x n a v x f x G x y   ( )v y ,dy (1.3) where the upper limit of integration is variable. 3. Volterra-Fredholm integro-differential equation The Volterra-Fredholm integro-differential equation of the second kind appear in two forms, namely: ( ) 1 1( ) ( ) ( , ) x n a v x f x G x y   ( )v y 2 2( , ) b a dy G x y  ( )v y dy (1.4) and ( ) 0 ( , ) ( , ) ( , , , , ( , )) y nv x y f x y F x y v          d d , , [0, ]x y Y (1.5) 5 where ( , )f x y and ( , , , , ( , ))F x y v    are analytic functions, D  [0, ]Y and  is a closed subset of ,nR 1,2,3.n  It is interesting to note that (1.4) contains disjoint Volterra and Fredholm integrals, whereas (1.5) contains mixed integrals. Other derivatives of less order may appear as well. 1.1.2 Linearity of integro-differential equation Definition 1.2 [39] The integro- differential equation ( ) ( ) ( ) ( ) ( ) ( , ) h x n g x v x f x G x y   ( )v y ,dy is said to be linear if the exponent of the unknown function ( )v x under the integral sign is one and the equation does not contain nonlinear functions of ( )v x , otherwise, the equation is called nonlinear. 1.1.3 Homogeneity of integro-differential equation Definition 1.3 [39] The integro-differential equation ( ) ( ) ( ) ( ) ( ) ( , ) h x n g x v x f x G x y   ( )v y ,dy is said to be homogeneous if ( )f x is identically zero, otherwise it is called nonhomogeneous. 6 1.1.4 Singularity of integro-differential equation When one or both limits of integration become infinite or when the kernel becomes infinite at one or more points within the range of integration. For example, the integro-differential equation. dy ( )v y ( )( ) ( ) ( , )nv x f x G x y      is a singular integro-differential equation of the second kind. (i) Singular integro-differential equation If the kernel is of the form ( , ) ( , ) H x y G x y x y   (1.6) where ( , )H x y is differentiable function a x b  , a y b  with ( , ) 0H x y  , then the integro-differential equation is said to be a singular equation with Cauchy kernel where the ( , ) ( , ) b a H x y G x y x y   ( )f y dy is understood in the sence of Cauchy Principal value (CPV) and the notation P.V ( , ) b a H x y dy x y is usually used to denote this. Thus P.V. ( , ) ( , ) ( , ) lim , b x b x a a x H x y H x y H x y dy dy dy x y x y x y                      for example 7 1 2 4 5 1 2 1 2 ( ) ( ) 7 ln , 3 1 5 x v y v x x x x dy x x y               1.x  (ii) Weakly singular integro-differential equation The kernel is of the form ( , ) ( , ) H x y G x y x y    (1.7) where ( , )H x y is bounded . .i e several times continuously differentiable a x b  and a y b  with ( , ) 0H x y  and  is a constant such that 0 1.  For example, the equation ( ) 0 1 ( ) x nv x x y     ( )v y ,dy 0 1  is a singular integro-differential equation with a weakly singular kernel. 1.2 Systems of Fredholm Integro-Differential Equations A system of Fredholm integro-differential equations of the second kind can be written as: ( ) 1 1( ) ( ) ( ( , ) b i a u x f x G x y   1( ) ( , )u y G x y ( ))v y dy (1.8) ( ) 2 2( ) ( ) ( ( , ) b i a v x f x G x y   2( ) ( , )u y G x y ( ))v y .dy The unknown functions ( )u x and ( ),v x that will be determined, occur inside the integral sign whereas their derivatives appear mostly outside the 8 integral sign. The kernels ( , )iG x y , ( , )iG x y and the functions ( )if x are given as real-valued functions [39]. 1.3 Systems of Volterra Integro-Differential Equations A system of Volterra integro-differential equation of the second kind has the form: ( ) 1 1 0 ( ) ( ) ( ( , ) x iu x f x G x y   1( ) ( , )u y G x y ( ))v y dy (1.9) ( ) 2 2 0 ( ) ( ) ( ( , ) x iv x f x G x y   2( ) ( , )u y G x y ( ))v y .dy The unknown functions ( )u x and ( )v x that will be determined, occur inside the integral sign whereas their derivatives appear mostly outside the integral sign. The kernels ( , )iG x y , ( , )iG x y and the functions ( )if x are given as real-valued functions [39]. 1.4 Kinds of Kernels 1. Separable kernel A kernel ( , )G x y is said to be separable or (degenerate) if it can be exp- ressed in the form )1.10) 1 ( , ) ( ) ( ), n k k k G x y g x h y   9 where the functions ( )kg x and the functions ( )kh y are linearly indepe- ndent. (see [39]). 2. Symmetric (or Hermitian) kernel A complex-valued function ( , )G x y is called symmetric (or Hermitian) if *( , ) ( , ),G x y G x y (1. 11) where the asterisk denotes the complex conjugate. For a real kernel, we have ( , ) ( , ).G x y G y x (1.12) 10 Chapter Two Analytical Methods for Solving Fredholm Integro-Differential Equation of the Second Kind There are many analytical methods for solving Fredholm integro- differential equation of the second kind. In this chapter we will focus on the following methods: direct computation method, variational iteration method, Adomian decomposition method, modified decomposition method, noise terms phenomenon and series solution method. 2.1 Direct Computation Method This method can be used to solve the Fredholm integro-differential equation of the second kind directly instead of a series form. For the application of this method we consider the separable kernel of the form ( ,G x ) ( )y g x ( ),h y (2.1) We consider the Fredholm integro-differential equation of the general form ( )( ) ( ) ( , ) b n a v x f x G x y   ( )v y ,dy (2.2) with the initial conditions ( ) (0)k kv b , 0 1.k n   Substituting (2.1) into (2.2) gives ( )( ) ( ) ( ) ( ) b n a v x f x g x h y   ( )v y .dy (2.3) 11 Since the integral in equation (2.3) is a bounded integral and dependent only on one variable ,y then we can assign this integral by a constant , That is ( ) b a h y ( )v y .dy  (2.4) Thus equation (2.3) becomes ( ) ( ) ( ) ( ).nv x f x g x  (2.5) Integrating both sides of (2.5) n times from 0 to ,x also using the initial conditions, we can find formula for ( )v x that depends on  and .x This means we can write ( ) ( , ).v x u x  (2.6) Substituting (2.6) into the right side of (2.4), calculating the integral, also solving the resulting equation, we determine . We obtain the exact solution ( )v x after substituting  into (2.6). Example 2.1 Consider the Fredholm integro-differential equation 1 0 ( ) 12 ( )v x x v y    dy with (0) 0.v  (2.7) This equation may be written as ( ) 12v x x    , (0) 0.v  (2.8) 12 obtained by setting 1 0 ( )v y dy  . (2.9) Integrating both sides of (2.8) from 0 to ,x and by using the initial condition we obtain 2( ) 6 .v x x x  (2.10) Substituting (2.10) into (2.9) and evaluating the integral yield 1 0 ( )v y   dy 1 2 2   (2.11) hence we find 4.  (2.12) The exact solution is given by 2( ) 6 4 .v x x x  (2.13) 2.2 Variational Iteration Method (VIM) The variational iteration method (VIM) was established by Ji-Huan He [17]. The method provides rapidly convergent successive approximations of the exact solution only if such a closed form solution exists. We consider the Fredholm integro-differential equation of the general form 13 ( ) ( ) ( ) ( , ) b i a v x f x G x y   ( )v y .dy (2.14) The correction functional for this equation is given by 1 0 ( ) ( ) ( ) x n nv x v x      ( )[ ( ) ( ) ( , ) b i n a v f G z     ( )nv z ]dz .d (2.15) The variational iteration method needs to determine the Lagrange multiplier ( )  via integration by parts and by using a restricted variation. The variational iteration formula, without restricted variation, should be used for the determination of the successive approximations 1( ),nv x 0n  of the solution ( ).v x The zeroth approximation 0v can be any selective function. However, using the given initial values (0),v (0),v  are preferably used for the selective zeroth approximation 0.v Consequently, the solution is given by ( ) lim ( ).n n v x v x   (2.16) Example 2.2 Consider the Fredholm integro-differential equation 1 0 ( ) 12 ( )v x x v y    dy with (0) 0.v  (2.17) The correction functional for this equation is given by 1 1 0 0 ( ) ( ) [ ( ) 12 ( ) x n n n nv x v x v v z       ]dz ,d (2.18) 14 as 1   for first-order Fredholm integro-differential equation. This gives: 0 ( ) 0v x  1 1 0 0 0 0 0 ( ) ( ) [ ( ) 12 ( ) x v x v x v v z      ]dz d 26x 1 2 1 1 1 0 0 ( ) ( ) [ ( ) 12 ( ) x v x v x v v z      ]dz d 26 2x x  1 3 2 2 2 0 0 ( ) ( ) [ ( ) 12 ( ) x v x v x v v z      ]dz d 26 2x x x   (2.19) 1 4 3 3 3 0 0 ( ) ( ) [ ( ) 12 ( ) x v x v x v v z      ]dz d 2 1 6 2 2 x x x x    1 5 4 4 4 0 0 ( ) ( ) [ ( ) 12 ( ) x v x v x v v z      ]dz d 2 1 1 6 2 2 4 x x x x x     1 1 1 1 0 0 ( ) ( ) [ ( ) 12 ( ) x n n n nv x v x v v z         ]dz d 2 1 1 1 6 3 ( ) 2 4 8 x x x      and so on. The VIM admits the use of ( ) lim ( ).n n v x v x   (2.20) We obtain the exact solution 2( ) 6 4 .v x x x  (2.21) 15 2.3 Adomian Decomposition Method The Adomian decomposition method (ADM) was introduced and develo- ped by George Adomian [1-3]. ADM gives the solution in an infinite series of components. The idea of Adomian decomposition method is transforming Fredholm integro-differential equation to an integral equation. We consider the second order Fredholm integro-differential equation of the second kind of the form . ( ) ( ) ( , ) b a v x f x G x y    ( )v y ,dy (2.22) with the initial conditions 0(0)v b , 1(0) .v b  Integrating both sides of (2.22) from 0 to x twice, we get 1 1 0 1( ) ( ( )) ( ( , ) b a v x b b x L f x L G x y      ( )v y )dy (2.23) where the initial conditions are used, and 1L is a two-fold integral operator. ( )v x expressed as 0 ( ) ( ).n n v x v x    (2.24) Setting (2.24) into (2.23) gives: 1 1 0 1 0 00 ( ) ( ( )) ( , ) ( ) x n n n n v x b b x L f x L G x y v y dy                    (2.25) 16 or equivalently, 1 0 1 2 0 1( ) ( ) ( ) ( ) ( ( ))v x v x v x b b x L f x      1 0 ( ( , ) x L G x y  0( )v y )dy 1 0 ( ( , ) x L G x y  1( )v y )dy 1 0 ( ( , ) x L G x y  2( )v y )dy  (2.26) Note that, 0 ( )v x is defined by all the terms that are not included under the integral sign, that is 1 0 0 1( ) ( ) ( ( ))v x b b x L f x   1 1 0 ( ) ( ( , ) x kv x L G x y    ( )kv y ),dy 0.k  (2.27) Using (2.24), the obtained series converges to the exact solution if such a solution exists, see ([12], [39]). Example 2.3 Consider the Fredholm integro-differential equation 1 0 ( ) 1 24 ( )v x x v y      dy with (0) 0.v  (2.28) Note that, the integral at the right side is equivalent to a constant. Integrating both sides of Eq. (2.28) from 0 to x , we get 17 1 2 0 ( ) (0) 12 ( )v x v x x x v y dy              (2.29) using the initial condition 1 2 0 ( ) 12 ( ) .v x x x x v y dy             (2.30) Let 0 ( ) ( )n n v x v x    . (2.31) Setting (2.31) into (2.30) gives 1 2 0 0 ( ) 12 ( ) .n n n v x x x x v y dy                (2.32) The components ,jv 0j  of ( )v x can be determined by using the recu- rrence relation 2 0( ) 12v x x x   , 1 1 0 ( ) ( ) ,k kv x x v y dy          0.k  (2.33) This gives 2 0( ) 12v x x x   , 1 1 0 0 7 ( ) ( ) 2 v x x v y dy x           , 1 2 1 0 7 ( ) ( ) 4 v x x v y dy x           , 1 3 2 0 7 ( ) ( ) 8 v x x v y dy x           (2.34) Hence, the solution is 18 2 7 1 1 ( ) 12 (1 ), 2 2 4 v x x x x       (2.35) which gives the exact solution 2( ) 6 12 .v x x x  (2.36) 2.4 Modified Decomposition Method As shown before, The Adomian decomposition method provides the solu- tion in an infinite series of components. The method substitutes the decomposition series of ( ),v x given by 0 ( ) ( ).n n v x v x    (2.37) The process of converting Fredholm integro-differential equation to an integral equation can be achieved by integrating both sides of the Fredholm integro-differential equation from 0 to x as many times is needed to convert it into the integral equation ( ) ( ) ( , ) b a v x f x G x y   ( )v y .dy (2.38) The standard Adomian decomposition method introduces the recurrence relation 0( ) ( )v x f x (2.39) 1( ) ( , ) b k a v x G x y   ( )kv y ,dy 0.k  19 The modified decomposition method presents a slight variation to the recurrence relation (2.38) to determine the components of ( )v x in an easier and faster manner. For many cases, the function ( )f x can be set as the sum of two partial functions, namely 1( )f x and 2 ( ).f x In other words 1 2( ) ( ) ( ).f x f x f x  (2.40) The modified decomposition method admits the use of the modified recurrence relation 0 1( ) ( )v x f x 1 2( ) ( ) ( , ) b a v x f x G x y   0( )v y dy (2.41) 1( ) ( , ) b k a v x G x y   ( )kv y dy , 1.k  The difference between the recurrence relation (2.39) and the modified recurrence relation (2.41) is in the formation of 0 ( )v x and 1( )v x only. The other components ( )jv x , 2j  remain the same in the two recurrence relations [39]. Example 2.4 Consider the Fredholm integro-differential equation 2 0 ( ) sin( )v x x x x y        ( )v y dy with (0) 0,v  (0) 1.v   (2.42) 20 Using the modified decomposition method. First, integrate both sides of (2.42) from 0 to x twice, and using the given conditions, we obtain the Fredholm integral equation 2 3 3 0 1 1 ( ) sin( ) 3! 3! v x x x x y      ( )v y .dy (2.43) 31 ( ) sin( ) 3! f x x x  (2.44) We split ( )f x into two parts, namely 1( ) sin( )f x x 3 2 1 ( ) , 3! f x x  (2.45) 1( )f x related to the zeroth component, 0( ),v x and add 2 ( )f x to the component 1( ).v x Therefore, we obtain the modified recurrence relation 0( ) sin( )v x x 2 3 3 1 0 1 1 ( ) 3! 3! v x x x y     0( )v y 0,dy  (2.46) all remaining components 2 3( ), ( ),v x v x are zeros. This gives the exact solution as ( ) sin( )v x x (2.47) 21 2.5 The Noise Terms Phenomenon The idea behind solving equations with noise terms if the noise terms appear between components of ( ),v x then the exact solution can be obtained by considering only the first two components 0 ( )v x and 1( ).v x The noise terms are defined as the identical terms, with opposite signs, that may appear between the components of the solution ( ).v x The conclusion made by [1], [3], and [41] suggests that if we observe the appearance of identical terms in both components with opposite signs, then by canceling these terms, the remaining non-canceled terms of 0v may in some cases provide the exact solution, that should be justified through substitution. It was formally proved that other terms in other components will vanish in the limit if the noise terms occurred in 0 ( )v x and 1( ).v x Example 2.5 Consider the Fredholm integro-differential equation 1 0 1 ( ) 1 3 v x x xy     ( )v y dy with (0) 0.v  (2.48) Using the noise terms phenomenon. By integrating both sides of the equation (2.48) from 0 to x gives 1 2 2 0 1 1 ( ) (0) 6 2 v x v x x x y     ( )v y dy , (0) 0.v  (2.49) by using the initial condition 22 1 2 2 0 1 1 ( ) 6 2 v x x x x y    ( )v y dy . (2.50) Let 0 ( ) ( ).n n v x v x    (2.51) Substituting (2.51) into both sides of (2.50) yields 1 2 2 0 00 1 1 ( ) ( ( )) . 6 2 n n n n v x x x x y v y dy         (2.52) or equivalently 2 0 2 1 1 ( ) 6 7 ( ) . 48 v x x x v x x    (2.53) Notice that 1( )v x can be written as 2 2 1 1 1 ( ) . 6 48 v x x x  (2.54) The noise terms 21 6 x appear between the components 0 ( )v x and 1( ).v x By canceling the noise term form 0( ),v x we obtain the exact solution ( ) .v x x (2.55) 2.6 The Series Solution Method The series method is useful method that stems mainly form the Taylor series for analytic functions for Fredholm integro-differential equation. 23 Definition 2.1 [39] A real function ( )v x has the Taylor series representation ( ) 0 ( ) ( ) ( ) , ! n k k k v b v x x b k    (2.56) is called analytic if it has derivatives of all orders such that the Taylor series at any point b in it is domain converges to ( )v x in a neighborhood of .b For simplicity, the generic form of the Taylor series at 0b  is given as 0 ( ) .n n n v x a x    (2.57) We will assume that the Fredholm integro-differential equation of the second kind ( )( ) ( ) ( , ) b k a v x f x G x y   ( )v y ,dy (0) ,j jv a 0 ( 1)j k   (2.58) is analytic, and therefore possesses a Taylor series of the form given in (2.57), where the coefficients na will be determined recurrently. Setting (2.57) into (2.58) yields ( ) 0 ( ( )) ( , ) k b n n n a a x T f x G x y              0 ,n n n a y dy            (2.59) This is equivalent to 24 2 ( ) 0 1 2( ) ( ( )) ( , ) b k a a a x a x T f x G x y      2 0 1 2( )a a y a y dy   (2.60) where ( ( ))T f x is the Taylor series for ( ).f x After performing integration in the right hand side of (2.60), we compare coefficients of power of x on both sides. Example 2.6 Consider the Fredholm integro-differential equation of the second kind 1 1 ( ) 4 ( )v x x x y      ( )v y dy with (0) 2,v  (2.61) using the series method. Let 0 ( ) ( ) .n n n v x a x      (2.62) Inserting (2.62) into (2.61), yields 1 1 0 1 4 (( )n n n na x x x y         0 ) .n n n a y dy    (2.63) 0 2a  from the given initial conditions. Evaluating the integral at the right side gives 25 2 1 2 3 1 3 5 7 0 2 4 6 2 3 2 2 2 2 2 2 2 (4 2 ) . 3 5 7 9 3 5 7 a a x a x a a a a a a a a x                (2.64) Comparing coefficients of like powers of x in both sides of (2.64) gives 1 0,a  2 6,a  0na  , 2.n  (2.65) The exact solution is given by 2( ) 2 6 .v x x  (2.66) where we used 0 2a  from the initial condition. 26 Chapter Three Numerical Methods for Solving Fredholm Integro-Differential Equation of the Second Kind There are many numerical methods available for solving Fredholm integro- differential equation of the second kind . In this chapter we will discuss the following methods: B-spline scaling functions and wavelets, Homotopy perturbation method, Legendre polynomial method and Taylor collocation method. . 3.1 B-Spline Scaling Functions and Wavelets on [0,1] B-spline scaling functions and wavelets which are presented to approximate the solution of linear second order Fredholm integro- differential equation [6], [7] and [9]. Their properties and the operational matrices of derivative for these functions are presented to reduce the solution of linear Fredholm integro-differential equations to a solution of algebraic equations. Consider the linear second-order Fredholm integro-differential equation of the form: 12 ( ) 0 0 ( ) ( ) ( ) ( , )i i i x y x f x K x t     ( )y t ,dt 0 1x  ( 3.1) with (3.2) 1(1)y y, 0(0)y y 27 where i ( 0,1,2),i  ,f and ,K are given functions in 2[0,1],L 0y and 1y are given real numbers and y is the unknown function to be found. The second-order B-splines scaling functions are defined as: , , ( ) 2 ( ), 0, i i j i x j x x j        1 1 2, 0, ,2 2 i i i j x j j x j j otherwise          (3.4) with the respective left- and right-hand side boundary scaling functions , 2 ( ), ( ) 0, i i j x j x      0 1, 1ix j otherwise     )3.5) , , ( ) 0, i i j x j x     1, 2 1i ij x j j otherwise      )3.6) the actual coordinate position x is related to ix according to 2 .i ix x The second-order B-spline wavelets are given by 3.7) ) 1 2 1 2 1 1 3 2 3 2 2 2 5 2 5 2 3 i i i i i i j x j j x j j x j j x j j x j j x j otherwise                        , , 4 7( ), 19 16( ), 1 ( ) 29 16( ), 6 17 7( ), 3 ( ), 0, i i i i j i i i x j x j x j x x j x j x j                      with the respective left- and right-hand side boundary wavelets: 28 , 6 23 , 14 17 , 1 ( ) 10 7 , 6 2 , 0, i i i j i i x x x x x               0 1 2 1 2 1 1 3 2 3 2 2, 1 i i i i x x x j x j otherwise            (3.8) , 2 ( 2 ), 10 7( 2 ), 1 ( ) 14 17( 2 ), 6 6 23( 2 ), 0, i i i j i i j x j x x j x j x                      1 2 1 2 1 1 3 2, 2 2 3 2 2 . i i i i i j x j j x j j x j j j x j otherwise                  (3.9) From (3.4)-(3.9), we get more clear description for these two sets of equations 2,3,i  , 1,2 1,2 1 1,2 2 1 1 ( ) ( ) ( ) ( ), 2 2 i j i j i j i jx x x x          0,1,2, ,2 2jj   , 1 1, 1 1,0 1 1 ( ) ( ) ( ), 2 2 i i ix x x       2,3,i  (3.10) 1 1,2 1 1,2 1 1,2 1 ( ) ( ) ( ), 2 i i ii i i x x x         2,3,i  and , 1,2 1,2 1 1,2 2 1 1 5 ( ) ( ) ( ) ( ) 12 2 6 i j i j i j i jx x x x          1,2 3 1,2 4 1 1 ( ) ( ) 2 12 i j i jx x      , 2,3,i  , 0,1,2, ,2 2jj   29 , 1 1, 1 1,0 1,1 1,2 11 1 1 ( ) ( ) ( ) ( ) ( ), 12 2 12 i i i i ix x x x x              1 1 1 1,2 1 1,2 2 1,2 3 1,2 4 1,2 5 11 1 1 ( ) ( ) ( ) ( ) ( ). 12 2 12 i i i i ii i i i i x x x x x                     3.11) ) We define 1 1 1, 1, 1 1,0 1,2 1 ( )( 1,...,2 1) , , , M T M M k M M M x k                    (3.12) let 3.13) ) 1 1 1 1 0 .T M M MQ dx     The entry 1( )M ijQ  of the matrix 1MQ  in (3.13) is calculated from 3.14) ) 1 1, 1, 0 ( ) ( )M i M jx x dx   using (3.4)-(3.6), (3.12) and (3.14) , we get a symmetric 1(2 1)M    1(2 1)M   matrix for 1MQ  which is given by: 1 1 1 1 0 0 12 24 1 1 1 0 24 6 24 1 . 2 1 1 1 0 24 6 24 1 1 0 0 24 12 M M Q                            (3.15) 30 Finally, we want to define a vector M of order ( 1)(2 1) 1M    as: 2, 1 2,0 2,3 2, 1 2,2 3, 1 3,6 , 1 ,2 2 [ , ,..., , ,..., , ,..., ,..., ,..., ] .M T M M                3.16)) The operational matrix of derivative The differentiation of the vector 1M  and  in (3.16) can be express- ed as: (3.17) D    , 1 1M MD      where D and D are 1 1(2 2) (2 2)M M    operational matrices of derivative of B-spline scaling functions and wavelets respectively. The matrix D     1 1 1 1 1 1 1 1 1 1 0 0 ( ) ( ) ( ) ( )T T M M M M M MD t t dt t t dt Q R Q                           (3.18) where 3.19) ) 1 1 1 0 ( ) ( ) .T M MR t t dt     In (3.19), R is 1 1(2 1) (2 1)M M    matrix given by 31 1 1 1 1 1 1, 2 1, 2 1, 2 1,2 1 0 0 1 1 1, 21,2 1 1,2 1 1,2 1 0 0 ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) M M M M M M M M MM M M t t dt t t dt R t t dt t t dt                                                    3.20) ) since the elements in the vector given in (3.12) are nonzero between 1/ 2Mk  and 1( 2) / 2 ,Mk  then for any entries of , ,j kR we have 3.21)) . 1 1 1 1 1 1 1 1 ( 2) 21 , 1, 1, 1, 1, 0 2 ( 1) 2 ( 2) 2 1, 1, 1, 1, 2 ( 1) 2 ( 1) 2 1 1 1, 1, 2 ( 1) 2 ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) 2 ( ) 2 ( ) M M M M M M M M M k j k M j M k M j M k k k k M j M k M j M k k k k M M M k M k k k R t t dt t t dt t t dt t t dt t dt t dt                                                    1 1 ( 2) 2Mk                From (3.21), we get 1 1 2 2 1 1 0 2 2 . 1 1 0 2 2 1 1 2 2 R                            (3.22) 32 The matrix MD can be obtained by considering 3.23) ) 1M XMG  where G is a 1 1(2 1) (2 1)M M    matrix, which can be calculated as follows. Let  and  be defined as: 3.24) ), 1 ,0 ,2 1 , , , ,jj j j          (3.25) , 1 ,0 ,2 1 , , , .jj j j          , we get Using (3.10) and (3.24) 1j j j    (3.26) with (3.27) 1 1 2 1 1 1 2 2 1 1 1 2 2 1 1 1 2 2 1 1 2 j                                where ( 2,3, ),j j  is 1(2 1) (2 1)j j    matrix. From (3.11) and (3.25), we have 1j j j    (3.28) with j 33 11 1 1 1 12 2 12 1 1 5 1 1 12 2 6 2 12 1 1 5 1 1 12 2 6 2 12 1 1 5 1 1 12 2 6 2 12 1 1 5 1 1 12 2 6 2 12 1 1 5 1 1 12 2 6 2 12 1 1 11 1 12 2 12                                                 3.29)) where ( 2,3, ),j j  is 12 (2 1)j j   matrix. From (3.26) and (3.28), we get 1 1 1 1 ... , . j j j M M j j j M M                       (3.30) Using (3.24) and (3.16), we have 3.31)) . 2 3 2 3 2 1 1 . M M M M M M M M G                                                                                  From (3.17),(3.18), and (3.31), we get 34 3.32)) 1 1 1 1 1 1 1 1 M( ) ( ) ,M M M M MG GD GR Q GR Q G D                     where (3.33) 1 1 1( ) .MD GR Q G    we want to explain the technique. We solve linear Fredholm integro- differential equation by using B-spline wavelets. For this purpose we write (3.1) as 3.34) )0 1,x  2 ( ) 0 ( ) ( ) ( ) ( )i i i x y x f x z x    where 1 0 ( ) ( , ) ( ) .z x K x t y t dt  (3.35) We define ( ) ( )Ty x C x  (3.36) 1 0 ( ) ( , )z x K x t  TC ( )t ,dt (3.37) where ( )x is defined in (3.16 ), and C is 1(2 1) 1M    unknown vector defined as 1 0 3 2, 1 2,2 3,1 3,6 , 1 ,2 2 , ,..., , ,..., , ,..., ,..., ,..., M T M M c c c d d d d d d        We can approximate (3.37), using Newton-Cotes techniques as 1 0 ( ) ( , )z x K x t  TC ( )t 1 ( , ) n i i i dt w K x t   TC ( )it ( , ),F x C (3.38) 35 where iw and it are weight and nodes of Newton-Cotes integration techniques respectively. Using (3.32) and (3.36), we get (3.39) . ( ) ( ) ( ), ( ) ( ), T T T y x C x C D x y x C D x           From (3.30), (3.34), and (3.35), we get 2 0 1 2( ) ( ) ( ) ( ) ( ) ( ) ( ) ( , ).T T w wx C x x C D x x D x f x F x C         3.40)) Also, using (3.2) and (3.36), we have 3.41) )   1.1TC y    0,0TC y  To find the solution ( ),y x we first collocate (3.40) in 2(2 1) (2 2),M ix i    11,2, ,2 1,Mi   the resulting equation gener- rates 12 1M   linear equations which can be solved using Newton's iterative method. The initial values required to start Newton's method have been chosen by taking ( )y x as linear function between 0(0)y y and 1(1)y y . The total unknown for vector C is 12 1M   . These can be obtained by using (3.40) and (3.41). 3.2 Homotopy Perturbation Method (HPM) The Homotopy perturbation method was introduced and developed by Jihvan He [16]. The Homotopy perturbation method couples a Homotopy technique of topology and a perturbation technique. 36 Consider the following Fredholm integro-differential equation of the second kind of the form 1 0 ( ) ( ) ( , )v x f x G x y    ( )v y .dy (3.50) We define the operator 1 0 ( ) ( ) ( , )L u u x G x y   ( )u y ( ) 0dy f x  (3.51) where ( ) ( ).u x v x  Next we define the Homotopy ( , ),H u m [0,1]m by ( ,0) ( )H u F u , ( ,1) ( ),H u L u (3.52) where ( )F u is a functional operator. We construct a convex Homotopy of the form ( , ) (1 ) ( ) ( ).H u m m F u mL u   (3.53) This Homotopy satisfies (3.52) for 0m  and 1m  respectively. The embedding parameter m monotonously increases from zero to unity as the trivial problem ( ) 0F u  is continuously deformed to the original problem ( ) 0.L u  HPM uses the Homotopy parameter m as an expanding parameter to obtain 2 3 0 1 2 3 .u w mw m w m w     (3.54) 37 when 1,m  (3.54) corresponds to (3.53) and becomes the approximate solution of (3.51), i.e., 3.55) )0 1 2 3 1 lim . m v u w w w w        The series (3.55) is convergent for most cases and the rate of convergence depends on ( ).L u Assume ( ) ( ) ( ),F u u x f x  and substituting (3.54) in (3.51) and equating the terms with identical power of ,m we have 0 0: ( ) ( )m w x f x  (3.56) 1 1 0 : ( ) ( , ) ( ) , 1,2,...n n nm w x G x y w y dy n    (3.57) Notice that the recurrence relation (3.57) is the same standard Adomian decomposition method as presented before in chapter two. 3.3 Legendre Polynomial Method Orthogonal polynomials play a very important role in applications of mathematics, mathematical physics, engineering and computer science. One of the most common set of the Legendre polynomials 0 1{ ( ), ( ), , ( )}NP x P x P x which are orthogonal on [ 1,1] and satisfy the Legendre differential equation 2(1 ) ( ) 2 ( ) ( 1) ( ) 0,x y x xy x n n y x      1 1,x   0n  and are given by the form 38  2 2 0 2 21 ( ) ( 1) 2 n k n k n n k n n k P x x k n               0,1,n  (3.58.a ) Moreover, recurrence formulas associated with derivates of Legendre polynomials are given by the relation 1 1( ) ( ) (2 1) ( ),n n nP x P x n P x     1.n  (3.58.b) Consider the following thm order linear Fredholm Integro-differential equation with variable coefficients 1 ( ) 0 1 ( ) ( ) ( ) ( , ) ( ) m k k k F x y x g x K x t y t      ,dt 1 ,x  1t  (3.59) with conditions 1 ( ) ( ) ( ) 0 ( 1) (1) (0) , m k k k jk jk jk j k a y b y c y        0,1,2,..., 1j m  (3.60) where the constants ,jka ,jkb ,jkc  and j are stable constants. Our aim is to obtain a solution expressed in the form: 0 ( ) ( ), N n n n y x a P x    1 1,x   (3. 61) so that the Legendre coefficients to be determined are the 'na s where 0,1,2,...n N and the functions ( )nP x ( 0,1,2, , )n N are the Legendre polynomials defined by the formula (3.58.a). Here ( ),kF x ( )g x and ( , )K x t are functions defined in the interval 1 ,x  1t  . 39 Fundamental matrix relations Equation (3.59) can be written as ( ) ( ) ( )fD x g x I x  (3.62) where ( ) 0 ( ) ( ) ( ) m k k k D x F x y x    and 1 1 ( ) ( , ) ( )fI x K x t y t dt    . We convert the solution ( )y x and its derivative ( ) ( ),ky x the parts ( )D x and ( )fI x , and the mixed conditions in (3.60) to matrix form. Matrix relations for ( )y x and ( ) ( )ky x The function ( )y x defined by (3.61) can be expanded to the truncated Legendre series in the form 0 ( ) ( ), N n n n y x a P x    1 1,x   (3.63) formula (3.63) and its derivative can be written in the matrix forms, [ ( )] P( )Ay x x and ( ) ( )[ ( )] P ( )A,k ky x x (3.64) where 0P( ) [ ( )x P x 1( )P x …. ( )]NP x 40 ( ) ( )P ( ) [ ( )k kx P x ( ) 1 ( )kP x …. ( ) ( )]k NP x and 0 A [a 1 a …. ], N a which A is the coefficient matrix. On the other hand, by using the Legendre recursive formulas (3.58.a) and (3.58.b) and taking 0,1,...,n N we can obtain the matrix equation (1)P ( ) P( ) ,Tx x  (3.65) where, for odd values of N for even values of N Also, it is clearly seen that the relation between the matrix ( )P x and its derivative ( ) ( ),kP x from (3.65), is 41 (1) (2) (1) 2 ( ) (k 1) 1 ( ) ( ) ( ) ( ) ( )( ) ( ) ( )( ) ( )( ) , 0,1,2,.... T T T k T k T k P x P x P x P x P x P x P x P x k             (3.66) Consequently, by substituting the matrix relations (3.66) into Eq. (3.64), we obtain the matrix relations for ( )y x and ( ) ( )kP x as ( )[ ( )] P( )( ) A.k T ky x x  (3.67) Matrix representations based on collocation points The Legendre collocation points defined by 2 1 ,ix i N    0,1,..., ,i N (3.68) we substitute the collocation points (3.68) into Eq. (3.62) to obtain the system ( ) ( ) ( )i i f iD x g x I x  Represented in matrix equation as D G If  (3.69) where 0 0 0 1 1 1 ( ) ( ) ( ) ( ) ( ) ( ) D ,G ,I : : : ( ) ( ) ( ) f f N N f N D x g x I x D x g x I x D x g x I x                                       42 Matrix relation for the differential part ( )D x To reduce the ( )D x part to the matrix form by means of the collocation points, we first write the matrix D defined in eq.(3.69) as ( ) 1 D F m k k k Y   (3.70) where 0 1 ( ) 0 0 0 ( ) 0 F , 0 0 ( ) k k k k N F x F x F x             ( ) 0 ( ) ( ) 1 ( ) ( ) ( ) . ( ) k k k k N y x y x Y y x               Using the collocation points ( 0 , 1 , , )ix i N in (3.67) we have the system of matrix equations ( )[ ( )] P( )( ) A,k T k i iy x x  0,1,...,k m or ( ) 0 0 ( ) 1( ) 1 ( ) ( ) ( ) ( )( ) [( ) A] P( ) A, :: ( )( ) k k k T k T k k NN y x P x P xy x Y P xy x                              (3.71) where 43 0 0 1 0 0 0 1 1 1 1 0 1 ( ) ( ) ... ( ) ( ) ( ) ... ( ) P : : : ( ) ( ) ... ( ) N N N N N N P x P x P x P x P x P x P x P x P x             Thus, from the matrix forms (3.70) and (3.71), we get the fundamental matrix relation for the differential part ( )D x 0 D F P( ) A. m T k k k    (3.72) Matrix relation for the Fredholm integral part ( ) f I x The kernel function ( , )K x t can be approximated by the truncated Legendre series 0 0 ( , ) ( ) ( ) N N t mn m n m n K x t k P x P t      (3.73) or 0 0 ( , ) N N t m n mn m n K x t k x t      (3.74) where 1 (0,0) ; ! ! m n t mn m n K k m n x t     , 0,1,..., .m n N We convert (3.73) and (3.74) to matrix forms and then equalize [ ( , )] P( )K P ( ) X( )K X ( )T T l tK x t x t x t  (3.75) 44 where 0P( ) [ ( )x P x 1( )P x … ( )]NP x X( ) [1x  x … ]Nx K [ ]l l mnk , K [ ];t t mnk , 0,1,..., .m n N On the other hand, by using the Legendre recursive formula (3.58.a) for 0,1,...,n N we can obtain the matrix equation P ( ) X ( )T Tx D x or P( ) X( ) Tx x D (3.76) where for odd values of N and for even values of N see [42]. Therefore, substituting the matrix ( )P x in (3.76) into the relation (3.75) and simplifying the result equation, we find the matrix relation 1 1K ( ) KT l tD D  (3.77) which is the relation between the Legendre and Taylor coefficients of ( , ).K x t Substituting the matrix forms (3.75) and (3.64) corresponding to the functions ( , )K x t and ( )y t into the Fredholm integral part ( ), f I x we obtain 1 1 [ ( )] P( )K P ( )P( )A P( )K QA,T f l lI x x t t dt x    (3.78) where 1 1 Q P ( )P( ) [ ];T mnt t dt q    45 , =0,1,..., and the matrix lK is defined in (3.77). Using the collocation points ( 0,1, , )ix i N defined in (3.68) in the relation (3.78) we obtain the system of the matrix equations I ( ) P( ) K QA;f i i l lx x 0,1,...,i N or briefly I PK QA;f l (3.79) which is the fundamental matrix relation for ( )fI x . Matrix relation for the mixed conditions We can obtain the corresponding matrix form for the conditions (3.60), by means of the relation (3.66), as 1 0 [ ( 1) (1) (0)]( ) A , m T k jk jk jk j k a P b P c P         0,1, , 1.j m  (3.80) Method of solution Now, we are ready to construct the fundamental matrix equation corresponding to (3.59). For this purpose, substituting the matrix relations (3.72) and (3.79) into Eq. (3.69) then simplifying it, we obtain the matrix equation 0 {F P( ) PK Q}A G, m T k k l k      ( 3.81) 46 which corresponds to a system of ( 1)N  algebraic equations for the ( 1)N  unknown Legendre coefficients 0 ,a 1,a .Na Briefly, we can write Eq. (3.81) in the form WA= G or [W ; G] (3.82) where 0 W [ ] F P( ) PK Q, m T k pq k l k w       , 0,1,...,p q N 0G [ ( )g x 1( )g x … ( )] .N Tg x On the other hand, the matrix form (3.80) for the conditions (3.60) can be written as U A [ ]j j or [U ; ]j j , 0,1,..., 1j m  (3.83) where 1 0 U [ ( 1) (1) (0)]( ) m T k j jk jk jk k a P b P c P        0[ ju 1ju …. ].jNu To obtain the solution of Eq. (3.82) under the conditions (3.83), by replacing the rows matrices (3.83) by the last m rows of the matrix (3.81) we have the new augmented matrix 47 [W;G] 00 01 0 0 10 11 1 1 ,0 ,1 , 00 01 0 0 10 11 1 1 1,0 1,1 1, 1 ; ( ) ; ( ) ; ; ( ) ; ; ; ; N N N m N m N m N N m N N m m m N m w w w g x w w w g x w w w g x u u u u u u u u u                                     (3.84) If rank W rank[W;G] 1N   , then we can write 1A (W) G. Thus the coefficients ( 0,1,..., )na n N are uniquely determined by Eq. (3.84). 3.4 Taylor Collocation Method Consider the mth -order linear Fredholm integro-differential equation ( ) 0 ( ) ( ) ( ) ( , ) ( ) bm k k k a P x y x f x K x t y t     dt (3.85) where the unknown functions ( ),kP x ( ),f x ( , )K x t are defined on ,a x t b  and λ is a real parameter where ( )y x is the unknown function. With conditions 3.86)) 1 ( ) ( ) ( ) 0 [ ( ) ( ) ( )] , 0,1,..., 1 m j j j ij ij ij i j a y a b y b c y c i m        48 where ,a c b  provided that the real coefficients ,ija ,ijb ijc and i are appropriate constants. We assume that the solution of (3.85) be the truncated Taylor series ( ) 0 ( ) ( ) ( ) ; ! nN n n y c y x x c n   a x b  (3.87) where N is chosen any positive integer such that .N m Then the solution (3.87) of Eq. (3.85) can be expressed in the matrix form [ ( )] Xy x  0M A where ...( ) ]Nx c 2( )x c x c X [1 ( )... ( )]Ny c (2) ( )y c (1) ( )y c (0)A [ ( )y c and 0M = 1 0 0 0 0! 1 0 0 0 1! 1 0 0 0 2! 1 0 0 0 !N                          . To obtain a solution, we can use the following matrix method, which is a Taylor Collocation method. This method is based on computing the Taylor 49 coefficients by means of the Taylor collocation points are thereby finding the matrix A containing the unknown Taylor coefficients. We substitute the Taylor collocation points ;i b a x a i N    0,1,..., ;i N 0 ,x a Nx b (3.88) into (3.85) to obtain ( ) 0 ( ) ( ) ( ) ( ) m k k i i i i k P x y x f x I x    (3.89) such that ( ) ( , ) ( ) b i a I x K x t y t dt  then we can write the system (3.81) in the matrix form 3.90) ) (0) (1) ( ) ( ) 0 1 0 P Y P Y .... P Y P Y F I m m k m k k         where Pk = 0( ) 0 0 ( ) k k N P x P x          50 0 1 ( ) ( ) F , ( )N f x f x f x             ( ) 0 ( ) ( ) 1 ( ) ( ) ( ) Y , ( ) k k k k N y x y x y x               0 1 ( ) ( ) I . ( )N I x I x I x             Assume the thk derivative of the function (3.87) with respect to x has the truncated Taylor series expansion defined by (3.87): ( ) ( ) ( ) ( ) ( ) ; ( )! N n k n k i i n k y c y x x c n k      a x b  where ( ) ( )ky x ( 0, , )k N are Taylor coefficients; (0) ( ) ( ).y x y x Then substituting the Taylor collocation points, we obtain ( )[ ( )] X M A, i k i x ky x  0,1, ,k N (3.91) or the matrix equation ( ) CM Ak ky  (3.92) where 0 1 X X C X N x x x               0 1 0 0 0 0 1 1 1 0 0 1 ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) N N N N N N x c x c x c x c x c x c x c x c x c                    51 1 0 0 0 0 0! 1 0 0 0 0 1! M . 1 0 0 0 0 0 ( )! 0 0 0 0 0 0 0 0 0 0 k N k                                Then Eq. (3.88) can be written as 3.93)) 0 ( P CM ) A F I m k k k     The kernel ( , )K x t is expanded to construct Taylor series 0 0 ( , ) ( ) ( ) N N n m nm n m K x t k x c t c       ( , ) 1 (0,0) ! ! n m nm n m x c t c K k n m x t        . The matrix representation of ( , )K x t defined by 3.94)) TT K [ ( , )] XK x t  where ....( ) ]Nx c 2( )x c x c X [1 ( ) ]Nt c ....2( )t c t c T [1 52 K  00 01 0 10 11 1 0 1 N N N N NN k k k k k k k k k             In addition, the matrix representation of ( )y x and ( )y t are (3.95) A. 0M T [ ( )]y t  A, 0M X [ ( )]y x  Setting (3.94) and (3.95) into ( )iI x defined in (3.89), we have (3.96) 0 0[ ( )] {XKT TM A} XKHM A b T a I x dt  1 1 , 0,1,..., ( ) ( ) h 1 n m n m nm n m N b c a c n m            H [h ] T T , b T nm a dt   from (3.96) we get the matrix I in the form 3.97)) A.0MHKI = C Finally, substituting (3.97) in (3.93), we get the matrix equation 3.98) )0 0 ( P CM - CKHM )A F m k k k    which is the fundamental relation for solving of Fredholm integro- differential equation defined in .a x b  Equation (3.98) can be written as 3.99)) F  A W 53 which corresponds to a system of ( 1)N  algebraic equations with the unknown Taylor coefficients , 0,1, , .i j N 0 0 W [ ] P CM - CKHM , m ij k k k w     Also, for the conditions in (3.86). We assume ( ) ( ) ( ) ( ) PM A ( ) QM A ( ) RM A j j j j j j y a y b y c             (3.100) where ....( ) ]Na c 2( )a c ( )a c P [1 ....( ) ]Nb c 2( )b c ( )b c Q [1 R =[1 0 0 0]. Setting (3.100) in (3.86), we get 1 0 { P Q R}M A [ ] m ij ij ij j i j a b c       Let 1 0 0 U { P Q R}M [ m i ij ij ij j i j a b c u       1iu …. ]iNu , 0,1,...., 1.i m  (3.101) Thus, the conditions (3.86) becomes 54 U A [ ]i i (3.102) also the augmented matrices representing them are 0[U ; ] [i i iu  1iu … iNu ; ].i (3.103) Finally, the augmented matrix  W;F is defined by the matrices: 00 01 0 10 11 1 ,0 ,1 , 00 01 0 1,0 1,1 1, W N N N m N m N m N N m m m N w w w w w w w w w u u u u u u                              0 1 0 1 ( ) ( ) F .( )N m m f x f x f x                            If, W 0 we can write A  1W F Matrix A is uniquely determined. Then (3.85) has a unique solution in the form (3.87). 55 Chapter Four Numerical Examples and Results To test the efficiency and accuracy of the numerical methods represented in chapter three we will consider the following numerical examples: Example 4.1 Consider the Fredholm integro-differential equation of the second kind 1 3 3 0 1 ( ) 3 (2 1) 3 3 xu x e e x xt      ( )u t dt with (0) 1.u  (4.1) Equation (4.1) has the exact solution 3( ) .xu x e 4.1 The numerical realization of equation (4.1) using the B-spline scaling functions and wavelets on [0,1] The following algorithm implements the B-spline scaling functions and wavelets on [0,1] using the Maple software Algorithm 4.1 [25] 1. Input the fixed positive integer M 2. Input the values of the matrix 1MQ  3. Input the values of the matrix R 4. Input the values of the matrix ( )j 5. Input the values of the matrix ( )j 56 6. Calculate the matrix ,G by using (3.24) and (3.38). 7. Calculate the matrix 1D 8. For i from 2 to 22 2M   , (1) 0,X  1(2 1) 1MX    2( ) (2 1) / (2 2)MX i i    9. Defined , ( ),i j x , 1( ),i x  ,2 1 ( )ii x  10. Defined , ( ),i j x , 1( ),i x  ,2 1 ( )ii x  11. Input ( ) , b a h M   ( ) *t i i h 12. For i from 1 to 5, for j from 1 to 12 1M   , for k from 2 to M , for I from 1 to 2 ,K define ( ) ( (2, 2, ( 1)),mut i, j mu i t j   and 1( ) ( ( , 2,( 1))mut i, j mu k I j   to calculate 1,mutt mut mut 13. Define the kernel 14. For i from 1 to 5, for j from 1 to 12 1M   , for k from 2 to M , for I from 1 to 2 ,K define ( ) ( (2, 2, ( )),muX i, j chi i X j  and 1( ) ( ( , 2,X( ))muX i, j mu K I j  15. Calculate 1,muXX muX muX 16. Calculate zz z  integration 17. (1,1) 1F  , and calculate (1, )F i 18. Calculate C *F Matrix Inverse zz 19. The solution is *U C muXX 57 20. Input the exact solution ( )u Transpose U 1 ( , )u convert u vector 1 : ( , )r plot X u 2 2: ( ( ))r plot u x 21. Display 2( , )r r 22. Absolute error = Mu u Table 4.1 shows the exact and numerical solutions when applying algorithm 4.1 on equation (4.1), and showing the resulting error of using the numerical solution. Table 4.1: The exact and numerical solutions of applying Algorithm 4.1 on. equation (4.1). Absolute error = Mu u Numerical solution Mu Exact solution ( ) exp(3 )u x x x 0.0163058853265190 1.36616469332652 1.349858808 0.1 0.0300558452052084 1.85217464520521 1.822118800 0.2 0.0284377944118681 2.48804090541187 2.459603111 0.3 0.012605637830226 3.33272256083022 3.320116923 0.4 0.0377948841671625 4.51948395416716 4.4816890701 0.5 0.0119447237146941 6.06159218771469 6.049647464 0.6 0.0279839957177916 8.19415390871779 8.166169913 0.7 0.0441265732516403 11.0673029532516 11.02317638 0.8 0.0213860650350881 14.8583456549649 14.87993172 0.9 0.340074020240781 19.7454628997592 20.08553692 1.0 58 These results show the accuracy of the B-spline scaling functions and wavelets to solve equation (4.1) with the max error = 0.34007402024078. Figure 4.1 compares the exact solution 3( ) xu x e with the approximate solution with 4.M  Figure 4.1: The exact and numerical solutions of applying algorithm 4.1 for equation (4.1). Figure 4.2 shows the absolute error resulting of applying algorithm 4.1 on equation (4.1). Figure 4.2: The error resulting of applying algorithm 4.1 on equation (4.1). 59 4.2 The numerical realization of equation (4.1) using the Homotopy perturbation method The following algorithm implements the Homotopy perturbation method using the Maple software Algorithm 4.2 (1) Input ,a , ,n ( ),f x ( , )G x y (2) Calculate 1[0] (( , ))wm int f x (3) Calculate [0]: ( , 1[0])wm y sub x y wm   (4) Calculate ( [0](0))c a eval wm  (5) Define [0] 1[0]ws wm c  (6) Calculate [0] ( , [0])w subs x y ws  (7) For 1i  to ,n calculate [ ] ( ( * [ 1], 0...1)) [ ] ( ( [ ] )) [ ] ( [ ]) wm i int G w i y ws i int wm i ,x w i subs x = y,ws i      (9) Define ( ( [ ] 0..1)nu = combine add ws k ,k  , (10) Define : exp( )u x x  2 : ( ( )) : ( ( )) nr plot u x r plot u x   (11) Absolute Error = nu u For more details see [21, 43]. 60 Table (4.2) shows the exact and numerical results when 4,n  and showing the error resulting of using the numerical solution. Table (4.2): The exact and numerical solution of applying Algorithm 4.2 on equation (4.1). Absolute Error = nu u Numerical solution ( )nu x Exact solution 3( ) xu x e x 0.001356957 1.348501851 1.349858808 0.1 0.005427827 1.816690973 1.822118800 0.2 0.012212611 2.447390500 2.459603111 0.3 0.021711309 3.298405614 3.320116923 0.4 0.033923920 4.447765150 4.4816890704 0.5 0.048850444 6.000797020 6.049647463 0.6 0.066490882 8.099679031 8.166169918 0.7 0.08684524 10.936331144 11.023176388 0.8 0.10991350 14.679818222 14.879731722 0.9 0.13569568 19.949841244 20.085536922 1 These results show the accuracy of the Homotopy perturbation method to solve equation (4.1) with the max error = 0.13569568. Figure 4.3: shows both exact and numerical solutions with 4.n  Figure 4.3: The exact and numerical solutions of applying algorithm 4.2 61 for equation (4.1) Figure 4.4: The error resulting of applying algorithm 4.2 on equation (4.1). Example 4.2 Consider the Fredhom integro-differential equation 1 0 ( ) 2 sin(2 ) sin(4 ) 2 sin(4 2 ) ( ) , (0) 1. u x x x x t u t dt u               )4.2) Equation (4.2) has the exact solution ( ) cos(2 ).u x x 4.3 The numerical realization of equation (4.2) using the B- spline scaling functions and wavelets on [0,1] Table (4.3) shows the exact and numerical results when 8,M  and showing the error resulting of using the numerical solution. 62 Table (4.3): The exact and numerical solution of applying Algorithm 4.1 on equation (4.2). Aboslute Error Mu u Approximate solution Mu Exact solution ( ) cos(2 )u x x x 0.0921773158566965 0.716839678443304 0.8090169943 0.1 0.11064828932222930 0.198368704577070 0.3090169938 0.2 0.105300818156477 -0.414317811956477 -0.3090169938 0.3 0.100547143736594 -0.909564138036594 -0.8090169943 0.4 0.0984823817498084 -1.09848238174981 -1 0.5 0.101007017819846 -0.910024012119846 0.8090169943- 0.6 0.105584820075286 -0.414601813875286 0.3090169938- 0.7 0.1110379755261651 0.198637238538349 0.3090169938 0.8 0.0917042416046411 0.717312752695359 0.8090169943 0.9 0.000275741810288777 1.00027574181029 1 1 These results show the accuracy of the B-spline scaling functions and wavelets to solve equation (4.2) with the max error =0.11064828932222930. Figure 4.5 shows both the exact and the numerical solutions with 8.M  Figure 4.5: The exact and numerical solutions of applying algorithm 4.1 on equation (4.2). 63 Figure 4.6 shows the absolute error resulting of applying algorithm 4.1 on equation (4.2). Figure 4.6 : The error resulting of applying algorithm 4.1 on equation (4.2). 4.4 The numerical realization of equation 4.2 using the Homotopy perturbation method Table (4.4) shows the exact and numerical solutions when applying algorithm 4.2 on equation (4.2) when 8n  , and showing the error resulting of using the numerical solution. 64 Table (4.4): The exact and numerical solution of applying Algorithm 4.2 on equation (4.2). Error = nu u Approximate solution ( )nu x Exact solution ( ) cos(2 )u x x x 0 1 1 0 0 0.8090169943 0.8090169943 0.1 0 0.3090169938 0.3090169938 0.2 104 10 0.3090169942- 0.3090169938- 0.3 102 10 0.8090169945- 0.8090169943- 0.4 0 -1 -1 0.5 103 10 0.8090169940- 0.8090169943- 0.6 104 10 0.3090169934- 0.3090169938- 0.7 108 10 0.3090169946 0.3090169938 0.8 104 10 0.8090169947 0.8090169943 0.9 0 1 1 1 These results show the accuracy of the Homotopy perturbation method to solve equation (4.2) since the max error = 108 10 . Figure 4.7: shows both exact and the numerical solutions with 8n  65 Figure 4.7: The exact and numerical solutions of applying algorithm 4.2 on equation (4.2). Figure 4.8 shows the absolute error resulting of applying algorithm 4.2 on equation (4.2) Figure 4.8 : The error resulting of applying algorithm 4.2 on equation (4.2). Example 4.3 Consider the Fredholm integro-differential equation 66 1 1 2sin( ) sin( ) ( )x ty xy xy e x x e y t dt         , (0) 1y  , (0) 1y   (4.3) Equation (4.3) has the exact solution ( ) exp( ).y x x We will find an approximate solution to equation (4.3) by the Legendre polynomial method, the Taylor collocation method. 4.5 The numerical realization of equation 4.3 using the Legendre polytnomial method The following algorithm implements the Legendre polynomial method using the Matlab software Algorithm 4.3 [42 ] 1. Input ,N ,a ,b ,m 0( ),P x 1( ),P x 2( ),P x ( ),f x ( , )G x y 2. Let (1, 1)ix zeros N  for 0:i N (1, 1) *(( ) / )ix i a i b a N    end 3. Let ( 1, 1, )F zeros N N N   for 1: ( )k length f for 0:i N 67 ( 1, 1, ) ( ( ),{ },{ ( 1)})iF i i k subs f k x x i    end end 4. ( )Pk zeros N for 0:j N for 0:i N ( , ' ')P Legendrep i X ( 1)iX x j  ( 1, 1) ( )Pk j i evalf P   end end 5. Define ( 1)PI LegendrePi N  6. Define ( , ( , ))l tK LegendreK N K x t 7. Calculate (2 / (2* 1))Q diag n  8. Calculate ( ( ), , )iG subs g x x x 9. Let ( 1, 1), 1)WD zeros N N N    for 0: 1k N  68 (:,:, 1) (:,:, 1)* *(( ') ^ )WD k F k Pk PI k   end 10. Let ( 1)WX zeros N  for 0: 1k N  (:,:) (:,:) (:,:, 1)WD WX WD k   end * * *lW WX Pk K Q  11. Let 0 (1, )U zeros N for 0:i N ( , ' ')P Legendre i X 0X  0(1, 1) ( )U i evalf P  end 12. Let 1 (1, )U zeros N (1,1) 0U  for 0:i N ( , ' ')P Legendrep i X 69 ( )P evalf P ( )P diff P 1(1, 1) ( , ,0)U i subs P x  end 13. Put 0 1[ (1: 1,:); , ]WU W N U U  14. [ (1: 1),1,1]GU G N  15. /A WU GU 16. '0'Y  for 0:i N ['(' 2 ( ( 1))aux num str A i  ( ,' ') ') ']Legendrep i x [ ' ' ]Y Y aux  end ( )Y evalf Y Table 4.5 shows the exact and numerical solutions when applying algorithm 4.3 on equation (4.3), and showing the error resulting of using the numerical solution. 70 Table 4.5: The exact and numerical solution of applying Algorithm 4.3 on equation (4.3). ix Exact solution ( ) exp( )y x x Approximate solution ( )Ny x Absolute Error = Ny y -1 0.36787944 0.36787945 1 810 -0.8 0.44932896 0.44932895 1 810 -0.6 0.54881163 0.54881163 0 -0.4 0.67032004 0.67032005 1 810 -0.2 0.81873075 0.81873075 0 0 1 1 0 0.2 1.22140275 1.22140276 1 810 0.4 1.49182469 1.49182470 0 0.6 1.82211880 1.82211882 2 810 0.8 2.22554092 2.22554046 4.6 710 1 2.71828182 2.71827657 5.25 610 These results show the accuracy of the Legendre polynomial method to solve equation (4.3) with the max error = 5.25 610 . Figure 4.9 compares the exact solution ( ) exp( )y x x with the approximate solution 71 Figure 4.9: The exact and numerical solutions of applying algorithm 4.3 on equation (4.3). Figure 4.10 shows the absolute error resulting of applying algorithm 4.3 on equation (4.3) Figure 4.10: The error resulting of applying algorithm 4.3 on equation (4.3). 72 4.6 The numerical realization of equation 4.3 using the Taylor collocation method The following algorithm implements the Taylor collocation method using the Matlab software Algorithm 4.4 1. Input ,a ,b ,c ( , ),K x t ( ),f x 0 ,P 1,P 2P 2. Let (1, 1)ix zeros N  for 0:i N (1, 1) *(( ) / )ix i a i b a N    end 3. Let ( 1)H zeros N  for 0:n N for 0:m N 1expnt n m   ( 1, 1) (( ) ^ ( ) ^ ) /H n m b c expnt a c expnt expnt      end end 73 4. Let ( 1)C zeros N  for 0:n N for 0:m N ( 1, 1) ( (1, 10) ^iC n m x n m    end end 5. Let ( 1,1)F zeros N  for 0:i N ( 1,1) ( ,{ },{ ( 1)})iF i subs FX x x i   end 6. Let ( 1)lK zeros N  for 0:n N for 0:m N for 0:td m if 0td  ( ( , ), )PK diff K x t t ( , )K x t Pk 74 end end for 0:xd n if 0xd  ( ( , ), )PK diff K x t x ( , )K x t Pk end end 7. Calculate ( 1, 1) (1 / ( ( )* ( ))lK n m factorial n factorial m   * ( ( , ),{ , },{0,0})subs K x t x t 8. Input the values of the matrix M 9. Input 0P x  , 1P x , 2 1P  , [1, , ]SP x x  ( 1, 1, )P zeros N N K   for 0:k K for 0:n N for 0:m N if n m 75 ( 1, 1,( 1)) ( ( 1),{ },{ ( 1)})S iP n m k subs P k x x m      end end end end 10. Let ( 1,1)Y S zeros N  (1) 1Y S  (2) 1Y S  11. [ ; ]FU F YS 12. Let ( 1)U zeros N  for 0:n N for 0:m N if n m & ( ( 1) 1))Y S m   end end end 13. Let ( 1, 1, )WD zeros N N K   76 for 0:k K (:,:, 1) (:,:, 1)* * (:,:, 1)WD k P k C M k    end 14. Let ( 1)WX zeros N  for 0:k K (:,:) (:,:) (:,:, 1)WD WX WD k   end 15. Calculate * * * * (:,:,1)lW WX C K H M  [ ; ]WU W U 16. /A WU FU 17. Put 0Y  for 0:n N ( ( 1)* / ( ))*( ) ^Y Y A n factorial n x c n    end Table 4.6 shows the exact and numerical results , and showing the error resulting of using the numerical solution. 77 Table 4.6: The exact and numerical solution of applying Algorithm 4.4 on equation (4.3). ix Exact solution ( ) exp( )y x x Approximate solution ( )Ny x Error = Ny y -1 0.367879 0.368019 1.4 410 -0.8 0.449328 0.449403 7.5 510 -0.6 0.548811 0.548854 4.3 510 -0.4 0.670320 0.670347 2.7 510 -0.2 0.818730 0.818741 1.1 510 0 1 1 0 0.2 1.221402 1.221415 1.3 510 0.4 1.491824 1.491827 3.0 610 0.6 1.822118 1.821847 2.7 410 0.8 2.225540 2.224079 1.5 310 1 2.718281 2.713341 4.9 310 These results show the accuracy of the Taylor collocation method to solve equation (4.3) with a maximum error = 4.9 310 . 78 Figure 4.11 compares the exact solution ( ) exp( )y x x with the approximate solution. Figure 4.11: The exact and numerical solutions of applying algorithm 4.4 on equation (4.3). Figure 4.12 shows the absolute error resulting of applying algorithm 4.4 on equation (4.3) Figure 4.12: The error resulting of applying algorithm 4.4 on equation (4.3). 79 Conclusions Analytical and numerical methods have been used to solve linear Fredholm integro-differential equation of the second kind. The numerical methods are implemented in a form of algorithms to solve some numeri- cal examples using Maple and Matlab software. The numerical results show the following observations: (1) Numerical results for examples 4.1 and 4.2 show clearly that the Homotopy Perturbation Method (HPM) is very efficient in comparison with the B-spline scaling functions and wavelets method. This is because the HPM is very well known for it's fast convergence and consequently requires less CPU time and therefore less error. Moreover, the HPM introduces less complexity and can easily be implemented. (2) Example 4.2 has been solved numerically by both the Legendre polynomial method and the Taylor collocation method. In fact one of the most important feature of the Legendre polynomial method is that the error introduced is considerably small in comparison with the Taylor collocation method. 80 References [1] G. Adomian, Nonlinear Stochastic Operator Equations, Academic Press, SanDiego, (1986). [2] G. Adomian, Solving Froutier Problems of Physics, The Decomp- osition Method, Kluwer, Boston, (1994). [3] G. Adomian and R. Rach, Noise terms in Decomposition Series Sol- ution, Comput. Math. Appl. 24 (1992), 61-64. [4] A. Akyuz and M. Sezer, A Chebyshev Collocation Method for the Solution of Linear Integro-Differential Equations, Int. J. Comput Math. Vol. 27, No. 4, (1999). [5] K. Atkinson, The Numerical Solution of Integral Equations of the Second Kind, The Press Syndicate of the University of Cambridge, United Kingdom, (1997). [6] A. Ayad, Spline Approximation for First Order Fredholm Integro-Differential Equations, Universitatis Babies-Bolyai. Studia. Mathmatica 41 (1996), No.3, 1-8. [7] S.H. Behiry and H. Hashish, Wavelet Methods for the Numerical Solution of Fredholm Integro-Differential Equations, Internatio- nal Journal of Applied Math. 11(2002), No.1,27-35. [8] J. Biazar and M. Pourabd, A Maple Program for Solving Systems of Linear and Nonlinear Integral Equations by Adomian Decompo- 81 sition method, Int. J. Contemp Math. Science, Vol. 2, (2007), No.29, 1425-1432. [9] C.K. Chui, An Introduction to Wavelets, Wavelet Analysis and Its Applications, Vol.1, Academic Press, Massachusetts, (1992). [10] H.T. Davis, Introduction to Nonlinear Differential and Integral Equations, Dover, New York (1962). [11] W.N. Everitt, L.L. Litlejohn and R.Wellman, Legendre Polynomials, Legendre- Stirling Numbers and the Left-definite Spectral Analysis of the Legendre Differential Expression, J. Comput, App. Math. 148(2002). [12] L. Gabet, The Theoretical Foundation of the Adomian Method, Computers Math. Applic. Vol.27, No. 12, (1994), 41-52. [13] M. Gorji, D. Gangi, S. Soleiman, New Application of He's Homotopy Perturbation, Int. J. Nonlinear Sci Numer Simulate (2007),19-28. [14] J.C. Goswami, A.K. Chan and C.K. Chui, On Solving First Kind Integral Equations Using Wavelets on a Bounded Interval, IEEE Transactions on Antennas and Propagation 43(1995), no.6, 614-622. [15 ] J.H. He, A Symmptotology of Homotopy Perturbation Method, Appl. Math. Comput. 156(2004) 591-596. [16] J.H. He, Homotopy perturbation technique, Comput, Methods Appl. Mech. Engrg., 178 (1999) 257-262. 82 [17] J.H. He, Variational Iteration Method for Autonomous Ordinary Differential System, Appl. Math. Comput., 114 (2/3) 2000), 115-123. [18] A. Hossein, A New Analytical Method for Solving Systems of Linear Integro-Differential Equations, Journal of King Saud University- Science (2011), 23, 349-353. [19] S. M. Hosseini and S. Shamord, Numerical Piecewise Approximate Solution of Fredholm Integro-Differential Equations by the Tau Method, App. Math. Model 29(2005)1005-1021. [20] A. J. Jerri, Introduction to Integral Equations with Applications, John Wiley and Sow, INC (1999). [21] A. Kadem and A. Kilic man , The Approximate Solution of Fract- ional Fredholm Integro-Differential Equations by Variational Iteration and Homotopy Perturbation Methods, " Abstract and Applied Analysis", Article ID 486193, (2012). [22] R.P. Kanwal, Linear Integral Equations, Birkhanser, Boston, (1997). [23] A. Karamete and M. Sezer, A Taylor Collocation Method for the Solution of Linear Integro-Differential Equations, International Journal of Computer Mathmatics, Vol. 79(9), pp.987-1000, (2002). [24] M. Khanian and A. Davari, Solution of System of Fredholm Integ- ro-Differential Equations by Adomain Decomposition Method, 83 Australian Journal of Basic and Applied Science, Vol. 5, No. 12, (2011), 2356-2361. [25] M. Lakestani, M. Razzaghi, and M. Dehghan, Semiorthogonal Spline Wavelets Approximation for Fredholm Integro- differential Equations, Article ID 961848, 1-12, (2006). [26] P. Linz, A Method for the Approximate Solution of Linear Integro-Differential Equations. SIAM Journal on Numerical Analysis 11 (1974), No.1, 137-144. [27] K. Maleknejad and M. Tavassolikajani, Solving Second Kind Integral Equations by Galerkin Methods with Hybrid Legendre and Block-Pulse Functions, Appl. Math. Comput. 145(2003),623-629. [28] H. R. Marzban and M. Razzaghi, Optimal Control of Linear Delay Systems via Hyprid of Block-Pulse and Legendre Polynomials, J. Franklin Inst. 341, (2004), 279-293. [29] G. Micula and G. Fairweather, Direct Numerical Spline Methods for First Order Fredholm Integro-Differential Equations, Revue D'Analyse Numerique et de Theorie del' Approximation 22, (1993), No. 1, 59-66. [30] S. Nas, S. Yalcinbas and M. Sezer, A Taylor Polynomial Approach for Solving High Order Linear Fredholm Integro-Differential Equations, Int. F. Math. Educ. Sci. Technol. 31, 491-507. 84 [31] A. Ralston and P. Rabinowitz, A First Course in Numerical Analysis, McGraw-Hill, New York, 1985. [32] Y. Ren, B. Zhang and H. Qiao, A Simple Taylor Series Expansion Method for A Class of Second Kind Integral Equations, J. Comp- ut. Appl. Math. 110, (1999). [33] J. Saberi and A. Ghorbani, He's Homotopy Perturbation Method. An Effective Tool for Solving Nonlinear Integral and Integro- Differential Equations, Computers and Mathematical with Applications 58, (2009), 2379-2390. [34] C. Schneider, Regularity of the Solution to A Class of Weakly Singular Fredholm Integral Equations of the Second Kind, Integral Equations Operator Theory 2 (1979), 62-68. [35] M. Sezer, A Method for the Approximate Solution of the Second-Order Linear Differential Equations in Terms of Taylor Polynomials, Int. F. Math. Educ. Sci. Technol.27 (1996), 821-834. [36] M. Tavassolikajani, M. Ghasemi and E. Babolian, Comparison Between the Homotopy Perturbation Method and the Sine- Cosine Wavelet Method for Solving Linear Integro-Differential Equations, Computers and Mathematics with applications 54 (2007), 1162-1168. [37 ] A.M. Wazwaz, A Reliable Modification of the Adomian Decomp- osition Method, Appl. Math. Comput. 102(1999), 77-86. 85 [38] A.M. Wazwaz, Partial Differential Equations and Soliatary Waves Theory, HEP and Springer, Bijing and Berlin, (2009). [39] A.M. Wazwaz, Linear and Nonlinear Integral Equations: Methods and Application, Springer Heidelberg, Dordrechi London, (2011). [40 ] A.M. Wazwaz, A First Course in Integral Equations, (Second Edition) World Scientific Publishing Company, Singapore and New Jersey (2015). [41] A.M. Wazwaz, AFirst Course in Integral Equations, World Scie- ntific, Singopore, (1997). [42] S. Yalcinbas and M. Sezer, H. Sorkun, Legendre Polynomial Solut- ions of High-Order Linear Fredholm Integro-Differential Equations, International Journal of Applied Mathematics and Computation 210 (2009), 334-349. [43] E. Yusufoglu, Improved Homotopy Perturbation Method for Solving Fredholm Type Integro-differential Equations, Chaos, Solitons and Fractals 41 (2009), 28-37. 86 Appendix Maple Code for B-Spline Scaling Functions and Wavelets for Example 4.1 > restart: > with(plots):with(LinearAlgebra): > M:=4: > 2^(M+1)+1; > Q:=Matrix(2^(M+1)+1):R:=Matrix(2^(M+1)+1): > for i from 1 to (2^(M+1)+1) do > for j from 1 to (2^(M+1)+1) do > if (i=j+1) then Q(i,j):= 1/24; R(i,j):= 1/2 elif (j=i+1)then Q(i,j):= 1/24;R(i,j):= -1/2 elif (i=j) then Q(i,j):= 1/6 end if > od; > od: Q(1,1):=1/12:Q(2^(M+1)+1,2^(M+1)+1):=1/12:R(1,1):=- 1/2:R(2^(M+1)+1,2^(M+1)+1):=1/2: > Qm:= 1/2^(M-1)*Q: > for j from 2 to M do > alpha(j):= Matrix(2^j+1,2^(j+1)+1): > beta(j):=Matrix(2^j,2^(j+1)+1): > od: > for k from 2 to M do > for i from 1 to 2^k+1 do > for j from 1 to 2^(k+1)+1 do > if (j=2*i-1) then alpha(k)(i,j):= 1 elif (j=2*(i-1))then alpha(k)(i,j):= 1/2 elif (j=2*i) then alpha(k)(i,j):= 1/2 end if > od: 87 > od: > od: > for k from 2 to M do > for i from 2 to 2^k-1 do > for j from 1 to 2^(k+1)+1 do > if (j=2*i-1) then beta(k)(i,j):= -1/2 elif (j=2*(i- 1))then beta(k)(i,j):= 1/12 elif (j=2*i) then beta(k)(i,j):= 5/6 elif (j=2*i+1) then beta(k)(i,j):= -1/2 elif (j=2*(i+1)) then beta(k)(i,j):=1/12 end if > od: > od: > beta(k)(1,1):= -1:beta(k)(1,2):= 11/12:beta(k)(1,3):= - 1/2:beta(k)(1,4):= 1/12:beta(k)(2^k,2^(k+1)+1):= - 1:beta(k)(2^k,2^(k+1)):= 11/12:beta(k)(2^k,2^(k+1)-1):= - 1/2:beta(k)(2^k,2^(k+1)-2):= 1/12: > od: > for i from 2 to M do > q(i):=alpha(i): > for j