scholarly journals Computational method for solving weakly singular Fredholm integral equations of the second kind using an advanced barycentric Lagrange interpolation formula

Author(s):  
E. S. Shoukralla ◽  
Nermin Saber ◽  
Ahmed Y. Sayed

AbstractIn this study, we applied an advanced barycentric Lagrange interpolation formula to find the interpolate solutions of weakly singular Fredholm integral equations of the second kind. The kernel is interpolated twice concerning both variables and then is transformed into the product of five matrices; two of them are monomial basis matrices. To isolate the singularity of the kernel, we developed two techniques based on a good choice of different two sets of nodes to be distributed over the integration domain. Each set is specific to one of the kernel arguments so that the kernel values never become zero or imaginary. The significant advantage of thetwo presented techniques is the ability to gain access to an algebraic linear system equivalent to the interpolant solution without applying the collocation method. Moreover, the convergence in the mean of the interpolant solution and the maximum error norm estimation are studied. The interpolate solutions of the illustrated four examples are found strongly converging uniformly to the exact solutions.

2021 ◽  
Author(s):  
Emil Shoukralla ◽  
Nermin Saber ◽  
Ahmed Yehia Sayed

Abstract In this study, we applied an advanced barycentric Lagrange interpolation formula to find the interpolate solutions of weakly singular ‎Fredholm integral equations of the ‎second kind. The kernel is ‎interpolated twice concerning ‎both variables and then is transformed into the product of five ‎matrices; two of them are monomial basis ‎matrices. To isolate the singularity of the kernel, we ‎developed two techniques based on a good choice of ‎different two sets of nodes to be distributed ‎over the integration domain. Each set is specific to one of the ‎kernel arguments so that the kernel ‎values never become zero or imaginary. The significant advantage of the ‎two presented ‎techniques is the ability to gain ‎‎access to an algebraic linear system equivalent to the interpolant solution without applying the collocation method. Moreover, the convergence in the ‎mean of the interpolant solution ‎and the maximum error norm estimation are studied. The ‎interpolate solutions of the illustrated four ‎examples are found strongly converging uniformly to the ‎exact solutions.


Author(s):  
Vivian Ndfutu Nfor ◽  
George Emese Okecka

An efficient quadrature formula was developed for evaluating numerically certain singular Fredholm integral equations of the first kind with oscillatory trigonometric kernels.  The method is based on the Lagrange interpolation formula and the orthogonal polynomial considered are the Legendre polynomials whose zeros served as interpolation nodes. A test example was provided for the verification and validation of the rule developed. The results showed the convergence of the solution and can be improved by increasing n.


Author(s):  
Fakhrodin Mohammadi ◽  
Parastoo Adhami

AbstractIn this paper, we present a computational method for solving stochastic Volterra–Fredholm integral equations which is based on the second kind Chebyshev wavelets and their stochastic operational matrix. Convergence and error analysis of the proposed method are investigated. Numerical results are compared with the block pulse functions method for some non-trivial examples. The obtained results reveal efficiency and reliability of the proposed wavelet method.


2006 ◽  
Vol 6 (4) ◽  
pp. 436-442 ◽  
Author(s):  
A.N. Tynda

AbstractIn this paper we construct complexity order optimal numerical methods for Volterra integral equations with different types of weakly singular kernels. We show that for Volterra equations (in contrast to Fredholm integral equations) using the ”block-by-block” technique it is not necessary to employ the additional iterations to construct complexity optimal methods.


2021 ◽  
Vol 17 (1) ◽  
pp. 33
Author(s):  
Ayyubi Ahmad

A computational method based on modification of block pulse functions is proposed for solving numerically the linear Volterra-Fredholm integral equations. We obtain integration operational matrix of modification of block pulse functions on interval [0,T). A modification of block pulse functions and their integration operational matrix can be reduced to a linear upper triangular system. Then, the problem under study is transformed to a system of linear algebraic equations which can be used to obtain an approximate solution of  linear Volterra-Fredholm integral equations. Furthermore, the rate of convergence is  O(h) and error analysis of the proposed method are investigated. The results show that the approximate solutions have a good of efficiency and accuracy.


Sign in / Sign up

Export Citation Format

Share Document