Abstract

In this paper, we presented a new analytical method for one of the rapidly emerging branches of fractional calculus, the distributed order fractional differential equations (DFDE). Due to its significant applications in modeling complex physical systems, researchers have shown profound interest in developing various analytical and numerical methods to study DFDEs. With this motivation, we proposed an easy computational technique with the help of graph theoretic polynomials from algebraic graph theory for nonlinear distributed order fractional ordinary differential equations (NDFODE). In the method, we used clique polynomials of the cocktail party graph as an approximation solution. With operational integration and fractional differentiation in the Caputo sense, the NDFODEs transformed into a system of algebraic equations and then solved by Newton–Raphson's method to determine the unknowns in the Clique polynomial approximation. The proficiency of the proposed Clique polynomial collocation method (CCM) is illustrated with four numerical examples. The convergence and error analysis are discussed in tabular and graphical depictions by comparing the CCM results with the results of existing numerical methods.

Full Text
Paper version not known

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 call

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.