Research Article | Open Access
Hojatollah Adibi, Pouria Assari, "Chebyshev Wavelet Method for Numerical Solution of Fredholm Integral Equations of the First Kind", Mathematical Problems in Engineering, vol. 2010, Article ID 138408, 17 pages, 2010. https://doi.org/10.1155/2010/138408
Chebyshev Wavelet Method for Numerical Solution of Fredholm Integral Equations of the First Kind
A computational method for solving Fredholm integral equations of the first kind is presented. The method utilizes Chebyshev wavelets constructed on the unit interval as basis in Galerkin method and reduces solving the integral equation to solving a system of algebraic equations. The properties of Chebyshev wavelets are used to make the wavelet coefficient matrices sparse which eventually leads to the sparsity of the coefficients matrix of obtained system. Finally, numerical examples are presented to show the validity and efficiency of the technique.
Many problems of mathematical physics can be stated in the form of integral equations. These equations also occur as reformulations of other mathematical problems such as partial differential equations and ordinary differential equations. Therefore, the study of integral equations and methods for solving them are very useful in application. In recent years, several simple and accurate methods based on orthogonal basic functions, including wavelets, have been used to approximate the solution of integral equation [1–5]. The main advantage of using orthogonal basis is that it reduces the problem into solving a system of algebraic equations. Overall, there are so many different families of orthogonal functions which can be used in this method that it is sometimes difficult to select the most suitable one. Beginning from 1991, wavelet technique has been applied to solve integral equations [6–10]. Wavelets, as very well-localized functions, are considerably useful for solving integral equations and provide accurate solutions. Also, the wavelet technique allows the creation of very fast algorithms when compared with the algorithms ordinarily used.
In various fields of science and engineering, we encounter a large class of integral equations which are called linear Fredholm integral equations of the first kind. Several methods have been proposed for numerical solution of these types of integral equation. Babolian and Delves  describe an augmented Galerkin technique for the numerical solution of first kind Fredholm integral equations. In  a numerical solution of Fredholm integral equations of the first kind via piecewise interpolation is proposed. Lewis  studied a computational method to solve first kind integral equations. Haar wavelets have been applied to solve Fredholm integral equations of first kind in . Also, Shang and Han  used Legendre multiwavelets for solving first kind integral equations.
Consider the linear Fredholm integral equations of the first kind: where and , in which , are known functions and is the unknown function to be determined. In general, these types of integral equation are ill-posed for given and . Therefore (1.1) may have no solution, while if a solution exists, the response ration to small perturbations in may be arbitrary large .
The main purpose of this article is to present a numerical method for solving (1.1) via Chebyshev wavelets. The properties of Chebyshev wavelets are used to convert (1.1) into a linear system of algebraic equations. We will notice that these wavelets make the wavelet coefficient matrices sparse which concludes the sparsity of the coefficients matrix of obtained system. This system may be solved by using an appropriate numerical method.
The outline of the paper is as follows: in Section 2, we review some properties of Chebyshev wavelets and approximate the function and also the kernel function by these wavelets. Convergence theorem of the Chebyshev wavelet bases is presented in Section 3. Section 4 is devoted to present a computational method for solving (1.1) utilizing Chebyshev wavelets and approximate the unknown function . In Section 5, the sparsity of the wavelet coefficient matrix is studied. Numerical examples are given in Section 6. Finally, we conclude the article in Section 7.
2. Properties of Chebyshev Wavelets
2.1. Wavelets and Chebyshev Wavelets
Wavelets consist of a family of functions constructed from dilation and translation of a single function called the mother wavelet. When the dilation parameter and the translation parameter vary continuously, we have the following family of continuous wavelets : If we restrict the parameters and to discrete values where and are positive integers, then we have the following family of discrete wavelets: where form a wavelet basis for . In particular, when and , then forms an orthonormal basis [17, 18].
Chebyshev wavelets have four arguments: , is any nonnegative integer, is the degree of Chebyshev polynomial of first kind, and is the normalized time. The Chebyshev wavelets are defined on the interval by  where and . Here , , are Chebyshev polynomials of first kind of degree , given by  in which . Chebyshev polynomials are orthogonal with respect to the weight function , on . We should note that Chebyshev wavelets are orthonormal set with the weight function: where .
2.2. Function Approximation
A function may be expanded as where in which denotes the inner product in . The series (2.7) is truncated as where and are two vectors given by Similarly, by considering and , we approximate as or in the matrix form where with the entries
3. Convergence of the Chebyshev Wavelet Bases
In this section, we indicate that the Chebyshev wavelet expansion of a function , with bounded second derivative, converges uniformly to .
Lemma 3.1. If the Chebyshev wavelet expansion of a continuous function converges uniformly, then the Chebyshev wavelet expansion converges to the function .
Proof. Let where . Multiplying both sides of (3.1) by , where and are fixed and then integrating termwise, justified by uniformly convergence, on , we have Thus for and Consequently and have same Fourier expansions with Chebyshev wavelet basis and therefore .
Theorem 3.2. A function , with bounded second derivative, say , can be expanded as an infinite sum of Chebyshev wavelets, and the series converges uniformly to , that is,
Proof. From (2.8) it follows that If , by substituting in (3.4), it yields where Thus, we get However Since , we obtain Now, if , by using (3.6), we have Hence, the series is absolutely convergent. It is understandable that for , form an orthogonal system constructed by Haar scaling function with respect to the weight function , and thus is convergence . On the other hand, we have Therefore, utilizing Lemma 3.1, the series converges to uniformly.
4. Solution of First Kind Integral Equations
In this section, the Chebyshev wavelet method is used for solving (1.1) by approximating functions , and in the matrix forms: By substituting (4.1) into (1.1), we obtain where is the residual. By letting where is a matrix which is computed next, we have Our aim is to compute such that , but in general, it is not possible to choose such . In this work, is made as small as possible such that where and . Now, by using orthonormality of Chebyshev wavelets, we obtain the following linear system of algebraic equations: for unknowns .
Here, we define two operator equations and as follows: for all and . We assume that integral operator as defined in (4.7) is compact, one-to-one, onto, and . We rewrite (1.1) and (4.2) in the operator form to obtain Combining the latter equations yields where . Provided that exists, we obtain the error bound: The error depends, therefore, on the conditioning of the original integral equation, as is apparent from the term , on the fidelity of the finite-dimensional operator to the integral operator , and on the approximation of to .
Suppose that the function , defined on , is times continuously differentiable, ; by using properties of Chebyshev wavelets and similar to , we have where and denotes the polynomial of degree which agrees with at the Chebyshev nodes of the order on . Therefore, if we want to have , we can choose as
For numerical implementation of the method explained in previous part, we need to calculate matrix . For this purpose, by considering and , we have If then , because their supports are disjoint, yielding . Hence, let ; by substituting in (4.14), we obtain where Now, if , then implies that and if , then Consequently, L has the following form: where is an matrix with the elements
5. Sparse Representation of the Matrix
We proceed by discussing the sparsity of the matrix , as an important issue for increasing the computation speed.
Theorem 5.1. Suppose that is the Chebyshev wavelet coefficient of the continuous kernel , where and . If mixed partial derivative is bounded by and then one has
Remark 5.2. As an immediate conclusion from Theorem 5.1, when or , it follows that and accordingly by increasing or , we can make sparse which concludes the sparsity of the coefficient matrix of system (4.6). For this purpose, we choose a threshold and get the following system of linear equations whose matrix is sparse: where with the entries Now, we can solve (5.5) instead of (4.6).
6. Numerical Examples
In order to test the validity of the present method, three examples are solved and the numerical results are compared with their exact solution [11, 14, 15]. In addition, in Examples 6.1 and 6.2, our results are compared with numerical results in [14, 15]. It is seen that good agreements are achieved, as dilation parameter decreases.
Example 6.1. As the first example, let
with the exact solution .
Table 1 shows the numerical results for this example with and . Also, the approximate solution for , , is graphically shown in Figure 1, which agrees with exact solution and results are compared with those of .
Example 6.2. In this example we solve integral equation
by the present method, where the exact solution is .
Table 2 gives the absolute error for this example with and where denote the approximation of . The approximate solution for in collocation points is graphically shown in Figure 2. It is seen that the numerical results are improved, as parameter increases. Also, results are compared with those of .
Example 6.3. As our final example let
with the exact solution .
The proposed method was applied to approximate the solution of Fredholm integral equation (6.3) with some values of and . Table 3 represents the error estimate for the result obtained of and . The following norms are used for the errors of the approximation of : Also, the error for , and , is graphically shown in Figures 3 and 4 for and , respectively.
Integral equations are usually difficult to solve analytically, and therefore, it is required to obtain the approximate solutions. In this study we develop an efficient and accurate method for solving Fredholm integral equation of the first kind. The properties of Chebyshev wavelets are used to reduce the problem into solution of a system of algebraic equations whose matrix is sparse. However, to obtain better results, using the larger parameter is recommended. The convergence accuracy of this method was examined for several numerical examples.
- M. Razzaghi and Y. Ordokhani, “Solution of nonlinear Volterra-Hammerstein integral equations via rationalized Haar functions,” Mathematical Problems in Engineering, vol. 7, no. 2, pp. 205–219, 2001.
- M. Razzaghi and Y. Ordokhani, “A rationalized Haar functions method for nonlinear Fredholm-Hammerstein integral equations,” International Journal of Computer Mathematics, vol. 79, no. 3, pp. 333–343, 2002.
- A. Alipanah and M. Dehghan, “Numerical solution of the nonlinear Fredholm integral equations by positive definite functions,” Applied Mathematics and Computation, vol. 190, no. 2, pp. 1754–1761, 2007.
- C. Hsiao, “Hybrid function method for solving Fredholm and Volterra integral equations of the second kind,” Journal of Computational and Applied Mathematics, vol. 230, no. 1, pp. 59–68, 2009.
- A. Akyüz-Daşcıoğlu, “Chebyshev polynomial solutions of systems of linear integral equations,” Applied Mathematics and Computation, vol. 151, no. 1, pp. 221–232, 2004.
- S. Yousefi and A. Banifatemi, “Numerical solution of Fredholm integral equations by using CAS wavelets,” Applied Mathematics and Computation, vol. 183, no. 1, pp. 458–463, 2006.
- S. Yousefi and M. Razzaghi, “Legendre wavelets method for the nonlinear Volterra-Fredholm integral equations,” Mathematics and Computers in Simulation, vol. 70, no. 1, pp. 1–8, 2005.
- M. Lakestani, M. Razzaghi, and M. Dehghan, “Solution of nonlinear Fredholm-Hammerstein integral equations by using semiorthogonal spline wavelets,” Mathematical Problems in Engineering, vol. 2005, no. 1, pp. 113–121, 2005.
- H. Adibi and P. Assari, “Using CAS wavelets for numerical solution of Volterra integral equations of the second kind,” Dynamics of Continuous, Discrete & Impulsive Systems. Series A, vol. 16, no. 5, pp. 673–685, 2009.
- U. Lepik and E. Tamme, “Application of the Haar wavelets for solution of linear integral equations,” in Dynamical Systems and Applications, pp. 395–407, 2005.
- E. Babolian and L. M. Delves, “An augmented Galerkin method for first kind Fredholm equations,” Journal of the Institute of Mathematics and Its Applications, vol. 24, no. 2, pp. 157–174, 1979.
- G. Hanna, J. Roumeliotis, and A. Kucera, “Collocation and Fredholm integral equations of the first kind,” Journal of Inequalities in Pure and Applied Mathematics, vol. 6, no. 5, article 131, pp. 1–8, 2005.
- B. A. Lewis, “On the numerical solution of Fredholm integral equations of the first kind,” Journal of the Institute of Mathematics and Its Applications, vol. 16, no. 2, pp. 207–220, 1975.
- K. Maleknejad, R. Mollapourasl, and K. Nouri, “Convergence of numerical solution of the Fredholm integral equation of the first kind with degenerate kernel,” Applied Mathematics and Computation, vol. 181, no. 2, pp. 1000–1007, 2006.
- X. Shang and D. Han, “Numerical solution of Fredholm integral equations of the first kind by using linear Legendre multi-wavelets,” Applied Mathematics and Computation, vol. 191, no. 2, pp. 440–444, 2007.
- M. T. Rashed, “Numerical solutions of the integral equations of the first kind,” Applied Mathematics and Computation, vol. 145, no. 2-3, pp. 413–420, 2003.
- B. K. Alpert, “A class of bases in for the sparse representation of integral operators,” SIAM Journal on Mathematical Analysis, vol. 24, no. 1, pp. 246–262, 1993.
- M. Razzaghi and S. Yousefi, “The Legendre wavelets operational matrix of integration,” International Journal of Systems Science, vol. 32, no. 4, pp. 495–502, 2001.
- E. Babolian and F. Fattahzadeh, “Numerical computation method in solving integral equations by using Chebyshev wavelet operational matrix of integration,” Applied Mathematics and Computation, vol. 188, no. 1, pp. 1016–1022, 2007.
- J. C. Mason and D. C. Handscomb, Chebyshev Polynomials, Chapman & Hall/CRC Press, Boca Raton, Fla, USA, 2003.
- G. B. Folland, Real Analysis: Modern Techniques and Their Applications, Pure and Applied Mathematics, John Wiley & Sons, New York, NY, USA, 2nd edition, 1999.
- I. Daubechies, Ten Lectures on Wavelets, vol. 61 of CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, Pa, USA, 1992.
Copyright © 2010 Hojatollah Adibi and Pouria Assari. 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.