•  
  •  
 

Progress in Fractional Differentiation & Applications

Author Country (or Countries)

Egypt

Abstract

In this article, two new dual Petrov-Galerkin algorithms for solving high odd-order boundary value problems (BVPs) are presented and implemented. The philosophy of applying the Petrov-Galerkin method is built on choosing the trial and test functions such that they satisfy the underlying boundary and dual boundary conditions, respectively. The presented approaches are based on employing the shifted Chebyshev polynomials of third and fourth kinds, respectively, as basis functions. Several numerical experiments are included to ascertain the validity and efficiency of the proposed algorithms. Moreover, comparisons with some other numerical methods in the literature are given.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/pfda/080210

COinS