Abstract
This paper provides a unique graph matrix approach based on the Clique polynomials of the Cocktail party graph to effectively solve multi-delay fractional differential equations (MDFDE) with variable coefficients. Clique polynomials of the cocktail party graph’s basis are used as a trial function for the solution of MDFDE. An operational matrix of Caputo fractional derivative of polynomial approximation is employed to transform the MDFDEs into a system of algebraic equations. The unknowns in the system are determined by Newton’s method in Mathematica. The productivity of the suggested strategy is examined with five numerical examples. From all the discussed examples, it is observed that the proposed Clique polynomial collocation method (CPCM) has excellent compatibility with linear MDFDEs by attaining an exact solution. To substantiate the validity of the recommended method, obtained results with comparisons, computation time, convergence analysis, error estimations, and graphical illustrations are offered.
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 callDisclaimer: 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.
