On the Numerical Solution of Singular Integral Equation with Degenerate Kernel Using Laguerre Polynomials

Abstract

In this paper, we derive a simple and efficient matrix formulation using Laguerre polynomials to solve the singular integral equation with degenerate kernel. This method is based on replacement of the unknown function by truncated series of well known Laguerre expansion of functions. This leads to a system of algebraic equations with Laguerre coefficients. Thus, by solving the matrix equation, the coefficients are obtained. Some numerical examples are included to demonstrate the validity and applicability of the proposed method.

Share and Cite:

Alroogy, K. and Aigo, M. (2023) On the Numerical Solution of Singular Integral Equation with Degenerate Kernel Using Laguerre Polynomials. American Journal of Computational Mathematics, 13, 153-160. doi: 10.4236/ajcm.2023.131007.

1. Introduction

Recent years, there has been a growing interest in the Fredholm and Volterra integral equations. This is an important branch of modern mathematics and arises frequently in many applied areas which include engineering, mechanics, physics, chemistry, astronomy, biology [1] [2] . There are several methods for approximating the solution of linear and non-linear integral equations [3] - [8] . We consider the singular integral equation of the second kind with smooth kernel:

φ ( x ) = f ( x ) + λ 0 k ( x , t ) φ ( t ) d t (1)

where f ( x ) is a continuous function for x 0 and the kernel k ( x , t ) is a function defined on the domain D = { ( x , t ) : x 0, t < } and φ ( x ) is the unknown function that will be determined. In [9] , Laguerre polynomials are used to derive numerical Solutions of Volterra integral Equations. In [10] , repeated Simpson’s and Trapezoidal quadrature rule was used to solve the linear Volterra Integral equations of the second kind. Since the integral equation is called singular when one or both limits of integration become infinite or when the kernel becomes infinite at one or more points in the domain of the integration. In our study, we are interested in the case where one limits of integration become infinite. For solving singular integral equations, many methods with enough accuracy and efficiency have been used before much research, see [8] - [13] . In [14] , the author uses Toeplitz matrices method as numerical method to solve a singular integral equation, where many definite integrals cannot be computed in closed form, and must be approximated numerically. In [1] , the orthogonal polynomials are used to solve numerically Nonlinear Volterra Fredholm Integral Equations. In [13] , the Legendre and Chebyshev collocation method is presented to solve numerically the Voltterra-Fredholm Integral Equations with singular kernel. In this paper, we use numerical technique based on projection method, to reduce the singular integral Equations to a linear system of algebraic equations which will be solved using Gauss elimination or iterative methods. The paper is organized as follows. In section 2, we recall some properties related to Laguerre polynomials. In section 3, a system of algebraic equations will be presented based on Laguerre polynomials. In Section 4, we present a strategy to compute the exact solution for a singular integral equation with degenerate kernel. In section 5, we give a practical example to certify the validity of the proposed technique and then we conclude.

2. Laguerre Method

Sequences of orthogonal polynomials appear frequently used as applications in mathematics, mathematical physics, engineering and computer science, in particular during the resolution of partial differential equations (Laplace, Schrödinger) by the method of separation of variables, also these polynomials can be used to solve integral equations of first and second kind [1] [11] . One of the most common set of orthogonal polynomials is the Laguerre polynomials. Many families of orthogonal polynomials are known, which have in common a certain number of simple properties. The Laguerre differential equation is given by

x y ( x ) + ( 1 x ) y ( x ) + n y ( x ) = 0 , n = 0 , 1 , 2 ,

The solutions of this equation are the Laguerre polynomials, expressed by the equation following differential:

L n ( x ) = e x d n d x n ( x n e x )

Then we get an approximation of the exactly integral, let say:

I n ( Φ ) = 0 K ( x , y ) φ n ( y ) d y (2)

is an approximation of the exact integral. This type of approximation must be chosen so that the integral (2) can be evaluated (either explicitly or by an efficient numerical technique). The functions L 0 ( x ) , L 1 ( x ) , , L n ( x ) will be called interpolating elements. In this paper, the interpolating function L n will be assumed to be the interpolating polynomial

φ n ( x ) = j = 0 n c j L j ( x ) (3)

where L j are Laguerre polynomials of degree j, n is the number of Laguerre polynomials, and c j are unknown parameters, to be determined.

3. System of Algebraic Equations

Consider the following systems

{ L 0 ( x ) , L 1 ( x ) , , L n ( x ) }

where

L 0 ( x ) = 1 , L 1 ( x ) = 1 x , , L n ( x ) = k = 0 n ( n k ) ( 1 ) k k ! x k n 2.

This system forms an orthonormal basis in L 2 ( 0, + ) . In fact, we check that

L n ( x ) , L m ( x ) = 0 L n ( x ) L m ( x ) e x d x = 0 , m n

L n ( x ) = 1 , n = 0 , 1 , 2 ,

The previous system is called the Laguerre polynomial system. To solve the integral Equation (1) we use the projection method. Using an approximation φ n ( x ) of the solution of Equation (1) which is a finite linear combination of orthogonal polynomials ( L n ( x ) ) and also solution of the integral equation

φ n ( x ) = f ( x ) + λ 0 K ( x , t ) φ n ( t ) d t (4)

By taking the linear combination of the Laguerre polynomials

φ n ( x ) = j = 0 n c j L j ( x ) (5)

Substituting (5) in (4) we get

j = 0 n c j L j ( x ) = f ( x ) + λ 0 K ( x , t ) ( j = 0 n c j L j ( t ) ) d t (6)

Let

H j ( x ) = 0 K ( x , t ) L j ( t ) d t

Then equation (6) can be written in the form

j = 0 n c j ( L j ( x ) λ H j ( x ) ) = f ( x ) (7)

By multiplying (7) by L i ( x ) , we get

j = 0 n c j L j ( x ) λ H j ( x ) , L i ( x ) = f ( x ) , L i ( x ) (8)

Using the orthogonalization condition in Equation (8) we get

c i λ j = 0 n c j H j ( x ) , L i ( x ) = f ( x ) , L i ( x ) , i = 0 , 1 , , n (9)

The system of Equation (9) has a unique solution if D ( λ ) 0 , where

D ( λ ) = | 1 λ H 0 ( x ) , L 0 ( x ) λ H 1 ( x ) , L 0 ( x ) λ H n ( x ) , L 0 ( x ) λ H 0 ( x ) , L 1 ( x ) 1 λ H 1 ( x ) , L 1 ( x ) λ H n ( x ) , L 1 ( x ) λ H 0 ( x ) , L n ( x ) λ H 1 ( x ) , L n ( x ) 1 λ H n ( x ) , L n ( x ) |

this makes it possible to determine the coefficients ( c j ) 0 j n .

4. Exact Solution with Degenerate Kernel

Given a degenerate kernel K ( x , t ) = P 1 ( x ) P 2 ( t ) then Equation (1) becomes

φ ( x ) = f ( x ) + λ P 1 ( x ) 0 P 2 ( t ) φ ( t ) d t (10)

Let c be the number defined by

c = 0 P 2 ( t ) φ ( t ) d t (11)

Therefore

φ ( x ) = f ( x ) + λ c P 1 ( x ) (12)

substituting (12) into (11) gives

c = 0 P 2 ( t ) f ( t ) d t 1 λ 0 P 1 ( t ) P 2 ( t ) d t (13)

from (13) and (12) we get:

φ ( x ) = f ( x ) + λ P 1 ( x ) 0 P 2 ( t ) f ( t ) d t 1 λ 0 P 1 ( t ) P 2 ( t ) d t (14)

provided that

0 P 1 ( t ) P 2 ( t ) d t 1 λ

Note that, using some degenerate kernel one can compute exactly the integral to obtain an exact solution. Sometimes 0 K ( x , y ) L n ( y ) d y can not be evaluated exactly, for that one use quadrature rule to approximate the integral [14] .

5. Numerical Examples

To confirm the validity, the accuracy and support our theoretical presentation of the proposed method, we give some computational examples. The computations, associated with the examples are performed by MATLAB. The system of algebraic system will be solved using Gauss elimination and iterative schemes will also be applied for large system.

5.1. First Example

In this example, we consider λ = 1 and K ( x , t ) = e t x , f ( x ) = x 3 e x ; here we have P 1 ( x ) = e x and P 2 ( t ) = e t according to equation (14) we have

φ ( x ) = x 3 e x + e x 0 e t ( t 3 e t ) d t 1 0 e 2 t d t

Considering

I = 0 e t ( t 3 e t ) d t 1 0 e 2 t d t = 11

so the exact solution of Equation (1) is φ ( x ) = x 3 + 10 e x .

We used both Gauss elimination method, and SOR method iterations to solve the linear system. To plot the solution, we truncate the spacial domain to [0; 5]. The behavior of exact and numerical solution is presented in Figure 1(a). The absolute error is depicted in Figure 1(b). It is noticed that convergence to the exact solution need at least 20 Laguerre polynomials.

5.2. Second Example

Let λ = 1 and K ( x , t ) = e t 2 x 2 , f ( x ) = x 4 3 π 8 e x 2 here we have P 1 ( x ) = e x 2 and P 2 ( t ) = e t 2 and by (14), the exaction solution is

φ ( x ) = x 4 3 π 8 e x 2 + e x 2 0 e t 2 ( t 4 3 π 8 e t 2 ) d t 1 0 e 2 t 2 d t

φ ( x ) = x 4 3 π 8 e x 2 + e x 2 0 t 4 e t 2 d t 3 π 8 0 e 2 t 2 d t 1 0 e 2 t 2 d t

the Gaussian integral gives

0 e t 2 d t = π 2

Figure 1. Analytical and numerical solution with n = 30. The absolute error | φ 30 ( x 3 + 10 e x ) | .

by integration by parts, we have

0 t 4 e t 2 d t = 3 π 8

so the exact solution is φ ( x ) = x 4 . For n = 6 the approximate solution

φ 6 ( x ) = j = 0 6 c j L j ( x )

with

L 0 ( x ) = 1 ,

L 1 ( x ) = 1 x ,

L 2 ( x ) = 1 2 x 2 2 x + 1 ,

L 3 ( x ) = 1 6 x 3 + 3 2 x 2 3 x + 1 ,

L 4 ( x ) = 1 24 x 4 2 3 x 3 + 3 x 2 4 x + 1 ,

L 5 ( x ) = 1 120 x 5 + 5 24 x 4 5 3 x 3 + 5 x 2 5 x + 1 ,

L 6 ( x ) = 1 720 x 6 1 20 x 5 + 5 8 x 4 10 3 x 3 + 15 2 x 2 6 x + 1 ,

the coefficients c i are the solution of the system

c i j = 0 6 c j h j ( x ) , L i ( x ) = f ( x ) , L i ( x ) , i = 0 , 1 , , 6 h j ( x ) = 0 e t 2 x 2 L j ( t ) d t

To plot the solution, we truncate the spacial domain to [0; 1]. The behavior of exact and numerical solution is depicted in Figure 2. Note that in example 2, the solution converge to the exact solution using only few Laguerre polynomail (n = 4).

Figure 2. Example 2, case of n = 5. Comparison between exact solution and numerical solution.

6. Conclusion

A very simple and efficient method based on the Laguerre polynomial basis has been developed to solve singular integral equations. The result obtained confirms the strategy proposed. The method presented is tested and confirmed by two examples. A few numbers of Laguerre polynomials are needed to get convergence to the exact solution. Further, one can apply the proposed method to more general kernels or systems of integral equation.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Ali Alhazmi, S.E. (2015) Iterative Algorithm to Solve a System of Nonlinear Volterra-Fredholm Integral Equations Using Orthogonal Polynomials. International Journal of Advanced Scientific and Technical Research, 2, 563-577.
[2] Vajargah, B.F. and Moradi, M. (2010) Three Classifications on Branching Processes and Their Behavior for Finding the Solution of Nonlinear Integral Equations. Mathematical Modelling and Analysis, 15, 371-381.
https://doi.org/10.3846/1392-6292.2010.15.371-381
[3] Maleknejad, K. and Mahmodi, Y. (2003) Taylor Polynomial Solution of High-Order Nonlinear Volterra-Fredholm Integro-Differential Equations. Applied Mathematics and Computation, 145, 641-653.
https://doi.org/10.1016/S0096-3003(03)00152-8
[4] Maleknejad, K., Sohrabi, S. and Rostami, Y. (2007) Numerical Solution of Nonlinear Voltra Integral Equation of the Second Kind by Using Chebyshev Polynomials. Applied Mathematics and Computation, 188, 123-128.
https://doi.org/10.1016/j.amc.2006.09.099
[5] Maleknejad, K., Tavassoli, M. and Mahmoudi, Y. (2003) Numerical Solution of Linear Fredholm and Volterra Integral Equations of the Second Kind by Using Legendre Wavelet. Kybernetes, 32, 1530-1539.
https://doi.org/10.1108/03684920310493413
[6] Yousefi, S. and Razzaghi, S.M. (2005) Legendre Wavelets Method for the Nonlinear Volterra-Fredholm Integral Equations. Mathematics and Computers in Simulation, 70, 1-8.
https://doi.org/10.1016/j.matcom.2005.02.035
[7] Yalsinbas, S. (2002) Taylor Polynomial Solution of Nonlinear Volterra-Fredholm Integral Equations. Applied Mathematics and Computation, 127, 195-206.
https://doi.org/10.1016/S0096-3003(00)00165-X
[8] Elliott, D. (1963) Chebyshev Series Method for the Numerical Solution of Fredholm Integral Equations. The Computer Journal, 6, 102-111.
https://doi.org/10.1093/comjnl/6.1.102
[9] Rahman, M.A., Islam, M.S. and Alam, M.M. (2012) Numerical Solutions of Volterra Integral Equations Using Laguerre Polynomials. Journal of Scientific Research, 4, 357-364.
https://doi.org/10.3329/jsr.v4i2.9407
[10] Aigo, M.A. (2013) On the Numerical Approximation of Volterra Integral Equations of Second Kind Using Quadrature Rules. International Journal of Advanced Scientific and Technical Research, 1, 558-564.
[11] Chniti, C. (2013) Numerical Approximations of Fredholm Integral Equations with Abel Kernel Using Legendre and Chebychev Polynomials. Journal of Mathematical and Computational Science, 3, 655-667.
[12] Chniti, C. (2013) On The Numerical Solution of Volterra-Fredholm Integral Equations With Abel Kernel Using Legendre Polynomials. International Journal of Advanced Scientific and Technical Research, 1, 404-412.
[13] Fox, L. (1962) Chebyshev Methods for Ordinary Differential Equations. The Computer Journal, 4, 318-331.
https://doi.org/10.1093/comjnl/4.4.318
[14] Sharefa Eisa Ali Alhazmi. (2014) Numerical Solution of Volterra-Fredholm Integral Equations with Singular Kernals Using Toeplitz Matrices. International Journal of Advanced Scientific and Technical Research, 4, 575-591.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.