New Generalized Jacobi Polynomial Galerkin Operational Matrices of Derivatives: An Algorithm for Solving Boundary Value Problems

Abstract

In this study, we present a novel approach for the numerical solution of high-order ODEs and MTVOFDEs with BCs. Our method leverages a class of GSJPs that possess the crucial property of satisfying the given BCs. By establishing OMs for both the ODs and VOFDs of the GSJPs, we integrate them into the SCM, enabling efficient and accurate numerical computations. An error analysis and convergence study are conducted to validate the efficacy of the proposed algorithm. We demonstrate the applicability and accuracy of our method through eight numerical examples. Comparative analyses with prior research highlight the improved accuracy and efficiency achieved by our approach. The recommended approach exhibits excellent agreement between approximate and precise results in tables and graphs, demonstrating its high accuracy. This research contributes to the advancement of numerical methods for ODEs and MTVOFDEs with BCs, providing a reliable and efficient tool for solving complex BVPs with exceptional accuracy.

Keywords

• Jacobi polynomials
• ordinary differential equations
• fractional differential equations of variable order
• convergence analysis
• collocation method
• boundary value problems