Numerical solutions of the integral equations of the first kind

https://doi.org/10.1016/S0096-3003(02)00497-6Get rights and content

Abstract

We present new two numerical methods for the solution of non-singular integral of the first kind, which they are simple to use. Numerical comparisons indicate that they achieves comparable accuracy. Numerical results are illustrated by different examples.

Introduction

We shall consider the numerical solution of the non-singular Volterra integral equations of the first kind−1xk(x,t)y(t)dt=g(x),−1⩽x⩽Xwhere g(x) and k(x,t) are known function, y(t) is the unknown function to be determined and X is some large constant. Equations of this form are in general ill-posed, for a given k, g; (1.1) may have no solution, while if a solution exists the response ratio ∥∂y∥/∥∂g∥ to small perturbations in g may be arbitrary large. We shall consider here the use of Chebyshev interpolation. Baker [1], [4] studied the numerical treatment of integral equations, Brunner [2] investigated the solution of Volterra integral equations of the first kind by piecewise polynomials. Babolian and Delves [3] discuss an augmented Galerkin method for first kind Fredholm equations, Holyhead and Mckee [5] investigate Taylor, Multistep method for solving linear Volterra integral equations of the first kind. Lewis [6] studied the numerical solution of Fredholm integral equations of the first kind.

Section snippets

Method one

Consider the Chebyshev interpolation of k(x,t)y(t) w.r.t. t onlyk(x,t)y(t)≈∑j=0nk(x,tj)yjlj,n(t)wherelj,n(t)=jnk=0nTk(t)coskjπnδj=0.5,j=0,n1,0<j<nTk(x) is the Chebyshev polynomial of the first kind and ∑ denotes a sum with first and last term halved.

Integrating both side of relation (2.1) from −1 to x−1xk(x,t)y(t)dt≈∑j=0nR(x,tj)yjwhereR(x,tj)=jk(x,tj)nk=0nIk(x)coskjπnIk(x)=∫−1xTk(s)ds=T1(x)+1,k=0T2(x)−14,k=1Tk+1(x)2(k+1)Tk−1(x)2(k−1)+(−1)k+1(k2−1),k⩾2Let x by zi=cos((i−0.45)π/n), i

Method two

We shall consider the Chebyshev interpolation for y(x) onlyy(x)≈∑j=0nyjlj,n(x)Substitute from (3.1) in (1.1), we getj=0nR(x,tj)y(tj)=g(x)whereR(x,tj)=jnk=0n′′Ak(x)coskjπn(usingFFT)Ak(x)=∫−1xk(x,t)Tk(t)dtThe values of integral Ak(x) may be computed analytically or numerically as follows:Ak(x)=∑r=0Nk(x,tr)br,N(x)coskrπN(usingFFT)Hence, integral equations of the first kind (1.1) are approximated byj=0nR(zi,tj)yj=g(zi),i=0(1)nwhereR(zi,tj)=jnk=0nAk(zi)coskjπnAk(zi)=∑r=0Nk(zi,tr)br,N(zi)cos

Numerical examples

We compare these methods on several examples two have also been considered by Lewis (1975) and Delves (1979) compared the performance of several versions of both the regularization and eigenfunction expansion algorithms for first kind.

Conclusion

  • 1.

    We have described new numerical methods for the solution of the first kind Volterra integral equations. The methods are tested by different examples.

  • 2.

    The computed errors σn in these tables are defined to beσn=nj=0e2n(xj)n1/21−1e2n(t)dt1/2where xjcos(jπ/n), j=0(1)n and en=ynyexact.

  • 3.

    The very rapid convergence obtained shows that the two methods are excellent methods to treat Volterra integral equation of the first kind.

  • 4.

    In case Fredholm integral equation of the first kind, the use of Method 2

References (6)

  • C.T.H. Baker

    The Numerical Treatment of Integral Equations

    (1977)
  • H. Brunner

    The solution of Volterra integral equations of the first kind by piecewise polynomials

    J. Inst. Math. Appl.

    (1973)
  • E. Babolian et al.

    An augmented Galerkin method for first kind Fredholm equations

    J. Inst. Math. Appl.

    (1979)
There are more references available in the full text version of this article.

Cited by (0)

View full text