Low cost numerical solution for three-dimensional linear and nonlinear integral equations via three-dimensional Jacobi polynomials

被引:17
|
作者
Sadri, K. [1 ,2 ]
Amini, A. [3 ,4 ]
Cheng, C. [5 ,6 ]
机构
[1] Islamic Azad Univ, Dept Math, Rasht Branch, POB 41335-3516, Rasht 4147654919, Iran
[2] Islamic Azad Univ, Young Res Club, Rasht Branch, POB 41335-3516, Rasht 4147654919, Iran
[3] Univ Western Sydney, Sch Comp Engn & Math, Kingswood Campus,Bld Y,Locked Bag 1797, Penrith, NSW 2751, Australia
[4] Australian Coll Kuwait, Dept Mech Engn, Mishref, Kuwait
[5] South Univ Sci & Technol, Dept Mat Sci & Engn, Shenzhen 518055, Peoples R China
[6] South Univ Sci & Technol, Shenzhen Key Lab Nanoimprint Technol, Shenzhen 518055, Peoples R China
关键词
Three-dimensional integral equations; Operational matrices; Shifted Jacobi polynomials; Convergence; SPREAD;
D O I
10.1016/j.cam.2017.01.030
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 N 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. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:493 / 513
页数:21
相关论文
共 50 条