TY - JOUR
T1 - Low cost numerical solution for three-dimensional linear and nonlinear integral equations via three-dimensional Jacobi polynomials
AU - Sadri, K.
AU - Amini, A.
AU - Cheng, C.
PY - 2017
Y1 - 2017
N2 - In recent years, numerical methods have been introduced to solve two-dimensional Volterra and Fredholm integral equations. In this study, a numerical scheme is constructed to solve classes of linear and nonlinear three-dimensional integral equations (Volterra, Fredholm, and mixed Volterra–Fredholm). This operational approach is proposed to easily and directly solve these equations at low computational costs. The scheme is based on the Jacobi polynomials on the interval [0, 1] where three-variable Jacobi polynomials are introduced and their operational matrices of integration and product are derived. Compared to other existing methods for multidimensional problems, the Jacobi operational method eliminates the time-consuming computations and solely employs the one-dimensional operational matrix to construct corresponding multidimensional operational matrices. The absolute error of the proposed method is almost constant on the studied interval even at higher dimensions, confirming the stability of the proposed operational Jacobi method. Required theorems on the convergence of the method are proved in Jacobi-weighted Sobolev space. It is established that the error function vanishes as NN increases. The method is evaluated using several illustrative examples which indicate the proposed method with lesser computational size compared to the Block–Pulse functions, differential transform, and degenerate kernel methods.
AB - In recent years, numerical methods have been introduced to solve two-dimensional Volterra and Fredholm integral equations. In this study, a numerical scheme is constructed to solve classes of linear and nonlinear three-dimensional integral equations (Volterra, Fredholm, and mixed Volterra–Fredholm). This operational approach is proposed to easily and directly solve these equations at low computational costs. The scheme is based on the Jacobi polynomials on the interval [0, 1] where three-variable Jacobi polynomials are introduced and their operational matrices of integration and product are derived. Compared to other existing methods for multidimensional problems, the Jacobi operational method eliminates the time-consuming computations and solely employs the one-dimensional operational matrix to construct corresponding multidimensional operational matrices. The absolute error of the proposed method is almost constant on the studied interval even at higher dimensions, confirming the stability of the proposed operational Jacobi method. Required theorems on the convergence of the method are proved in Jacobi-weighted Sobolev space. It is established that the error function vanishes as NN increases. The method is evaluated using several illustrative examples which indicate the proposed method with lesser computational size compared to the Block–Pulse functions, differential transform, and degenerate kernel methods.
KW - Jacobi polynomials
KW - convergence
KW - integral equations
UR - http://handle.westernsydney.edu.au:8081/1959.7/uws:38883
U2 - 10.1016/j.cam.2017.01.030
DO - 10.1016/j.cam.2017.01.030
M3 - Article
SN - 0377-0427
VL - 319
SP - 493
EP - 513
JO - Journal of Computational and Applied Mathematics
JF - Journal of Computational and Applied Mathematics
ER -