Abstract
AbstractThe basic aim of this paper is to develop new numerical algorithms for solving some linear and nonlinear fractional-order differential equations. We have developed a new type of Chebyshev polynomials, namely, Chebyshev polynomials of sixth kind. This type of polynomials is a special class of symmetric orthogonal polynomials, involving four parameters that were constructed with the aid of the extended Sturm–Liouville theorem for symmetric functions. The proposed algorithms are basically built on reducing the fractional-order differential equations with their initial/boundary conditions to systems of algebraic equations which can be efficiently solved. The new proposed algorithms are supported by a detailed study of the convergence and error analysis of the sixth-kind Chebyshev expansion. New connection formulae between Chebyshev polynomials of the second and sixth kinds were established for this study. Some examples were displayed to illustrate the efficiency of the proposed algorithms compared to other methods in literature. The proposed algorithms have provided accurate results, even using few terms of the proposed expansion.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Nonlinear Sciences and Numerical Simulation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
