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.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Fractional calculus is one of the prominent branches of mathematics widely used in modeling various physical phenomena. Since fractional derivatives effectively describe the memory and the hereditary properties of different materials and processes, fractional derivative models have become pivotal over traditional integer order models as they neglected these minute effects. Hence, there has been rigorous research in fractional calculus over the last few decades. Fractional derivatives spread their applications in modeling various physical phenomena such as mechanical and electrical properties of natural materials, description of rheological properties of rocks, control of dynamical systems, cryptography, signal processing, continuum mechanics, Threshold nerve propagation, biosciences, electrochemistry, fluid flow in fractal porous media, optimal mobile sensing, turbulence diffusion problems, image denoising, Brownian motion of particles, and many other engineering aspects [1]. Based on the descriptions of their properties in fractional derivatives, the mathematical modeling and simulation of systems and processes naturally leads to differential equations of fractional order and the necessity to solve such equations. However, general methods for solving them are yet to be optimized. Several noninteger order fractional derivatives, such as Gr¨unwald-Letnikov, Riemann–Liouville, Caputo, Weyl, ψ-Hilfer, Erd'elyi-Kober, Hadamard, Chen, Davidson-Essex, Canavati, Jumarie, Erd'elyi-Kober, Riesz/Feller, Hilfer-Katugampola, Caputo-Fabrizio, Atangana-Baleanu Caputo type, Atangana-Baleanu Riemann–Liouville type, Sun-Hao-Zhang-Baleanu, etc. can be seen in the literature [2]. Riemann–Liouville and Caputo's derivatives are widely used in the literature. Analysis of FDEs involving Riemann–Liouville and Caputo derivatives has been studied extensively in the literature [3]. Various analytical methods have been developed for solving nonlinear fractional differential equations [4,5,6]. These decomposition techniques yield solutions without discretizing the equations or estimating the operators. One must turn to numerical approaches to analyze the long-term behavior of the solutions to FDEs because these decomposition methods only produce local solutions near the initial conditions. Studying fractional-ordered dynamical systems and associated phenomena like bifurcations and chaos is a crucial goal for creating new numerical approaches. Precise and swift numerical techniques are necessary for simulation work in fractionally ordered dynamical systems. FDEs are challenging to solve computationally because fractional derivatives are nonlocal. Therefore, a recent research topic is creating numerical methods for FDEs that are quick, accurate, and stable. While FDEs accurately modeled many physical processes, some models still required more precise mathematical methods. Researchers' attention has recently been drawn to distributed-order fractional differential equations. Distributed order fractional derivatives have a long history. Podlubny conducted a comprehensive study of fractional differential equations, which composed fractional order derivative sums. In 1967 and 1995, Caputo explored and used fractional differential equations to depict events in which the order of differentiation fluctuates within a fixed range. Since the differentiation order in these equations is integrated over a specific range, there isn't just one differentiation order. These Distributed Order Differential Equations were thoroughly analyzed by Bagley and Torvik in 2000, who also generated an interesting mathematical framework and solutions for series expansion [7,8,9]. DFDEs modeled several physical phenomena such as Permanent Magnet Synchronous motors [10], time-fractional Black–Scholes model [11], Bioimpedance for human skin [12], Optimal control problems [8], Diffusion–Wave Equation of Groundwater Flow [13], etc. When resolving fractional differential equations of dispersed order, time scales play a crucial role. Since they provide a consistent framework for handling fractional and differential equations, they support accurately modeling various physical events and processes in physics, chemistry, and engineering [39,40,41,42]. The need for numerical solutions to handle these equations increases as the domain of DFDEs depicting the actual behavior of physical systems expands to get around the mathematical complexity of analytical solutions. Consequently, interest in creating efficient and user-friendly numerical techniques for solving such problems has grown. The recent numerical methods for DFDEs in the literature are Petrov Galerkin method [14], Finite difference schemes [15], Chebyshev wavelets method [16], Hybrid block functions, and Taylor polynomials [17], Müntz–Legendre polynomials method [18], Legendre polynomial method [19], composite collocation method based on Chelyshkov wavelets [20], Haar wavelet method [21], combination of Legendre and Chebyshev wavelets numerical method [22], Legendre Gauss collocation method [23], Legendre operational matrix method [24], hybrid functions consisting of block-pulse functions and Bernoulli polynomial [25], etc.
While dealing with diversified concepts of applied mathematics, graphing is one of the powerful tools for representing and understanding objects and their relationships. Research in the area of graph theory is abundantly expanding. The popularity is due to the mathematical challenges of graph theory and its wide range of applications [26]. For applying theoretical principles of graph theory to practical fields, graph invariants are determined and mapped to real-time problems [27]. Graph invariants are properties like vertices, edges, diameter, and degree. Graph invariants act like a bridge between science and engineering as supporting tools or computational techniques, especially in chemical, electrical, computer, and telecommunication engineering. Usually, graph invariants are studied in algebraic graph theory. Graph invariants whose values are polynomials are known as Graph polynomials. Graph polynomials were first introduced by J.J. Sylvester in 1978 and further studied by J. Petersen [28]. Until now, there have been plenty of graph polynomials such as Chromatic, Characteristic, Dichromatic, Flow polynomials, and various other graph polynomials that have been proven useful in discrete mathematics, engineering, mathematical chemistry, and related disciplines. Polynomials, such as Martin polynomials, Matching polynomials, Tutte polynomials, Rank polynomials, Jones polynomials, Wiener polynomials, Distance polynomials, Edge-difference polynomials, Independence polynomials, Adjacency polynomial, Knot polynomial, Topological transition polynomial, Homomorphism polynomial, Interlace polynomial, Permanent polynomial, etc. [29]. In recent years, some graph polynomials have been proven helpful in developing effective numerical methods for some differential equations [30,31,32]. Recent years have demonstrated that a particular class of graph polynomials has only real roots, which has attracted the attention of many researchers working in various areas of mathematics. Hajiabolhassan and Mehrabadi [33] showed that Clique polynomials always have a real root. Hence, the Clique polynomials, widely used in the numerical approximations of several mathematical models such as Boundary layer natural convection flow problems [34], Nonlinear Klein–Gordon equation [35], Schrodinger equation [36], Brusselator chemical model [37], etc. In all the available research articles based on numerical approximation by clique polynomials, the authors used the clique polynomial of the complete graph. The numerical approximation for distributed order fractional differential equations by clique polynomials is nowhere found in the literature; the author intends to develop a new computational algorithm for DFDE using Clique polynomials as trial functions. In the current work, we want to investigate the approximate solution of nonlinear fractional ordinary differential equations of distributed order with initial and boundary conditions of the form.
where \({Z} \in \left(\left.0, {\mathcal{J}}\right]\right.,\) with the physical conditions \({\mathrm{E}}\left(0\right)= {{\mathrm{E}}}_{0}.\) where \(\psi \left(\varrho \right)\) is non-negative weight function satisfies the condition \(\int\nolimits_{0}^{1} {\psi \left( {\varrho } \right)d{\varrho } = k_{0} }\), \({}_{0}^{C} D_{Z}^{{\varrho }} {\text{E}}\left( Z \right)\) denotes the \({\varrho }^{\rm th}\) order Caputo fractional derivative of \({\text{E}}\left({Z}\right)\). We are using clique polynomials of a new graph known as the cocktail party graph.
2 Preliminaries
Some definitions of fractional calculus [1]:
Let \({\mathrm{E}}\left(x\right)\) Be a continuous function on interval \(\mathtt{I}\subset {\mathbb{R}}\), D be a differential operator, and \(\Gamma \left(\varrho \right)\) be an Euler Gamma function of \(\varrho\),
Definition 1:
for \(\varrho >0\) and \({Z}>\mathcalligra{s}\), for all \(\varrho , {Z}\in {\mathbb{R}}\),
The fractional integral operator of f \(\left({Z}\right)\) is defined by,
Definition 2:
for \(\varrho >\mathcalligra{s}\), for all \(\varrho ,{Z}\in {\mathbb{R}}\). The fractional derivative of order \(\varrho\) in Caputo sense is defined by,
Properties:
1. \({}_{{Z}}{}^{{\text{c}}}{{\text{D}}}_{\mathcalligra{s}}^{\varrho }\) constant = 0.
2. \({}_{{Z}}{}^{{\text{c}}}{{\text{D}}}_{0}^{\varrho }{{Z}}^{n}= \left\{\begin{array}{ll} 0&\quad for\ n< \lceil\varrho \rceil\ and\ n \in W. \\ \frac{\Gamma \left(1 + n\right)}{\Gamma \left(1 + n - \varrho \right)}{ {Z}}^{n - \varrho }&\quad for\ n \ge \lceil\varrho \rceil\ and\ n \in W.\end{array}\right.\)
Here W = {0,1,2, 3,…} and \(\left\lceil n \right\rceil\) Denotes ceiling of \(n\).
Clique polynomial of a graph
Let S be a simple graph with nonempty sets of vertices X(S) and edges Y(S). A Clique is a complete subgraph of graph S. The maximal clique is the complete subgraph of graph S that contains the maximum number of vertices. The ordinary generating function of the number of complete subgraphs of graph S is called a Clique polynomial of graph S. and is denoted by [37],
Here, \(\lambda \left(S\right)\) denotes the maximum number of cliques in graph S. The coefficient \({\mathcalligra{e}}_{p}\) of \(\hspace{0.1cm}{{Z}}^{p}\), \(p>0\) indicates the number of cliques of graph S with \(p\) vertices. The constant term \({\mathcalligra{e}}_{0}=1.\) Hajiabolhassan and Mehrabadi showed that \(Q\left(S;{Z}\right)\), it always has a real root in the interval [– 1,0). Also, the class of triangle-free graphs has only clique roots (roots of the clique polynomial).
Cocktail Party Graph The cocktail party graph evolved when solving the shake problem [42]. The Cocktail party graphs are also known as distance regular graphs. Generally, the \({n}^{\rm th}\) order cocktail party graph contains \(n\) number of rows of paired vertices, and all the vertices are connected with edges except the paired ones. The cocktail party graph can also be denoted with various notations, such as \({{\text{K}}}_{n\times 2}\) and \({{\text{K}}}_{n(2)}\).
The fourth-order cocktail party graph is generally illustrated as follows,
![figure a](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs43994-023-00116-8/MediaObjects/43994_2023_116_Figa_HTML.png)
The clique polynomial of the above fourth-order cocktail party graph is as follows,
where the coefficients of \({\mathcalligra{e}}_{0},{\mathcalligra{e}}_{1},{\mathcalligra{e}}_{2},{\mathcalligra{e}}_{3},{\mathcalligra{e}}_{4}\) \({{Z}}^{p},\) denotes the number of zero, one, two, three, and four cliques of S, respectively. In a simple explanation, \({\mathcalligra{e}}_{1}\) denotes the vertex count, \({\mathcalligra{e}}_{2}\) is the edge count, \({\mathcalligra{e}}_{3}\) is the complete triangle subgraph count, \({\mathcalligra{e}}_{4}\) is the complete quadrilaterals count. In the above graph, we can see, \({\mathcalligra{e}}_{0}=1, {\mathcalligra{e}}_{1}=8, {\mathcalligra{e}}_{2}=24, {\mathcalligra{e}}_{3}=32, {\mathcalligra{e}}_{4}=16.\)
Substituting these coefficients in Eq. (2.3.1), we get,
Similarly, the clique polynomials of \({0}^{\rm th}\), \({1}^{st}, {2}^{nd}, {3}^{rd}, {4}^{\rm th},{5}^{\rm th}, {6}^{\rm th},{7}^{\rm th},\dots etc.\) The ordered cocktail party graph is, obtained as follows:
\({\text{C}}\left({{\text{K}}}_{7\left(2\right)}; {Z}\right)=1+14{Z}+84{{Z}}^{2}+280{{Z}}^{3}+560{{Z}}^{4}+672{{Z}}^{5}+448{{Z}}^{6}+128{{Z}}^{7},\) etc.
With the above observation, The Clique polynomial of the \(n\) th—order Cocktail party graph generalized as below,
Convergence analysis:
Theorem 1:
Let \({\mathbb{R}}^{n}\), be the polynomial Space of degree \(n+1\) over the field\({\mathbb{R}}\). and \(\left({Z}\right):\left [a,b\right]\to\) \({\mathbb{R}}^{n}\), be the solution of the linear ordinary differential Eq. (1). The solution of such equations by the present technique will be exact [34].
Proof:
Let \({\mathbb{R}}^{{\text{n}}}\) be the polynomial Space of degree \(n+1\) over the field \({\mathbb{R}}\), and \({\mathbb{T}}\left({Z}\right):\left [{\text{a}},{\text{b}}\right]\to\) \({\mathbb{R}}^{{\text{n}}}\) be a solution of Eq. (1) of degree at most \({\text{n}}.\) then, there is a basis
\({\text{L}}= \left\{{\text{C}}\left({{\text{K}}}_{1\left(2\right)}; {Z}\right),\mathrm{ C}\left({{\text{K}}}_{2\left(2\right)}; {Z}\right), \dots ,\mathrm{ C}\left({{\text{K}}}_{n\left(2\right)}; {Z}\right),\mathrm{ C}\left({{\text{K}}}_{n+1\left(2\right)}; {Z}\right)\right\}\), containing orthogonal polynomials of clique cocktail party graph (CPG) polynomials.
Where \({\text{C}}\left({{\text{K}}}_{1\left(2\right)}; {Z}\right),\mathrm{ C}\left({{\text{K}}}_{2\left(2\right)}; {Z}\right), \dots ,\mathrm{ C}\left({{\text{K}}}_{n\left(2\right)}; {Z}\right),\mathrm{ C}\left({{\text{K}}}_{n+1\left(2\right)}; {Z}\right)\) are CPG polynomials of degree \(\mathrm{0,1},2,\dots ,n\) respectively.
Consider,
for fixed \(n\) is a linear combination of elements of L. By equating the coefficients of the same degree \({\text{x}}\) on both sides, we get the values of \({{\text{a}}}_{{\text{m}}}\). Hence \({\mathbb{T}}\left({Z}\right)\), is approximated precisely as a linear combination of CPG polynomials.
Theorem 2:
Let \({\mathbb{T}}\left({Z}\right),\) be the solution of Eq. (1), which is a smooth real-valued bounded function on \(\left [a,b\right]\). \({L}^{2}\left [a,b\right]\) Be the Space generated by L, then the orthogonal CPG polynomials expansion of \({\mathbb{T}}\left({Z}\right)\) Converge to it. [34].
Proof:
Let's assume,
truncating the above equation, we get,
where, \({\mathcalligra{e}}_{p}= \langle {\mathbb{T}}\left({Z}\right),\mathrm{ C}\left({{\text{K}}}_{p(2)};{Z}\right) \rangle .\) \(\langle .\rangle\) Represent the inner product operator. Then,
By generalized mean value theorem,
Choose, \(\underset{{\text{a}}}{\overset{{\text{b}}}{\int }}\mathrm{ C}\left({{\text{K}}}_{p(2)};{Z}\right)d{Z}= \mu\) and \({\mathbb{T}}\) is bounded by some real constant \(k\), then we get,
Therefore \(\sum {\mathcalligra{e}}_{{\text{i}}}\), is convergent. Hence, a linear combination of \({\mathbb{T}}\left({Z}\right)\), through the basis element of L, converges to it.
3 Clique polynomial collocation method for NDFDE
Let us assume the polynomial approximation,
On integrating Eq. (6) concerning '\({Z}\)' between the limits' 0' and '\({Z}\),' we get,
Applying initial condition \(\frac{d{\mathrm{E}}\left(0\right)}{d{Z}}={Q}_{1}\) (some real number) in Eq. (7), we get,
On integrating Eq. (8) concerning '\({Z}\)' between the limits' 0' and '\({Z}\)', we get,
Applying initial condition \({\mathrm{E}}\left(0\right)={Q}_{2}\)(some actual number) in Eq. (9), we get,
Applying Caputo fractional derivative on Eq. (10), we get,
Since \({Q}_{2}\) is constant and \({}_{0}{}^{c}{D}_{{Z}}^{\varrho } \left(constant\right)=0, {}_{0}{}^{c}{D}_{{Z}}^{\varrho }\left({{Z}}^{n}\right)=\frac{\Gamma \left(1+n\right)}{\Gamma \left(1+n-\varrho \right)}{{Z}}^{n-\varrho }\), the above Eq. (11) takes the form,
Consider the distributed order time fractional differential equation of the form (1)
Substituting Eq. (12) in the above DFODE, we get,
Solving the above Eq. (13) and discretizing the resultant equation with the collocation points \({{Z}}_{i}= \frac{\left(\mu - \vartheta \right)}{2i}\), \(i=\mathrm{1,2},\dots ,\) etc., the NDFODE is transformed into a system of algebraic equations. The resultant system of algebraic equations is then solved by Newton–Raphson's method to obtain the proposed CCM solution for NDFODE.
4 Numerical simulation
Example 1:
Consider the nonlinear distributed order time-fractional differential equation [38],
With the initial conditions \({\mathrm{E}}\left(0\right)=\) \({{\mathrm{E}}}{\prime}\left(0\right)=0\).and the exact solution \({\mathrm{E}}\left({Z}\right)= {{Z}}^{3}.\)
Implementation of CCM: for N = 2, we have,
On integrating Eq. (16) twice concerning \({Z}\) from 0 to \({Z}\), we get,
Caputo fractional derivative of \({\mathrm{E}}\left({Z}\right)\) is obtained as follows,
Simplifying the above equation, we get,
Now, the LHS of Eq. (15) becomes
On solving Eq. (15) with the collocation points \({Z}=0.4\) and \({Z}=0.8\), we get the following system of equations,
Solving the above system of equations, we get the roots as,\({a}_{0}=-3\),\({a}_{1}=3\). Substituting these coefficients in Eq. (17), we get the clique polynomial approximation solution as \({{Z}}^{3}\).Which is the same as our exact solution. Table 1 presents the comparative results of the exact solution and the CCM results with the absolute errors (AE) at \({Z}\in \left [\mathrm{0,1}\right], h=0.1.\) In Table 2, we compared the relative errors of CCM with the composite collocation method based on Chelyshkov wavelets at\({Z}\in \left(\mathrm{0,1}\right) , h=0.1\). In Table 3, we can see the AE comparison between the CCM and the Trapezoidal rule presented in the Ref [38] at various step lengths\(h\in \left(\mathrm{0,0.12}\right)\). From all the tabulated results in tables [1,2,3], it is clear that the CCM results of the proposed method are accurate and well-matched with the analytical result. In Ref [16], the least \({L}_{2}\) error by the Chebyshev wavelet method is \(2.53\times {10}^{-11}\) and the \({L}_{2}\) error by the CCM is zero, showing the proposed method's efficiency. The computational time for this example 1 in MATHEMATICA(13.2) was 0.12 s, proving the CCM's productivity. A graphical representation of the correlation of CCM results with the analytical results presented in Fig. 1.
Geometrical correlation of CCM solution with the exact solution of Example 1 for \({Z} \in \left [\mathrm{0,1}\right], h=0.1, N=2.\)
Example 2:
Consider the nonlinear distributed order time-fractional differential equation [17],
With the physical conditions \({\mathrm{E}}\left(0.1\right)=\) 4.01, \({{\mathrm{E}}}{\prime}\left(0.1\right)=0\).2, and the exact solution \({\mathrm{E}}\left({Z}\right)= {{Z}}^{2}+4.\)
Implementation of CCM for N = 1, we have,
On integrating Eq. (19) twice concerning \({Z}\) between the limits 0.1 to \({Z}\), we get,\({{\mathrm{E}}}^{\left({\prime}\right)}\left({Z}\right)= 0.2+\left({Z}-0.1\right){a}_{0}\).
Substituting Eq. (21) in Eq. (18) and solving Eq. (18) at \({Z}=0.5\) we get,
Solving Eq. (22), we obtained the unknown coefficient of the initial clique polynomial approximation as \({a}_{0}=2.\) Replacing this root value in Eq. (20), we get the approximate solution as, \(4+{{Z}}^{2}\). Which is simply the exact solution \({\mathrm{E}}\left({Z}\right)= {{Z}}^{2}+4\) of example 1.
The CCM findings at \({Z} \in \left [\mathrm{0,2}\right], h=0.2\) are compared with the results of the analytical solution in Table 4. The compatibility of CCM with the exact solution is depicted in Fig. 2. In Ref [17], the authors used the Reimann-Liouville fractional integral operator of hybrid of the Block pulse functions and Taylor polynomials to obtain relatively accurate results with the help of the Legendre–Gauss quadrature rule for numerical integration. In contrast, in our CCM, we attained the exact solution directly by the classical Reimann sum of the Caputo fractional derivative of clique polynomials.
Geometrical correlation of CCM solution with the Exact solution of Example 1 at \({Z} \in \left [\mathrm{0,2}\right], h=0.1, N=1.\)
Example 3:
Consider the nonlinear distributed order time-fractional differential equation [23],
\({Z}\in \left(\mathrm{0,1}\right]\) with the initial conditions \({\mathrm{E}}\left(0\right)=0\), and the exact solution is \({\mathrm{E}}\left({Z}\right)= {{Z}}^{6}.\)
Implementation of CCM for N = 5, we have,
On integrating Eq. (24) twice concerning \({Z}\) between the limits 0 to \({Z}\), we get,
Substituting Eq. (26) in Eq. (23) and discretizing Eq. (23) with the collocation points 0.1, 0.3, 0.5, 0.7, 0.9, we get the system having five algebraic equations. Solving the above system using Newton-Raphson's method in MATHEMATICA, we obtained the unknown coefficients as,
Substituting these unknowns in Eq. (25), The resultant Clique polynomial solution was \({{Z}}^{6}\). The exactness of the CCM results is presented in Table 5 and Fig. 3. In Table 5, we compared the CCM findings with the analytical results at \({Z} \in \left [\mathrm{0,1}\right], h=0.1\), and its AE. In Table 6, the \({L}_{2}\) CCM errors compared with the Legendre -Gauss collocation method. From the results of Table 6, the least \({L}_{2}\)-error by LGCM is \(3.7206\times {10}^{-16}\) at N = 13 confirms the exactness of the suggested computational algorithm CCM with zero \({L}_{2}\) Error at N = 5.
Geometrical correlation of CCM solution with the Exact solution of Example 1 for \({Z} \in \left [\mathrm{0,1}\right], h=0.1, N=5\)
Example 4:
Consider the nonlinear distributed order time-fractional differential equation [23],
\({Z}\in (\mathrm{0,1}]\) With the initial conditions \({\mathrm{E}}\left(0\right)=0\).and the exact solution \({\mathrm{E}}\left({Z}\right)= {{Z}}^{4}.\)
Implementation of CCM: for N = 3, we have,
On integrating Eq. (28) twice concerning '\({Z}\)' between the limits' 0' and '\({Z}\),' we get,
The Caputo derivative of Eq. (29) is,
Substituting the value of Eq. (30) in Eq. (27) and solving Eq. (27), we get the following system of equations,
Solving the above system of solution, we get the roots of the equations as, \({a}_{0}=3,{a}_{1}=-6,{a}_{2}=3\). Replacing the unknown coefficients in Eq. (29) with these roots, we get the clique polynomial solution as \({{Z}}^{4}\).which is simply the exact solution of example 4. The correlation of CCM results and the results of the Exact solution at \({Z} \in (\mathrm{0,1}), h=0.2, N=3\) through absolute errors are illustrated in Table 7. Results in Table 8 provide the significance of the CCM by comparing the \({L}_{2}\)-Errors with the Legendre–Gauss collocation method at various sets of collocation points. Figure 4 confirms the CCM result's stability compared to the concrete results.
Geometrical correlation of CCM solution with the Exact solution of Example 4 at \({Z} \in \left [\mathrm{0,1}\right], h=0.1, N=3\)
5 Conclusion
This paper introduces an efficient analytical method for a class of nonlinear distributed order fractional ordinary differential equations using a particular class of graph theoretic polynomials, the clique polynomials of cocktail party graphs. Most of the authors in the literature implemented the quadrature rule of numerical integration to solve the distributed order fractional differential equations. In the suggested algorithm, we focused on and developed an alternate computational technique that requires no transformations to change the range of the distribution of fractional orders and can directly solve the DFDEs with simple procedures like operational integration and classical Reimann sum of Caputo fractional derivatives of polynomial approximation. The proficiency of the presented CCM is verified with four illustrative examples, and the numerical findings are compared with the recent numerical methods in the literature. Convergence analysis, graphical representations, and error analysis support the method's accuracy. The goals of solving the considered class of NDFODEs without linearizing the terms in the equations, low computation cost (Less than 0.15s in MATHEMATICA 13.2 for overall computation), accuracy, and stability even for more considerable step lengths achieved. Due to its excellent compatibility with analytical solutions, we intend to address other classes of nonlinear mathematical models governed by the distributed order fractional differential equations, such as the multidimensional time fractional transport equations, financial models like the Black-Scholes equation, etc., as future work.
Data availability
The article includes the information necessary to understand the results of this investigation.
References:
Daftardar-Gejji V (2019) Numerics of fractional differential equations. In: Fractional Calculus and fractional differential equations. Springer Singapore, pp 1–16
Teodoro GS, Machado JT, De Oliveira EC (2019) A review of definitions of fractional derivatives and other operators. J Comput Phys 388:195–208
Jajarmi A, Baleanu D, Sajjadi SS, Nieto JJ (2022) Analysis and some applications of a regularized ψ–Hilfer fractional derivative. J Comput Appl Math 415:114476
Xu H (2023) A generalized analytical approach for highly accurate solutions of fractional differential equations. Chaos Solitons Fractals 166:112917
Saratha SR, Bagyalakshmi M, Krishnan SS, G. (2020) Fractional generalized homotopy analysis method for solving nonlinear fractional differential equations. Comput Appl Math 39:1–32
Doha EH, Bhrawy AH, Ezz-Eldien SS (2011) Efficient Chebyshev spectral methods for solving multi-term fractional orders differential equations. Appl Math Model 35(12):5662–5672
Caputo M (1995) Mean fractional-order-derivatives differential equations and filters. Annali dell’Universita di Ferrara 41(1):73–84
Zaky MA, Machado JT (2017) On the formulation and numerical simulation of distributed-order fractional optimal control problems. Commun Nonlinear Sci Numer Simul 52:177–189
Patnaik S, Semperlotti F (2020) Application of variable-and distributed-order fractional operators to the dynamic analysis of nonlinear oscillators. Nonlinear Dyn 100(1):561–580
Jakovljević B, Lino P, Maione G (2021) Control of double-loop permanent magnet synchronous motor drives by optimized fractional and distributed-order PID controllers. Eur J Control 58:232–244
Kumar Y, Singh VK (2021) A computational approach based on wavelets for financial mathematical model governed by distributed order fractional differential equation. Math Comput Simul 190:531–569
Lazović G, Vosika Z, Lazarević M, Simić-Krstić J, Koruga Đ (2014) Modeling of bioimpedance for human skin based on fractional distributed-order modified Cole model. FME Trans 42(1):74–81
Shah NA, Rauf A, Vieru D, Sitthithakerngkiet K, Kumam P (2021) Analytical solutions of the diffusion-wave equation of groundwater flow with distributed-order of Atangana-Baleanu fractional derivative. Appl Sci 11(9):4142
Kharazmi E, Zayernouri M, Karniadakis GE (2017) Petrov-Galerkin and spectral collocation methods for distributed order differential equations. SIAM J Sci Comput 39(3):A1003–A1037
Jia J, Wang H (2018) A fast finite difference method for distributed-order space-fractional partial differential equations on convex domains. Comput Math Appl 75(6):2031–2043
Pourbabaee M, Saadatmandi A (2021) Collocation method based on Chebyshev polynomials for solving distributed order fractional differential equations. Comput Methods Differ Equ 9(3):858–873
Jibenja N, Yuttanan B, Razzaghi M (2018) An efficient method for numerical solutions of distributed-order fractional differential equations. J Comput Nonlinear Dyn 13(11):111003
Maleknejad K, Rashidinia J, Eftekhari T (2021) Numerical solutions of distributed order fractional differential equations in the time domain using the Müntz-Legendre wavelets approach. Numer Methods Partial Differ Equ 37(1):707–731
Yuttanan B, Razzaghi M (2019) Legendre wavelets approach for numerical solutions of distributed order fractional differential equations. Appl Math Model 70:350–364
Rahimkhani P, Ordokhani Y, Lima PM (2019) An improved composite collocation method for distributed-order fractional differential equations based on fractional Chelyshkov wavelets. Appl Numer Math 145:1–27
Amin R, Alshahrani B, Mahmoud M, Abdel-Aty AH, Shah K, Deebani W (2021) Haar wavelet method for the solution of distributed order time-fractional differential equations. Alex Eng J 60(3):3295–3303
Kumar Y, Singh S, Srivastava N, Singh A, Singh VK (2020) A wavelet approximation scheme for distributed order fractional differential equations. Comput Math Appl 80(8):1985–2017
Xu Y, Zhang Y, Zhao J (2019) Error analysis of the Legendre-Gauss collocation methods for the nonlinear distributed-order fractional differential equation. Appl Numer Math 142:122–138
Pourbabaee M, Saadatmandi A (2019) A novel Legendre operational matrix for distributed order fractional differential equations. Appl Math Comput 361:215–231
Mashayekhi S, Razzaghi M (2016) Numerical solution of distributed order fractional differential equations by hybrid functions. J Comput Phys 315:169–181
Deo N (2017) Graph theory with applications to engineering and computer science. Courier Dover Publications
Randic M, Hansen PJ, Jurs PC (1988) Search for useful graph theoretical invariants of molecular structure. J Chem Inf Comput Sci 28(2):60–68
Wilson R, Watkins JJ, Parks DJ (2023) Graph theory in america: the first hundred years. Princeton University Press
Shi Y, Dehmer M, Li X, Gutman I (eds) (2016) Graph polynomials. CRC Press (List of graph polynomials)
Kumbinarasaiah S, Nirmala AN (2023) Numerical solution of Advection-Diffusion Equation using Graph theoretic polynomial collocation method. Results Control Optim, p 100245
Kürkçü ÖK, Aslan E, Sezer M (2019) On the numerical solution of fractional differential equations with cubic nonlinearity via matching polynomial of the complete graph. Sādhanā 44:1–11
Adel W, Srinivasa K (2022) A new clique polynomial approach for fractional partial differential equations. Int J Nonlinear Sci Numer Simul
Hajiabolhassan H, Mehrabadi ML (1998) On clique polynomials. Australas J Combin 18:313–316
Kumbinarasaiah S, Raghunatha KR (2022) Study of particular types of boundary layer natural convection flow problems through the clique polynomial method. Heat Transfer 51(1):434–450
Kumbinarasaiah S (2020) A new approach for the numerical solution for nonlinear Klein-Gordon equation. SeMA Journal 77(4):435–456
Heydari MH, Razzaghi M (2023) Highly accurate solutions for Space–time fractional Schrödinger equations with the non-smooth continuous solution using the hybrid clique functions. Math Sci 17(1):31–42
Izadi M, Srivastava HM (2022) Fractional clique collocation technique for numerical simulations of fractional-order Brusselator chemical model. Axioms 11(11):654
Katsikadelis JT (2014) Numerical solution of distributed order fractional differential equations. J Comput Phys 259:11–22
El-Deeb AA, Rashid S (2021) On some new double dynamic inequalities associated with Leibniz integral rule on time scales. Adv Difference Equ 2021:1–22
El-Deeb AA, Elsennary HA, Baleanu D (2020) Some new Hardy-type inequalities on time scales. Adv Differ Equ 2020(1):1–21
El-Deeb AA, Xu H, Abdeldaim A, Wang G (2019) Some dynamic inequalities on time scales and their applications. Adv Differ Equ 2019(1):1–19
Ahammad NA, Rasheed HU, El-Deeb AA, Almarri B, Shah NA (2022) A numerical intuition of activation energy in transient micropolar nanofluid flow configured by an exponentially extended plat surface with thermal radiation effects. Mathematics 10(21):4046
Funding
The authors affirm that this manuscript has not been prepared with any funding support.
Author information
Authors and Affiliations
Contributions
The design and conception of the study were contributions from all authors. The final manuscript was read and approved by all writers.
Corresponding author
Ethics declarations
Conflict of interest
Regarding publishing this paper, the authors affirm no conflicts of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Nirmala, A.N., Kumbinarasaiah, S. A new graph theoretic analytical method for nonlinear distributed order fractional ordinary differential equations by clique polynomial of cocktail party graph. J.Umm Al-Qura Univ. Appll. Sci. (2024). https://doi.org/10.1007/s43994-023-00116-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s43994-023-00116-8
Keywords
- Nonlinear distributed order fractional differential equations
- Clique polynomials of Cocktail party graph
- Caputo derivative
- Convergence analysis