A Spectral Approach to Variable-Order Fractional Differential Equations: Improved Operational Matrices for Fractional Jacobi Functions

Abstract

The current paper presents a novel numerical technique to handle variable-order multiterm fractional differential equations (VO-MTFDEs) supplemented with initial conditions (ICs) by introducing generalized fractional Jacobi functions (GFJFs). These GFJFs satisfy the associated ICs. A crucial part of this approach is using the spectral collocation method (SCM) and building operational matrices (OMs) for both integer-order and variable-order fractional derivatives in the context of GFJFs. These lead to efficient and accurate computations. The suggested algorithm’s convergence and error analysis are proved. The feasibility of the suggested procedure is confirmed via five numerical test examples.

1. Introduction

The past few decades have witnessed growing interest in fractional calculus (FC) among researchers from diverse fields. This surge in attention is largely attributed to the fact that fractional operators offer a more comprehensive approach to characterizing dynamic systems than traditional integer-order methods [1,2,3,4]. A recent development in FC related to the extension of variable-order fractional differential equations (VOFDs). The characteristics of VOFD operators are studied in [5,6,7]. VOFDs have been extensively utilized in control, physics, mechanics, and signal processing (see, for instance, [8,9,10,11]). Beyond system dynamics, fractional calculus has found application in materials science for describing complex microstructural properties [12]. The Riesz–Caputo formulation with space-dependent fractional order has shown particular promise in continuum elasticity problems [13]. Additionally, they were employed to represent the microscopic structure of materials. The Riesz–Caputo fractional derivative of spatially dependent order was utilized in continuum elasticity, as seen in [13].

Significant advances in numerical analysis have yielded multiple robust methods for approximating solutions to this category of equations. In prior studies, scholars have utilized several methodologies to formulate numerical solutions (NUMSs) for fractional differential equations (FDEs) through spectral methods employing various polynomial systems, including both orthogonal and non-orthogonal families (refer to, for example, [14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31]), whereas Bernstein polynomials were utilized in [32,33]. A numerical technique utilizing Fourier analysis was proposed in [34]. In [35], the suggested systems were examined based on finite difference approximations. In [36], a numerical method is introduced, based on Bernoulli polynomials, for solving VO-MTFDEs.

Orthogonal JPs [37,38,39,40,41,42,43,44,45,46,47] have multiple beneficial characteristics that make them exceptionally useful in the numerical resolution of diverse forms of differential equations (DEs), especially using spectral approaches. Jacobi polynomials offer three principal advantages: a built-in orthogonal structure, rapid spectral convergence, and shape parameters that provide control over approximation properties.

Orthogonal functions (OFs) have garnered significant interest in addressing FDEs [48,49,50]. The primary attribute of this strategy is its ability to reduce these fractional model problems to the handling of an algebraic system of equations, so significantly simplifying the problem. Reference [48] presented a fractional generalization of Legendre orthogonal functions, constructed from standard Legendre polynomials, for obtaining spectrally accurate solutions to FDEs in bounded domains. Building on this work, Ref. [51] introduced a bivariate extension of these fractional-order basis functions and established their associated operational matrices for derivative and integral operators, facilitating the numerical treatment of 2D fractional problems. Notably, Izadi and Cattani [52] developed generalized Bessel polynomials for solving multi-order FDEs, demonstrating their effectiveness through rigorous convergence analysis. Furthermore, for solving FDEs on semi-infinite intervals, the authors in [53] developed fractional integral operators based on generalized Laguerre operational matrices. Separately, reference [54] presented an eigenvalue–eigenvector approach for handling systems of FDEs with uncertainty.

This study extends the application of novel orthogonal functions derived from Jacobi polynomials to solve variable-order FDEs. We employ the following generalized fractional Jacobi functions that inherently satisfy the prescribed initial conditions to develop a spectral collocation method for VO-MTFDEs:

$${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}\chi \left(\tau \right)=F\left(\tau ,\chi \left(\tau \right),{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{{\nu }_1\left(\tau \right)}\chi \left(\tau \right),{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{{\nu }_2\left(\tau \right)}\chi \left(\tau \right),\dots ,{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{{\nu }_m\left(\tau \right)}\chi \left(\tau \right)\right),$$

(1)

for $\tau \in (0,\ell )$ and supplemented with the subsequent ICs, written as follows:

$${\chi }^{\left(s\right)}\left(0\right)={\omega }_s,s=0,1,\dots ,n-1,$$

(2)

where $0<{\nu }_1\left(\tau \right)<{\nu }_2\left(\tau \right)<\dots <{\nu }_m\left(\tau \right)<\nu \left(\tau \right)\le n$ holds, n is the smallest positive integer number such that for all $\tau \in [0,\ell ]$, and ${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}\chi \left(\tau \right)$ and ${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{{\nu }_i\left(\tau \right)}\chi \left(\tau \right)$ stand for the VOFDs defined in the Liouville–Caputo sense for $i=1,2,\dots ,m$. The mathematical frameworks represented by Equations (1) and (2) possess significant practical utility across various domains. Notable applications include signal processing and noise reduction [55,56], geographical information processing [57], and handwritten signature analysis [58], underscoring their versatility in solving applied problems.

We have devised an innovative approach to address (1) and (2) by formulating new Galerkin operational matrices (OMs) for ordinary derivatives ODs and VOFDs for the basis vector of GFJFs. Based on what we know, the literature has never before seen this strategy for addressing VO-MTFDEs, utilizing the Liouville–Caputo FDs of the suggested basis vector, as been presented. This innovative technique facilitates the successful healing and acquisition of NUMSs for this category of FDEs.

This article is organized as follows: In Section 2, we present an overview of the core concepts and basic of VOFD. Section 3 highlights specific properties of the shifted JPs and fractional Jacobi functions (FJFs). Section 4 concentrates on the creation of innovative OMs for ODs and VOFDs of GFJFs. In Section 5, we investigate the use of newly constructed OMs alongside the SCM as an approximate method to address (1) and (2). The assessment of the error estimate for the NUMSs derived from this novel method is detailed in Section 6. Numerical simulations of test cases are conducted, and comparisons with existing methodologies from the literature demonstrate the efficacy of the proposed approach. In the final Section 8, we encapsulate the primary findings and derive conclusions from the current research investigation.

2. Core Definition of Liouville–Caputo VOFDs

The current section describes the key mathematical principles of fractional calculus, which are essential for implementing our proposed solution.

Definition 1

([4,17,33,59]). The Liouville–Caputo VOFDs for $\mathrm{\Theta }\left(\tau \right)$ is expressed as follows:

$${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}\mathrm{\Theta }\left(\tau \right):={\displaystyle \frac{1}{\mathrm{\Gamma }(n-\nu (\tau \left)\right)}}\underset{0}{\overset{\tau }{\int }}{\displaystyle \frac{{\mathrm{\Theta }}^{\left(n\right)}\left(\sigma \right)}{{(\tau -\sigma )}^{1-n+\nu \left(\tau \right)}}}d\sigma ,\tau >0,n-1<\nu \left(\tau \right)\le n.$$

(3)

When $\nu \left(\tau \right)={\varsigma }_1$, in Definition 1 we get the Liouville–Caputo FD of order ${\varsigma }_1$. The core properties of the Liouville–Caputo VOFD operator are summarized as follows:

$$\begin{array}{cc}\hfill {}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}({\lambda }_1{\mathrm{\Theta }}_1\left(\tau \right)+{\lambda }_2{\mathrm{\Theta }}_2\left(\tau \right))& ={\lambda }_1{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{\mathrm{\Theta }}_1\left(\tau \right)+{\lambda }_2{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{\mathrm{\Theta }}_2\left(\tau \right),\hfill \end{array}$$

(4a)

$$\begin{array}{cc}\hfill {}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}\mathrm{\Theta }\left(\tau \right)& ={\displaystyle \frac{d^n\mathrm{\Theta }\left(\tau \right)}{d{\tau }^n}},\nu \left(\tau \right)=n,n\in \mathbb{N}.\hfill \end{array}$$

(4b)

As demonstrated in [17,33], we obtain the following:

$$\begin{array}{cc}\hfill {}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{\tau }^s& =\left\{\begin{array}{cc}0,\hfill & s=0,\hfill \\ {\displaystyle \frac{\mathrm{\Gamma }(s+1)}{\mathrm{\Gamma }(s+1-\nu (\tau \left)\right)}}{\tau }^{s-\nu \left(\tau \right)},\hfill & s=1,2,\dots ,\hfill \end{array}\right.\hfill \end{array}$$

(5a)

$$\begin{array}{cc}\hfill {}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}\left(c\right)& =0,\left(cisaconstant\right).\hfill \end{array}$$

(5b)

3. Shifted Jacobi Polynomials and Fractional Jacobi Functions

We first examine the fundamental properties of shifted Jacobi polynomial (JPs) systems and their fractional counterparts FJFs. Subsequently, we propose and characterize a new set of orthogonal functions (OFs), the generalized fractional Jacobi functions (GFJFs).

3.1. Analytical Framework: Shifted JP Basis Functions

For parameters ${\varsigma }_1,{\varsigma }_2>-1$, the JP family ${\left\{{\mathrm{P}}_n^{({\varsigma }_1,{\varsigma }_2)}\left(x\right)\right\}}_{n=0}^{\infty }$ forms an orthogonal system with regard to the weight function $w^{{\varsigma }_1,{\varsigma }_2}\left(x\right)={(1-x)}^{{\varsigma }_1}{(1+x)}^{{\varsigma }_2}$ on $[-1,1]$, as established in [60], written as follows:

$${\int }_{-1}^1{w}^{{\varsigma }_1,{\varsigma }_2}\left(x\right){\mathrm{P}}_n^{({\varsigma }_1,{\varsigma }_2)}\left(x\right){\mathrm{P}}_m^{({\varsigma }_1,{\varsigma }_2)}\left(x\right)dx=\left\{\begin{array}{cc}0,\hfill & n\ne m,\hfill \\ h_n^{({\varsigma }_1,{\varsigma }_2)},\hfill & n=m,\hfill \end{array}\right.$$

where $h_n^{({\varsigma }_1,{\varsigma }_2)}={\displaystyle \frac{\mathrm{\Gamma }(n+{\varsigma }_1+1)2^{\lambda }\mathrm{\Gamma }(n+{\varsigma }_2+1)}{(2n+\lambda )n!\mathrm{\Gamma }(n+\lambda )}}$ with $\lambda ={\varsigma }_1+{\varsigma }_2+1$.

The so-called shifted JPs, ${\mathrm{P}}_{\ell ,n}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)={\mathrm{P}}_n^{({\varsigma }_1,{\varsigma }_2)}(2\tau /\ell -1)$, obey the following orthogonality relation:

$${\int }_0^{\ell }{w}_{\ell }^{{\varsigma }_1,{\varsigma }_2}\left(\tau \right){\mathrm{P}}_{\ell ,n}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right){\mathrm{P}}_{\ell ,m}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)d\tau =\left\{\begin{array}{cc}0,\hfill & m\ne n,\hfill \\ {\left({\displaystyle \frac{\ell }{2}}\right)}^{\lambda }{h}_n^{({\varsigma }_1,{\varsigma }_2)},\hfill & m=n,\hfill \end{array}\right.$$

where $w_{\ell }^{{\varsigma }_1,{\varsigma }_2}\left(\tau \right)={(\ell -\tau )}^{{\varsigma }_1}{\tau }^{{\varsigma }_2}$.

The ${\mathrm{P}}_{\ell ,n}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)$ admits the following power series expansion:

$${\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)=\sum _{k=0}^i{c}_k^{\left(i\right)}{\left({\displaystyle \frac{\tau }{\ell }}\right)}^k,$$

(6)

where we have defined the following:

$$c_k^{\left(i\right)}={(-1)}^{i-k}{\displaystyle \frac{\mathrm{\Gamma }(i+{\varsigma }_2+1)\mathrm{\Gamma }(i+k+\lambda )}{\mathrm{\Gamma }(k+{\varsigma }_2+1)\mathrm{\Gamma }(i+\lambda )k!(i-k)!}}.$$

(7)

The monomial terms ${\tau }^k$ can be stated as a finite linear combination of JPs ${\mathrm{P}}_{\ell ,r}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)$ in the following form:

$${\tau }^k=\sum _{r=0}^k{b}_r^{\left(k\right)}(\ell ){\mathrm{P}}_{\ell ,r}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right),$$

(8)

where we write the following:

$$b_r^{\left(k\right)}(\ell )={\displaystyle \frac{{\ell }^{k}k!(\lambda +2r)\mathrm{\Gamma }(k+{\varsigma }_2+1)\mathrm{\Gamma }(r+\lambda )}{(k-r)!\mathrm{\Gamma }(r+{\varsigma }_2+1)\mathrm{\Gamma }(k+r+\lambda +1)}}.$$

(9)

3.2. Introducing Generalized FJFs

This portion focuses on introducing the set of GFJFs, ${\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),\vartheta >0,$ with some necessary properties needed throughout the paper. They are defined as follows [61]:

$${\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)=\sum _{k=0}^i{c}_k^{\left(i\right)}{\left({\displaystyle \frac{\tau }{\ell }}\right)}^{\vartheta k},i=0,1,2,\dots .$$

(10)

This set has the following property:

Lemma 1

([61]). The set of GFJFs, ${\left\{{\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)\right\}}_{i\ge 0},$ constitutes a complete orthogonal system on the subsequent space:

$$L_{w_{\ell }^{{\varsigma }_1,{\varsigma }_2,\vartheta }}^2=\left\{f|f:[0,\ell ]\to \mathbb{R},{\int }_0^{\ell }{w}_{\ell }^{{\varsigma }_1,{\varsigma }_2,\vartheta }\left(\tau \right){\left|f\left(\tau \right)\right|}^{2}d\tau <\infty \right\},$$

(11)

considering the weight function $w_{\ell }^{{\varsigma }_1,{\varsigma }_2,\vartheta }\left(\tau \right)=\vartheta {\tau }^{\vartheta ({\varsigma }_2+1)-1}{({\ell }^{\vartheta }-{\tau }^{\vartheta })}^{{\varsigma }_1}$, i.e.,

$${\int }_0^{\ell }{w}_{\ell }^{{\varsigma }_1,{\varsigma }_2,\vartheta }\left(\tau \right){\mathrm{P}}_{\ell ,n}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right){\mathrm{P}}_{\ell ,m}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)d\tau =\left\{\begin{array}{cc}0,\hfill & m\ne n,\hfill \\ h_{\ell ,n}^{({\varsigma }_1,{\varsigma }_2,\vartheta )},\hfill & m=n,\hfill \end{array}\right.$$

(12)

where $h_{\ell ,n}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}={\ell }^{\lambda \vartheta }{2}^{-\lambda }{h}_n^{({\varsigma }_1,{\varsigma }_2)}$.

The following inversion formula given in Lemma 2 is needed throughout the paper.

Lemma 2

The relationship between ${\tau }^{\vartheta k}$ and the basis ${\mathrm{P}}_{\ell ,r}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$ is given by the following:

$${\tau }^{\vartheta k}=\sum _{r=0}^k{b}_r^{\left(k\right)}\left({\ell }^{\vartheta }\right){\mathrm{P}}_{\ell ,r}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),k=0,1,2,\dots .$$

(13)

Proof. 

The result follows directly from application of formula (8), by replacing $\tau$ with ${\tau }^{\vartheta }{\ell }^{-\vartheta +1}$.    □

New OFs ${\left\{{\varphi }_{n,j}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)\right\}}_{j\ge 0}$ are introduced, such as the following:

$${\varphi }_{n,j}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)={\tau }^n{\mathrm{P}}_{\ell ,j}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),$$

(14)

that satisfy the following:

$${\int }_0^{\ell }{w}_{n,\ell }^{{\varsigma }_1,{\varsigma }_2,\vartheta }\left(\tau \right){\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right){\varphi }_{n,j}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)d\tau =\left\{\begin{array}{cc}0,\hfill & i\ne j,\hfill \\ h_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )},\hfill & i=j,\hfill \end{array}\right.$$

(15)

where $w_{n,\ell }^{{\varsigma }_1,{\varsigma }_2,\vartheta }\left(\tau \right)={\displaystyle \frac{1}{{\tau }^{2n}}}{w}_{\ell }^{{\varsigma }_1,{\varsigma }_2,\vartheta }\left(\tau \right)$.

Remark 1.

Since we have

$${\varphi }_{0,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)={\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),{\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2,1)}\left(\tau \right)={\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right),{\varphi }_{0,i}^{({\varsigma }_1,{\varsigma }_2,1)}\left(\tau \right)={\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right),$$

so ${\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$ are generalizations of ${\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$ and ${\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)$. Additionally, there are also generalizations of ${\mathrm{P}}_{\ell ,i}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)$.

4. Operational Matrices for Both ODs and VOFDs of ${\mathbf{\varphi }}_{\mathbf{n},\mathbf{i}}^{({\mathbf{\varsigma }}_{\mathbf{1}},{\mathbf{\varsigma }}_{\mathbf{2}},\mathbf{\vartheta })}\left(\mathbf{\tau }\right)$

In this section, two main theorems are presented that provide the two operational matrices for ODs as well as VOFDs of the vector, written as follows:

$${\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)={[{\varphi }_{n,0}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),{\varphi }_{n,1}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),\dots ,{\varphi }_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)]}^T.$$

(16)

Theorem 1.

${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$ can be formulated in the following form:

$${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right):={\displaystyle \frac{1}{{\tau }^{\nu \left(\tau \right)}}}\sum _{j=0}^i{\mathrm{\Theta }}_{i,j}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right){\varphi }_{n,j}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),$$

(17)

and therefore, the VOFD of ${\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$ has the following form:

$${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)={\tau }^{-\nu \left(\tau \right)}{\mathbf{D}}_n^{\left(\nu \right(\tau ),\vartheta )}{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),$$

(18)

where ${\mathbf{D}}_n^{\left(\nu \right(\tau ),\vartheta )}=\left(d_{i,j}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)\right)$ forms a matrix of size $(M+1)\times (M+1)$. Its explicit format is as follows:

$$\left(\begin{array}{cccccc}{\mathrm{\Theta }}_{0,0}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)& 0& \dots & \dots & \dots & 0\\ \\ {\mathrm{\Theta }}_{1,0}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)& {\mathrm{\Theta }}_{1,1}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)& 0& \dots & \dots & 0\\ ⋮& & \ddots & & & ⋮\\ {\mathrm{\Theta }}_{i,0}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)& \dots & {\mathrm{\Theta }}_{i,i}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)& 0& \dots & 0\\ ⋮& & & \ddots & & ⋮\\ ⋮& & & & \ddots & 0\\ {\mathrm{\Theta }}_{M,0}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)& \dots & \dots & \dots & \dots & {\mathrm{\Theta }}_{N,M}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)\end{array}\right).$$

(19)

Here, we have the following:

$$d_{i,j}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)=\left\{\begin{array}{cc}{\mathrm{\Theta }}_{i,j}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right),\hfill & i\ge j,\hfill \\ 0,\hfill & \mathrm{otherwise},\hfill \end{array}\right.$$

(20)

and

$${\mathrm{\Theta }}_{i,j}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right)={\displaystyle \frac{{(-1)}^{i-j}(2j+\lambda ){({\varsigma }_2+1)}_i{\left(\lambda \right)}_j}{{({\varsigma }_2+1)}_j{\left(\lambda \right)}_i}}\sum _{k=0}^{i-j}{\displaystyle \frac{{(-1)}^k\mathrm{\Gamma }(n+(j+k)\vartheta +1)\mathrm{\Gamma }(i+j+k+\lambda )}{k!(i-j-k)!\mathrm{\Gamma }(2j+k+\lambda +1)\mathrm{\Gamma }(n-\nu (\tau )+(j+k)\vartheta +1)}}.$$

(21)

Proof. 

On account of (10) and by utilizing (5a), one obtains the following:

$${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)={\tau }^{n-\nu \left(\tau \right)}\sum _{k=0}^i{c}_k^{\left(i\right)}{\ell }^{-k\vartheta }{\displaystyle \frac{\mathrm{\Gamma }(k\vartheta +n+1)}{\mathrm{\Gamma }(k\vartheta +n-\nu (\tau )+1)}}{\tau }^{k\vartheta }.$$

(22)

By employing (13) and (22) takes the form (17) which yields the following:

$${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)={\tau }^{-\nu \left(\tau \right)}\left[{\mathrm{\Theta }}_{i,0}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right),{\mathrm{\Theta }}_{i,1}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right),\dots ,{\mathrm{\Theta }}_{i,i}^{(n,\vartheta )}\left(\nu \left(\tau \right)\right),0,\dots ,0\right]{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),$$

(23)

and this expression proves (18).    □

Theorem 2.

$D^m{\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$ can be formulated as follows:

$$D^m{\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)={\tau }^{-m}\sum _{j=0}^i{\mathrm{\Theta }}_{i,j}^{(n,\vartheta )}\left(m\right){\varphi }_{n,j}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),$$

(24)

and as a consequence, the $mth$-derivatives of ${\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$ has the following form:

$$D^m{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)={\tau }^{-m}{\mathbf{D}}_n^{(m,\vartheta )}{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right).$$

(25)

Proof. 

The proof follows analogous arguments to those presented in Theorem 1.    □

For instance, if $M=3,{\varsigma }_1={\varsigma }_2=0$, $m=1$ and $\nu \left(\tau \right)=\tau$ we obtain the following:

$${\mathbf{D}}_n^{(1,\vartheta )}={\left(\begin{array}{cccc}n& 0& 0& 0\\ \vartheta & \vartheta +n& 0& 0\\ \vartheta & 3\nu & 2\vartheta +n& 0\\ \vartheta & 3\vartheta & 5\vartheta & 3\vartheta +n\end{array}\right)}_{4\times 4},$$

(26)

and

$$\begin{array}{cc}\hfill & {\mathbf{D}}_n^{(\tau ,\vartheta )}=\hfill \\ \hfill & {\left(\begin{array}{cccc}{\displaystyle \frac{\mathrm{\Gamma }(n+1)}{\mathrm{\Gamma }(n-\tau +1)}}& 0& 0& 0\\ \\ {\displaystyle \frac{\mathrm{\Gamma }(n+\vartheta +1)}{\mathrm{\Gamma }(n-\tau +\vartheta +1)}}-{\displaystyle \frac{\mathrm{\Gamma }(n+1)}{\mathrm{\Gamma }(n-\tau +1)}}& {\displaystyle \frac{\mathrm{\Gamma }(n+\vartheta +1)}{\mathrm{\Gamma }(n-\tau +\vartheta +1)}}& 0& 0\\ \\ -{\displaystyle \frac{3\mathrm{\Gamma }(n+\vartheta +1)}{\mathrm{\Gamma }(n-\tau +\vartheta +1)}}+{\displaystyle \frac{2\mathrm{\Gamma }(n+2\vartheta +1)}{\mathrm{\Gamma }(n-\tau +2\vartheta +1)}}+{\displaystyle \frac{\mathrm{\Gamma }(n+1)}{\mathrm{\Gamma }(n-\tau +1)}}& {\displaystyle \frac{3\mathrm{\Gamma }(n+2\vartheta +1)}{\mathrm{\Gamma }(n-\tau +2\vartheta +1)}}-{\displaystyle \frac{3\mathrm{\Gamma }(n+\vartheta +1)}{\mathrm{\Gamma }(n-\tau +\vartheta +1)}}& {\displaystyle \frac{\mathrm{\Gamma }(n+2\vartheta +1)}{\mathrm{\Gamma }(n-\tau +2\vartheta +1)}}& 0\\ \\ {\displaystyle \frac{6\mathrm{\Gamma }(n+\vartheta +1)}{\mathrm{\Gamma }(n-\tau +\vartheta +1)}}-{\displaystyle \frac{10\mathrm{\Gamma }(n+2\vartheta +1)}{\mathrm{\Gamma }(n-\tau +2\vartheta +1)}}+{\displaystyle \frac{5\mathrm{\Gamma }(n+3\vartheta +1)}{\mathrm{\Gamma }(n-\tau +3\vartheta +1)}}-{\displaystyle \frac{\mathrm{\Gamma }(n+1)}{\mathrm{\Gamma }(n-\tau +1)}}& {\displaystyle \frac{6\mathrm{\Gamma }(n+\vartheta +1)}{\mathrm{\Gamma }(n-\tau +\vartheta +1)}}-{\displaystyle \frac{15\mathrm{\Gamma }(n+2\vartheta +1)}{\mathrm{\Gamma }(n-\tau +2\vartheta +1)}}+{\displaystyle \frac{9\mathrm{\Gamma }(n+3\vartheta +1)}{\mathrm{\Gamma }(n-\tau +3\vartheta +1)}}& {\displaystyle \frac{5\mathrm{\Gamma }(n+3\vartheta +1)}{\mathrm{\Gamma }(n-\tau +3\vartheta +1)}}-{\displaystyle \frac{5\mathrm{\Gamma }(n+2\vartheta +1)}{\mathrm{\Gamma }(n-\tau +2\vartheta +1)}}& {\displaystyle \frac{\mathrm{\Gamma }(n+3\vartheta +1)}{\mathrm{\Gamma }(n-\tau +3\vartheta +1)}}\\ \end{array}\right)}_{4\times 4}.\hfill \end{array}$$

(27)

5. Numerical Handling for MTVOFDE Subject to ICs

Here, we utilize the OMs obtained in Theorems 1 and 2 to derive NUMSs for (1) and (2).

5.1. Homogeneous ICs

Suppose we have homogeneous initial conditions (HICs), i.e., ${\omega }_s=0$, $s=0,1,2,\dots ,n-1$. We propose the approximate solution (APPS) to $\chi \left(\tau \right)$ as follows:

$${\displaystyle \chi \left(\tau \right)\simeq {\chi }_M\left(\tau \right)=\sum _{i=0}^M{c}_i{\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)={\mathit{A}}^T{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),}$$

(28)

where $\mathit{A}={\left[c_0,c_1,\dots ,c_M\right]}^T.$

Two Theorems 1 and 2 enable us to obtain the following:

$${}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{\chi }_M\left(\tau \right)=\left\{\begin{array}{c}{\tau }^{-\nu \left(\tau \right)}{\mathit{A}}^T{\mathbf{D}}_n^{\left(\nu \right(\tau \left)\right)}{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),\nu \left(\tau \right)isafunctionorfractionnumber,\hfill \\ {\tau }^{-m}{\mathit{A}}^T{\mathbf{D}}_n^{\left(m\right)}{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),\nu \left(\tau \right)=m,misaninteger.\hfill \end{array}\right.$$

(29)

By utilizing the approximations from (28) and (29), this method enables the representation of the residual in Equation (1):

$$\begin{array}{cc}& R_{n,M}\left(\tau \right)={\tau }^{-\nu \left(\tau \right)}{\mathit{A}}^T{\mathbf{D}}_n^{\left(\nu \right(\tau \left)\right)}{\mathrm{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)\hfill \\ & -F\left(\tau ,{\mathit{A}}^T{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),{\tau }^{-{\nu }_1\left(\tau \right)}{\mathit{A}}^T{\mathbf{D}}_n^{\left({\nu }_1\right)}{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),\dots ,{\tau }^{-{\nu }_m\left(\tau \right)}{\mathit{A}}^T{\mathbf{D}}_n^{\left({\nu }_m\right)}{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)\right).\hfill \end{array}$$

(30)

We suggest a spectral approach, referred to as GFJCOPMM using SCM and the computed previous OMs. The collocation nodes for GFJCOPMM are the $(M+1)$ roots of ${\mathrm{P}}_{\ell ,M+1}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)$ or, alternatively, the points ${\tau }_j={\displaystyle \frac{\ell (j+1)}{M+2}},j=0,1,\dots ,M$ in such a way that the following is obtained:

$$R_{n,M}\left({\tau }_j\right)=0,j=0,1,\dots ,M.$$

(31)

By solving (31) using Newton’s iterative method, we obtain the desired NUMSs (28).

5.2. Nonhomogeneous ICs

Here, the GFJCOPMM is developed to solve the system given in Equations (1) and (2) by converting it into an equivalent formulation with (HICs). This conversion takes the following format:

$$\overline{\chi }\left(\tau \right):=\chi \left(\tau \right)-q_n\left(\tau \right),q_n\left(\tau \right)=\sum _{i=0}^{n-1}{\displaystyle \frac{{\beta }_i}{i!}}{\tau }^i,$$

(32)

which leads to the following:

$$\begin{array}{cc}\hfill & {}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}\overline{\chi }\left(\tau \right)=-{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}{q}_n\left(\tau \right)\hfill \\ \hfill & +F\left(\tau ,\overline{\chi }\left(\tau \right)+q_n\left(\tau \right),{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{{\nu }_1\left(\tau \right)}(\overline{\chi }\left(\tau \right)+q_n\left(\tau \right)),{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{{\nu }_2\left(\tau \right)}(\overline{\chi }\left(\tau \right)+q_n\left(\tau \right)),\dots ,{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{{\nu }_m\left(\tau \right)}(\overline{\chi }\left(\tau \right)+q_n\left(\tau \right))\right),\hfill \end{array}$$

(33)

for $\tau \in [0,\ell ]$, where for $j=0,1,\dots ,n-1$, we set the following:

$${\overline{\chi }}^{\left(j\right)}\left(0\right)=0.$$

(34)

Therefore, one obtains the following:

$${\chi }_M\left(\tau \right)={\overline{\chi }}_M\left(\tau \right)+q_n\left(\tau \right).$$

(35)

Remark 2.

The algorithm presented to solve multiple numerical examples in Section 7. The computations were performed using Mathematica 13.3 on a computer system equipped with an Intel(R) Core(TM) i9-10850 CPU operating at 3.60 GHz, featuring 10 cores and 20 logical processors. The algorithmic steps for solving the VO-MTFDEs using GFJCOPMM are expressed as in Algorithm 1.

Algorithm 1 GFJCOPMM algorithm

Step 1. Given ${\varsigma }_1,{\varsigma }_2,\vartheta ,M,\nu \left)\right),{\nu }_i\left(\tau \right),i=1,2,\dots ,m$ and ${\omega }_s,s=0,1,\dots ,n-1$. Step 2. Define the basis ${\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$, the vectors $\mathit{A},{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$ and compute the elements of $(M+1)(M+1)$ matrices ${\mathbf{D}}_n^{\left(\nu \right(\tau ),\vartheta )},{\mathbf{D}}_n^{({\nu }_i\left(\tau \right),\vartheta )},i=0,1,\dots ,m$. Step 3. Evaluate ${\mathit{A}}^T{\mathbf{D}}_n^{\left(\nu \right(\tau ),\vartheta )}{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$ and ${\mathit{A}}^T{\mathbf{D}}_n^{({\nu }_i\left(\tau \right),\vartheta )}{\mathbf{\Phi }}_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),i=0,1,\dots ,m.$ Step 4. Define $R_{n,M}\left(\tau \right)$ as in Equation (30). Step 5. List $R_{n,M}\left({\tau }_i\right)=0,i=0,1,\dots ,M,$ defined in Equation (31). Step 6. Use Mathematica’s built-in numerical solver to obtain the solution to the system of equations in [Output 5]. Step 7. Evaluate ${\chi }_M\left(\tau \right)$ defined in Equation (28) (In the case of HICs). Step 8. Evaluate $q_n\left(\tau \right)$ and ${\chi }_M\left(\tau \right)$ defined in Equation (35) (In the case of Nonhomogeneous ICs).

Remark 3.

For interested readers, we utilized several built-in functions in Mathematica 13.3 for our numerical implementation of the provided algorithms. Below is a summary of the tools used, along with concise information about each function.

• Array: For creating and manipulating arrays, which are used to hold coefficients and operational matrices throughout the computations.
• NSolve: For finding numerical solutions to nonlinear algebraic equations; it is utilized to compute the zeros of ${\mathrm{P}}_{\ell ,M+1}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)$ or, alternatively, the points ${\tau }_j={\displaystyle \frac{\ell (j+1)}{M+2}},j=0,1,\dots ,M$.
• FindRoot: For solving equations by finding roots; it is essential in handling the nonlinear aspects of our system, using a zero initial approximation.
• JacobiP: For generating ${\varphi }_{n,i}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)$, which serve as basis functions that provide the foundation for approximating the solution in our collocation method.
• D: To compute ordinary derivatives to determine the defined residuals.
• LCaputoD: To compute Liouville–Caputo fractional derivatives to determine the defined residuals.
• Table: For generating lists and arrays of values based on specified formulas, particularly for collocation points and other parameterized data.

6. Error Analysis and Convergence Results

The following presents a thorough convergence analysis of the GFJCOPMM approach. With this respect, consider the following space:

$$W_{n,M}=Span\{{\varphi }_{n,0}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),{\varphi }_{n,1}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),\dots ,{\varphi }_{n,M}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)\}.$$

In addition, the absolute error (AE) between the true solution $\chi \left(\tau \right)$ and its approximation ${\chi }_M\left(\tau \right)$ is given by the following:

$$E_M\left(\tau \right)=\left|\chi \left(\tau \right)-{\chi }_M\left(\tau \right)\right|.$$

(36)

In this manuscript, the corresponding error obtained by GFJCOPMM is analyzed by using the $L_2$ norm, written as follows:

$$\parallel E_M{\parallel }_2={\parallel \chi -{\chi }_M\parallel }_2={\left({\int }_0^{\ell }{|\chi \left(\tau \right)-{\chi }_M\left(\tau \right)|}^{2}d\tau \right)}^{1/2},$$

(37)

and the $L_{\infty }$ (MAE) norm, written as follows:

$$\parallel E_M{\parallel }_{\infty }=\parallel \chi -{\chi }_M{\parallel }_{\infty }=\underset{\tau \in [0,\ell ]}{max}|\chi \left(\tau \right)-{\chi }_M\left(\tau \right)|.$$

(38)

Theorem 3.

Suppose that $\chi \left(\tau \right)={\tau }^{n}u\left(\tau \right)$ be the actual solution and ${\chi }_M\left(\tau \right)$ its best possible approximation (BPA) from the subspace $W_{n,M}$ having the form (28). Then, there exists a constant $K=K(n,M)>0$ such that the subsequent estimations hold:

$$\parallel E_M{\parallel }_{\infty }\le {\displaystyle \frac{K{\ell }^{n+1}}{2^{\lambda }}}{\left({\displaystyle \frac{e\ell }{4}}\right)}^M{(M+1)}^{q-M-1},$$

(39)

and

$$\parallel E_M{\parallel }_2\le {\displaystyle \frac{K{\ell }^{2n+3/2}}{2^{\lambda }}}{\left({\displaystyle \frac{e\ell }{4}}\right)}^M{(M+1)}^{q-M-1},$$

(40)

where $K=\underset{\tau \in [0,\ell ]}{max}\left|{\displaystyle \frac{d^{M+1}u\left(\eta \right)}{d{\tau }^{M+1}}}\right|,\eta \in [0,\ell ]$, and $q=max\{-{\displaystyle \frac{1}{2}},{\varsigma }_1,{\varsigma }_2\}<M+1$.

Proof. 

In view of Theorem 3.3 in the book (p.109) in [62], $u\left(\tau \right)$ takes the subsequent representation:

$$u\left(\tau \right)=u_M\left(\tau \right)+{\displaystyle \frac{K}{(M+1)!}}\prod _{k=0}^M(\tau -{\tau }_k),$$

(41)

where $u_M\left(\tau \right)$ represents the polynomial interpolation operator applied to $u\left(\tau \right)$ at the points ${\tau }_k$ for $k=0,1,\dots ,M,$ that staisfy ${\mathrm{P}}_{\ell ,M+1}^{({\varsigma }_1,{\varsigma }_2)}\left({\tau }_k\right)=0$ such that $M>q-1$. Then we obtain the following:

$$\parallel u-u_M{\parallel }_{\infty }\le {\displaystyle \frac{K}{(M+1)!}}\parallel \prod _{k=0}^M(\tau -{\tau }_k){\parallel }_{\infty }={\displaystyle \frac{K}{(M+1)!c_{M+1}^{M+1}}}{\parallel {\mathrm{P}}_{\ell ,M+1}^{({\varsigma }_1,{\varsigma }_2)}\left(\tau \right)\parallel }_{\infty },$$

(42)

where $c_{M+1}^{M+1}={\displaystyle \frac{\mathrm{\Gamma }(2M+\lambda +2)}{{\ell }^{M+1}(M+1)!\mathrm{\Gamma }(M+\lambda +1)}}$.

• Applying the identity from (formula (7.32.2)) in [60], we derive the following:

  $$\parallel {\mathrm{P}}_{\ell ,M+1}^{({\varsigma }_1,{\varsigma }_2)}{\parallel }_{\infty }\simeq {(M+1)}^q,$$

  (43)

  hence the following:

  $$\parallel u-u_M{\parallel }_{\infty }\le K{\displaystyle \frac{{\ell }^{M+1}\mathrm{\Gamma }(M+\lambda +1){(M+1)}^q}{\mathrm{\Gamma }(2M+\lambda +2)}},$$

  (44)

  By using [63] we obtain the following:

  $$\mathrm{\Gamma }(r+\lambda )=\mathcal{O}(r^{\lambda -1}r!),r!=\mathcal{O}\left(\sqrt{2\pi r}{\left({\displaystyle \frac{r}{e}}\right)}^r\right),\left(2r\right)!={\displaystyle \frac{1}{\sqrt{\pi }}}{4}^{r}r!\mathrm{\Gamma }(r+1/2),$$

  (45)

  and through algebraic manipulation, inequality (44) reduces to the following expression:

  $$\parallel u-u_M{\parallel }_{\infty }\le {\displaystyle \frac{K\ell }{2^{\lambda }}}{\left({\displaystyle \frac{e\ell }{4}}\right)}^M{(M+1)}^{q-M-1}.$$

  (46)

Let us set $\chi \left(\tau \right)\simeq Y_M\left(\tau \right)={\tau }^n{u}_M\left(\tau \right)$, to arrive at the following:

$$\parallel \chi -Y_M{\parallel }_{\infty }\le {\ell }^n{\parallel u-u_M\parallel }_{\infty }\le {\displaystyle \frac{K{\ell }^{n+1}}{2^{\lambda }}}{\left({\displaystyle \frac{e\ell }{4}}\right)}^M{(M+1)}^{q-M-1}.$$

(47)

Since the APPS ${\chi }_M\left(\tau \right)\in W_{n,M}$ shows the BPA to $\chi \left(\tau \right)$, one arrives at the following:

$$\parallel \chi -{\chi }_M{\parallel }_{\infty }\le {\parallel \chi -g\parallel }_{\infty },\forall g\in W_{n,M},$$

(48)

and

$$\parallel \chi -{\chi }_M{\parallel }_2\le {\parallel \chi -g\parallel }_2,\forall g\in W_{n,M}.$$

(49)

Therefore, we obtain the following:

$$\parallel \chi -{\chi }_M{\parallel }_{\infty }\le {\parallel \chi -Y_M\parallel }_{\infty }\le {\left({\displaystyle \frac{e\ell }{4}}\right)}^M{\displaystyle \frac{K{\ell }^{n+1}}{2^{\lambda }}}{(M+1)}^{q-M-1},$$

(50)

and

$$\parallel \chi -{\chi }_M{\parallel }_2\le \parallel \chi -Y_M{\parallel }_2\le {\ell }^n{\parallel u-u_M\parallel }_2={\ell }^n\sqrt{{\int }_0^{\ell }{|u\left(\tau \right)-u_M\left(\tau \right)|}^{2}d\tau }\le {\displaystyle \frac{K{\ell }^{2n+3/2}}{2^{\lambda }}}{\left({\displaystyle \frac{e\ell }{4}}\right)}^M{(M+1)}^{q-M-1}.$$

(51)

□

The following implication establishes the rapid convergence of the approximation errors:

Corollary 1.

The subsequent estimations hold for all $M>q-1$:

$$\parallel E_M{\parallel }_{\infty }=\mathcal{O}\left({(e\ell /4)}^M{M}^{q-M-1}\right),$$

(52)

and

$$\parallel E_M{\parallel }_2=\mathcal{O}\left({(e\ell /4)}^M{M}^{q-M-1}\right).$$

(53)

The theorem presented below illustrates the stability of errors, specifically regarding error propagation calculations.

Theorem 4.

Given any two iterative estimates of $\chi \left(\tau \right)$, the result is as follows:

$$|{\chi }_{M+1}-{\chi }_M|=\mathcal{O}\left({(e\ell /4)}^M{M}^{q-M-1}\right),$$

(54)

Proof. 

We have the following:

$$|{\chi }_{M+1}-{\chi }_M|=|{\chi }_{M+1}-\chi +\chi -{\chi }_M|\le |\chi -{\chi }_{M+1}|+|\chi -{\chi }_M|\le \parallel E_{M+1}{\parallel }_{\infty }+{\parallel E_M\parallel }_{\infty },$$

(55)

By considering (52), we can obtain (54). □

7. Numerical Simulations

In this portion, numerical computations are provided to illustrate that GFJCOPMM has high efficiency. In these examples, we show that the GFJCOPMM provides spectrally exact solutions for problems admitting polynomial solutions of degree N or less, as verified numerically in Examples 1–4. The method achieves exact solutions for select non-polynomial cases where the true solution can be represented exactly by the chosen basis, as verified in Example 5.

Table 1, Table 2, Table 4, and Table 5 demonstrate the superior accuracy of GFJCOPMM, with computed errors significantly smaller than those obtained by existing methods [17,18,19,21,36,49]. In addition, Table 3 presents the computed error norms for the numerical solutions ${\chi }_M\left(\tau \right)$ obtained via GFJCOPMM. Furthermore, Figure 1, Figure 2 and Figure 3 exhibit excellent visual agreement between actual and approximate solutions in Example 4.

Table 1. Supremum norm error $\parallel E_M{\parallel }_{\infty }$ comparison: GFJCOPMM versus reference methods [17,18] in Example 1.

	GFJCOPMM	Method in [18]			Method in [17]
ℓ	$\mathbf{M}=\mathbf{0}$	$\mathbf{M}=\mathbf{3}$	$\mathbf{M}=\mathbf{4}$	$\mathbf{M}=\mathbf{5}$	$\mathbf{M}=\mathbf{3}$	$\mathbf{M}=\mathbf{4}$	$\mathbf{M}=\mathbf{5}$
1	0	0	0	0	0	2.2204$\times {10}^{-16}$	2.2204$\times {10}^{-16}$
2	0	0	0	0	0	4.4409$\times {10}^{-16}$	1.3323$\times {10}^{-15}$
4	0	0	0	0	2.2204$\times {10}^{-16}$	3.5527$\times {10}^{-15}$	3.1974$\times {10}^{-14}$

Table 1. Supremum norm error $\parallel E_M{\parallel }_{\infty }$ comparison: GFJCOPMM versus reference methods [17,18] in Example 1.

	GFJCOPMM	Method in [18]			Method in [17]
ℓ	$\mathbf{M}=\mathbf{0}$	$\mathbf{M}=\mathbf{3}$	$\mathbf{M}=\mathbf{4}$	$\mathbf{M}=\mathbf{5}$	$\mathbf{M}=\mathbf{3}$	$\mathbf{M}=\mathbf{4}$	$\mathbf{M}=\mathbf{5}$
1	0	0	0	0	0	2.2204$\times {10}^{-16}$	2.2204$\times {10}^{-16}$
2	0	0	0	0	0	4.4409$\times {10}^{-16}$	1.3323$\times {10}^{-15}$
4	0	0	0	0	2.2204$\times {10}^{-16}$	3.5527$\times {10}^{-15}$	3.1974$\times {10}^{-14}$

Table 2. Supremum norm error $\parallel E_M{\parallel }_{\infty }$ comparison: GFJCOPMM versus reference methods [18,19,21] in Example 3.

$\mathit{\tau }$	GFJCOPMM $(\mathit{M}=0)$	Ref. [21]  $(\mathit{M}=4)$	Ref. [19] $(\mathit{M}=2)$	Ref. [18]  $(\mathit{M}=2)$
0.2	0	8.091305$\times {10}^{-12}$	1.818101$\times {10}^{-12}$	0
0.4	0	2.024535$\times {10}^{-12}$	1.817213$\times {10}^{-12}$	8.881784$\times {10}^{-16}$
0.6	0	9.564669$\times {10}^{-12}$	1.820765$\times {10}^{-12}$	1.776356$\times {10}^{-15}$
0.8	0	1.696030$\times {10}^{-12}$	1.818989$\times {10}^{-12}$	1.776356$\times {10}^{-15}$
1.0	0	1.734222$\times {10}^{-12}$	1.818989$\times {10}^{-12}$	0

Table 2. Supremum norm error $\parallel E_M{\parallel }_{\infty }$ comparison: GFJCOPMM versus reference methods [18,19,21] in Example 3.

$\mathit{\tau }$	GFJCOPMM $(\mathit{M}=0)$	Ref. [21]  $(\mathit{M}=4)$	Ref. [19] $(\mathit{M}=2)$	Ref. [18]  $(\mathit{M}=2)$
0.2	0	8.091305$\times {10}^{-12}$	1.818101$\times {10}^{-12}$	0
0.4	0	2.024535$\times {10}^{-12}$	1.817213$\times {10}^{-12}$	8.881784$\times {10}^{-16}$
0.6	0	9.564669$\times {10}^{-12}$	1.820765$\times {10}^{-12}$	1.776356$\times {10}^{-15}$
0.8	0	1.696030$\times {10}^{-12}$	1.818989$\times {10}^{-12}$	1.776356$\times {10}^{-15}$
1.0	0	1.734222$\times {10}^{-12}$	1.818989$\times {10}^{-12}$	0

Table 3. MAEs for Example 4 using different values for ${\varsigma }_1,{\varsigma }_2$ and M and $\vartheta =0.5$.

${\mathit{\varsigma }}_1$	${\mathit{\varsigma }}_2$	$\mathbf{Errors}$	$\mathit{M}=1$	$\mathit{M}=2$	$\mathit{M}=3$	$\mathit{M}=4$	$\mathit{M}=5$	$\mathit{M}=6$
0	0	$\parallel E_M{\parallel }_{\infty }$	1.29$\times {10}^{-1}$	3.00$\times {10}^{-2}$	4.85$\times {10}^{-3}$	5.55$\times {10}^{-4}$	1.00$\times {10}^{-15}$	1.33$\times {10}^{-16}$
		$\parallel E_M{\parallel }_2$	7.49$\times {10}^{-2}$	1.71$\times {10}^{-2}$	2.47$\times {10}^{-3}$	1.81$\times {10}^{-4}$	5.51$\times {10}^{-16}$	5.14$\times {10}^{-16}$
		CPU time	0.133	0.301	0.402	0.431	0.445	0.551
1	1	$\parallel E_M{\parallel }_{\infty }$	1.92$\times {10}^{-1}$	3.31$\times {10}^{-2}$	9.18$\times {10}^{-3}$	1.11$\times {10}^{-3}$	5.00$\times {10}^{-16}$	7.76$\times {10}^{-16}$
		$\parallel E_M{\parallel }_2$	5.73$\times {10}^{-2}$	1.54$\times {10}^{-2}$	3.42$\times {10}^{-3}$	3.63$\times {10}^{-4}$	3.54$\times {10}^{-16}$	3.51$\times {10}^{-16}$
		CPU time	0.124	0.313	0.404	0.426	0.428	0.514
−1/2	1/2	$\parallel E_M{\parallel }_{\infty }$	1.67$\times {10}^{-1}$	5.47$\times {10}^{-2}$	1.25$\times {10}^{-2}$	1.35$\times {10}^{-3}$	8.88$\times {10}^{-16}$	7.77$\times {10}^{-16}$
		$\parallel E_M{\parallel }_2$	9.90$\times {10}^{-2}$	2.42$\times {10}^{-2}$	4.32$\times {10}^{-3}$	3.92$\times {10}^{-4}$	5.15$\times {10}^{-16}$	2.50$\times {10}^{-16}$
		CPU time	0.120	0.309	0.398	0.410	0.419	0.497
1/2	−1/2	$\parallel E_M{\parallel }_{\infty }$	1.44$\times {10}^{-1}$	2.72$\times {10}^{-2}$	7.10$\times {10}^{-3}$	8.46$\times {10}^{-4}$	7.78$\times {10}^{-16}$	7.78$\times {10}^{-16}$
		$\parallel E_M{\parallel }_2$	5.43$\times {10}^{-2}$	1.33$\times {10}^{-2}$	2.41$\times {10}^{-3}$	2.31$\times {10}^{-4}$	6.50$\times {10}^{-16}$	6.33$\times {10}^{-16}$
		CPU time	0.129	0.381	0.422	0.443	0.447	0.552

Table 3. MAEs for Example 4 using different values for ${\varsigma }_1,{\varsigma }_2$ and M and $\vartheta =0.5$.

${\mathit{\varsigma }}_1$	${\mathit{\varsigma }}_2$	$\mathbf{Errors}$	$\mathit{M}=1$	$\mathit{M}=2$	$\mathit{M}=3$	$\mathit{M}=4$	$\mathit{M}=5$	$\mathit{M}=6$
0	0	$\parallel E_M{\parallel }_{\infty }$	1.29$\times {10}^{-1}$	3.00$\times {10}^{-2}$	4.85$\times {10}^{-3}$	5.55$\times {10}^{-4}$	1.00$\times {10}^{-15}$	1.33$\times {10}^{-16}$
		$\parallel E_M{\parallel }_2$	7.49$\times {10}^{-2}$	1.71$\times {10}^{-2}$	2.47$\times {10}^{-3}$	1.81$\times {10}^{-4}$	5.51$\times {10}^{-16}$	5.14$\times {10}^{-16}$
		CPU time	0.133	0.301	0.402	0.431	0.445	0.551
1	1	$\parallel E_M{\parallel }_{\infty }$	1.92$\times {10}^{-1}$	3.31$\times {10}^{-2}$	9.18$\times {10}^{-3}$	1.11$\times {10}^{-3}$	5.00$\times {10}^{-16}$	7.76$\times {10}^{-16}$
		$\parallel E_M{\parallel }_2$	5.73$\times {10}^{-2}$	1.54$\times {10}^{-2}$	3.42$\times {10}^{-3}$	3.63$\times {10}^{-4}$	3.54$\times {10}^{-16}$	3.51$\times {10}^{-16}$
		CPU time	0.124	0.313	0.404	0.426	0.428	0.514
−1/2	1/2	$\parallel E_M{\parallel }_{\infty }$	1.67$\times {10}^{-1}$	5.47$\times {10}^{-2}$	1.25$\times {10}^{-2}$	1.35$\times {10}^{-3}$	8.88$\times {10}^{-16}$	7.77$\times {10}^{-16}$
		$\parallel E_M{\parallel }_2$	9.90$\times {10}^{-2}$	2.42$\times {10}^{-2}$	4.32$\times {10}^{-3}$	3.92$\times {10}^{-4}$	5.15$\times {10}^{-16}$	2.50$\times {10}^{-16}$
		CPU time	0.120	0.309	0.398	0.410	0.419	0.497
1/2	−1/2	$\parallel E_M{\parallel }_{\infty }$	1.44$\times {10}^{-1}$	2.72$\times {10}^{-2}$	7.10$\times {10}^{-3}$	8.46$\times {10}^{-4}$	7.78$\times {10}^{-16}$	7.78$\times {10}^{-16}$
		$\parallel E_M{\parallel }_2$	5.43$\times {10}^{-2}$	1.33$\times {10}^{-2}$	2.41$\times {10}^{-3}$	2.31$\times {10}^{-4}$	6.50$\times {10}^{-16}$	6.33$\times {10}^{-16}$
		CPU time	0.129	0.381	0.422	0.443	0.447	0.552

Table 4. Supremum norm error $\parallel E_M{\parallel }_{\infty }$ comparison: GFJCOPMM versus reference methods [36] in Example 4.

	GFJCOPMM $({\mathit{\varsigma }}_1=0,{\mathit{\varsigma }}_2=0,\mathit{\vartheta }=0.5)$			[36]
$\mathbf{\tau }$	$\mathbf{M}=\mathbf{2}$	$\mathbf{M}=\mathbf{6}$	$\mathbf{M}=\mathbf{10}$	$\mathbf{M}=\mathbf{2}$	$\mathbf{M}=\mathbf{6}$	$\mathbf{M}=\mathbf{10}$
0.2	3.18$\times {10}^{-4}$	1.06$\times {10}^{-16}$	5.81$\times {10}^{-17}$	5.69$\times {10}^{-3}$	9.75$\times {10}^{-6}$	8.06$\times {10}^{-7}$
0.4	1.37$\times {10}^{-4}$	1.25$\times {10}^{-16}$	1.25$\times {10}^{-17}$	2.34$\times {10}^{-3}$	8.02$\times {10}^{-6}$	6.34$\times {10}^{-7}$
0.6	1.22$\times {10}^{-4}$	1.11$\times {10}^{-16}$	0	2.78$\times {10}^{-3}$	7.03$\times {10}^{-6}$	5.53$\times {10}^{-7}$
0.8	2.18$\times {10}^{-4}$	1.11$\times {10}^{-16}$	5.00$\times {10}^{-17}$	2.52$\times {10}^{-3}$	5.97$\times {10}^{-6}$	4.59$\times {10}^{-7}$
1.0	1.16$\times {10}^{-4}$	4.44$\times {10}^{-16}$	1.11$\times {10}^{-17}$	1.66$\times {10}^{-2}$	2.89$\times {10}^{-5}$	1.95$\times {10}^{-6}$

Table 4. Supremum norm error $\parallel E_M{\parallel }_{\infty }$ comparison: GFJCOPMM versus reference methods [36] in Example 4.

	GFJCOPMM $({\mathit{\varsigma }}_1=0,{\mathit{\varsigma }}_2=0,\mathit{\vartheta }=0.5)$			[36]
$\mathbf{\tau }$	$\mathbf{M}=\mathbf{2}$	$\mathbf{M}=\mathbf{6}$	$\mathbf{M}=\mathbf{10}$	$\mathbf{M}=\mathbf{2}$	$\mathbf{M}=\mathbf{6}$	$\mathbf{M}=\mathbf{10}$
0.2	3.18$\times {10}^{-4}$	1.06$\times {10}^{-16}$	5.81$\times {10}^{-17}$	5.69$\times {10}^{-3}$	9.75$\times {10}^{-6}$	8.06$\times {10}^{-7}$
0.4	1.37$\times {10}^{-4}$	1.25$\times {10}^{-16}$	1.25$\times {10}^{-17}$	2.34$\times {10}^{-3}$	8.02$\times {10}^{-6}$	6.34$\times {10}^{-7}$
0.6	1.22$\times {10}^{-4}$	1.11$\times {10}^{-16}$	0	2.78$\times {10}^{-3}$	7.03$\times {10}^{-6}$	5.53$\times {10}^{-7}$
0.8	2.18$\times {10}^{-4}$	1.11$\times {10}^{-16}$	5.00$\times {10}^{-17}$	2.52$\times {10}^{-3}$	5.97$\times {10}^{-6}$	4.59$\times {10}^{-7}$
1.0	1.16$\times {10}^{-4}$	4.44$\times {10}^{-16}$	1.11$\times {10}^{-17}$	1.66$\times {10}^{-2}$	2.89$\times {10}^{-5}$	1.95$\times {10}^{-6}$

Table 5. Supremum norm error $\parallel E_M{\parallel }_{\infty }$ comparison: GFJCOPMM versus reference methods [49] in Example 5.

	$\mathbf{GFJCOPMM}(\mathit{M}=1)$	Ref. [49] (k = 2 and M = 7)
$\mathbf{\tau }$	$\mathbf{\vartheta }=\mathbf{\gamma }=\mathbf{0}.\mathbf{5},\mathbf{0}.\mathbf{8}$	$\mathbf{\gamma }=\mathbf{0}.\mathbf{5}$	$\mathbf{\gamma }=\mathbf{0}.\mathbf{8}$
0.0	0	8.43745 × ${10}^{-10}$	1.26942 × ${10}^{-5}$
0.1	0	1.42121 × ${10}^{-9}$	2.00086 × ${10}^{-6}$
0.2	0	1.95085 × ${10}^{-9}$	2.94462 × ${10}^{-6}$
0.3	0	1.95085 × ${10}^{-8}$	2.86427 × ${10}^{-6}$
0.4	0	1.47103 × ${10}^{-8}$	1.51048 × ${10}^{-6}$
0.5	0	1.13654 × ${10}^{-8}$	3.96870 × ${10}^{-4}$
0.6	0	8.98023 × ${10}^{-9}$	3.60302 × ${10}^{-4}$
0.7	0	7.46806 × ${10}^{-9}$	3.23654 × ${10}^{-4}$
0.8	0	6.97788 × ${10}^{-9}$	2.85101 × ${10}^{-4}$
0.9	0	7.78465 × ${10}^{-9}$	2.39836 × ${10}^{-4}$
1.0	0	1.02211 × ${10}^{-8}$	1.76092 × ${10}^{-4}$

Table 5. Supremum norm error $\parallel E_M{\parallel }_{\infty }$ comparison: GFJCOPMM versus reference methods [49] in Example 5.

	$\mathbf{GFJCOPMM}(\mathit{M}=1)$	Ref. [49] (k = 2 and M = 7)
$\mathbf{\tau }$	$\mathbf{\vartheta }=\mathbf{\gamma }=\mathbf{0}.\mathbf{5},\mathbf{0}.\mathbf{8}$	$\mathbf{\gamma }=\mathbf{0}.\mathbf{5}$	$\mathbf{\gamma }=\mathbf{0}.\mathbf{8}$
0.0	0	8.43745 × ${10}^{-10}$	1.26942 × ${10}^{-5}$
0.1	0	1.42121 × ${10}^{-9}$	2.00086 × ${10}^{-6}$
0.2	0	1.95085 × ${10}^{-9}$	2.94462 × ${10}^{-6}$
0.3	0	1.95085 × ${10}^{-8}$	2.86427 × ${10}^{-6}$
0.4	0	1.47103 × ${10}^{-8}$	1.51048 × ${10}^{-6}$
0.5	0	1.13654 × ${10}^{-8}$	3.96870 × ${10}^{-4}$
0.6	0	8.98023 × ${10}^{-9}$	3.60302 × ${10}^{-4}$
0.7	0	7.46806 × ${10}^{-9}$	3.23654 × ${10}^{-4}$
0.8	0	6.97788 × ${10}^{-9}$	2.85101 × ${10}^{-4}$
0.9	0	7.78465 × ${10}^{-9}$	2.39836 × ${10}^{-4}$
1.0	0	1.02211 × ${10}^{-8}$	1.76092 × ${10}^{-4}$

Example 1.

Consider DE [17,18], as follows:

$$\left\{\begin{array}{c}{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{2\tau }\chi \left(\tau \right)+{\tau }^{1/2}{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\tau /3}\chi \left(\tau \right)+{\tau }^{1/3}{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\tau /4}\chi \left(\tau \right)+{\tau }^{1/4}{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\tau /5}\chi \left(\tau \right)+{\tau }^{1/5}\chi \left(\tau \right)=f\left(\tau \right),\tau \in [0,\ell ],\hfill \\ \chi \left(0\right)=2,\mathrm{and}{\chi }^{\prime }\left(0\right)=0.\hfill \end{array}\right.$$

(56)

Here, the forcing function $f\left(\tau \right)$ is specifically selected to have the actual true solution $\chi \left(\tau \right)=2-{\displaystyle \frac{{\tau }^2}{2}}$.

By utilizing of $GFJCOPMM$, we reach the following:

$$\chi \left(\tau \right)={\chi }_0\left(\tau \right)=c_0{\varphi }_{2,0}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)+2,$$

where $c_0=-1/2$.

Example 2.

In the second test problem, we consider Bagley–Torvik equation [18,64], written as follows:

$$\left\{\begin{array}{cc}\hfill & D^2\chi \left(\tau \right)+{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{2/3}\chi \left(\tau \right)+\chi \left(\tau \right)={\tau }^2+4\sqrt{\tau /\pi }+2,\tau \in [0,\ell ],\hfill \\ \hfill & \chi \left(0\right)=0,{\chi }^{\prime }\left(0\right)=0.\hfill \end{array}\right.$$

(57)

One can easily show that the actual solution is $\chi \left(\tau \right)={\tau }^2$. Applying GFJCOPMM produces the following:

$$\chi \left(\tau \right)={\chi }_0\left(\tau \right)=c_0{\varphi }_{2,0}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right),$$

where $c_0=1$.

Remark 4.

It is worthy to note that the true actual solution of (57) when $M=0,{\varsigma }_1,{\varsigma }_2>-1$, while the researchers in [18], gave it was when $M=2$. Moreover, in [64], it was gotten when $M\to \infty$, the best error was $2\times {10}^{-10}$.

Example 3.

Consider the DE of the following form [18,19,21]:

$$\left\{\begin{array}{c}{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}\chi \left(\tau \right)-10D\chi \left(\tau \right)+\chi \left(\tau \right)=10\left({\displaystyle \frac{{\tau }^{2-\nu \left(\tau \right)}}{\mathrm{\Gamma }(3-\nu (\tau \left)\right)}}+{\displaystyle \frac{{\tau }^{1-\nu \left(\tau \right)}}{\mathrm{\Gamma }(2-\nu (\tau \left)\right)}}\right)+5{\tau }^2-90-\tau -95,\hfill \\ \chi \left(0\right)=5,{\chi }^{\prime }\left(0\right)=10.\hfill \end{array}\right.$$

(58)

Here $\tau \in [0,1]$ and we have $\nu \left(\tau \right)={\displaystyle \frac{\tau +2e^{\tau }}{7}}$ and $\chi \left(\tau \right)=5{(\tau +1)}^2$. Applying the GFJCOPMM leads to the following:

$$\chi \left(\tau \right)={\chi }_0\left(\tau \right)=c_0{\varphi }_{2,0}^{({\varsigma }_1,{\varsigma }_2,\vartheta )}\left(\tau \right)+5+10\tau ,$$

where $c_0=5$.

Example 4.

Let us pay attention to the following nonlinear initial value problem [36,65]:

$$\left\{\begin{array}{c}{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\nu \left(\tau \right)}\chi \left(\tau \right)+sin\left(\tau \right){\chi }^2\left(\tau \right)={\displaystyle \frac{\mathrm{\Gamma }(9/2){\tau }^{7/2-\nu \left(\tau \right)}}{\mathrm{\Gamma }(9/2-\nu (\tau \left)\right)}}+sin\left(\tau \right){\tau }^7,0<\nu \left(\tau \right)\le 1,\tau \in [0,1],\hfill \\ \chi \left(0\right)=0,\nu \left(\tau \right)=1-0.5e^{-\tau },\hfill \end{array}\right.$$

(59)

with the actual solution given by $\chi \left(\tau \right)={\tau }^{7/2}$.

Table 3 shows that the application of $GFJCOPMM$ using $\vartheta =0.5,M=5$ and various values of ${\varsigma }_1$ and ${\varsigma }_2$ leads to accuracy ${10}^{-15}$ and ${10}^{-16}$. For example, using ${\varsigma }_1=1/2,{\varsigma }_2=-1/2$, the NUMSs ${\chi }_5\left(\tau \right)$ has the following form:

$$\begin{array}{cc}\hfill {\chi }_5\left(\tau \right)& =2.61735\times {10}^{-14}\tau -2.38032\times {10}^{-13}{\tau }^{3/2}+8.20011\times {10}^{-13}{\tau }^2-1.36069\times {10}^{-12}{\tau }^{5/2}\hfill \\ \hfill & +1.09202\times {10}^{-12}{\tau }^3+{\tau }^{7/2},\hfill \end{array}$$

with$\parallel E_5{\parallel }_{\infty }=7.78\times {10}^{-16}.$

Remark 5.

To better understand the effectiveness of the proposed method, we have included Figure 4 and Figure 5, which utilize larger time intervals. We believe these new figures enhance the comparison analysis and provide clearer insights into the performance and robustness of our methodology across different scenarios.

Example 5.

The last example is a DE of the following form [49]:

$$\left\{\begin{array}{c}{}_{0 }{}^{LC}\mathbb{D}_{\tau }^{\gamma \left(\tau \right)}\chi \left(\tau \right)+{\left(\chi \left(\tau \right)\right)}^2=t+{\left({\displaystyle \frac{{\tau }^{\gamma +1}}{\mathrm{\Gamma }(\gamma +2)}}\right)}^2,\gamma \in (0,1],\tau \in [0,1],\hfill \\ \chi \left(0\right)=0,\hfill \end{array}\right.$$

(60)

where $\chi \left(\tau \right)={\displaystyle \frac{{\tau }^{\gamma +1}}{\mathrm{\Gamma }(\gamma +2)}}$ is the true solution. The application of GFJCOPMM gives us the following:

$$\chi \left(\tau \right)={\chi }_1\left(\tau \right)=c_0{\varphi }_{1,0}^{({\varsigma }_1,{\varsigma }_2,\gamma )}\left(\tau \right)+c_1{\varphi }_{1,1}^{({\varsigma }_1,{\varsigma }_2,\gamma )}\left(\tau \right),$$

where $c_0={\displaystyle \frac{{\varsigma }_2+1}{(\lambda +1)\mathrm{\Gamma }(\gamma +2)}}$ and $c_1={\displaystyle \frac{1}{(\lambda +1)\mathrm{\Gamma }(\gamma +2)}}$.

Remark 6.

In view of the presented CPU time (in seconds), our approach has efficient performance. The calculations show that the memory consumption was excellent. For example, Table 3 shows that the calculated CPU time using $M=6$ is 10% slower than $M=3$ and, moreover, requires increasing 25% of memory consumption of RAM compared to the $M=3$ calculation. The numerical examples and comparisons provided in our paper highlight the superior accuracy and efficiency of our algorithm, solidifying its potential for solving VO-MTFDEs effectively. In contrast, the methods described in [17,18,19,21,36,49] did not provide CPU time or memory usage data. However, our analysis suggests that our approach performs better than these referenced methods.

Remark 7.

Our experiments indicate that the performance of the proposed methodology is relatively stable across a range of values for the parameters ${\varsigma }_1,{\varsigma }_2,\vartheta ,$ as we show in Table 3, allowing for flexibility in their selection based on specific problem requirements. Furthermore, we suggest that practitioners can conduct preliminary tests with varying parameter values to determine the most suitable configuration for their particular applications. This approach ensures that users can tailor the methodology to their needs while still achieving effective results.

8. Conclusions

In this work, we introduced Generalized Fractional Jacobi Functions (GFJFs) that inherently satisfy the given initial conditions. By combining these functions with operational matrices (OMs) in a spectral collocation method (SCM), we develop the Generalized Fractional Jacobi Collocation Operational Matrix Method (GFJCOPMM). This approach yields highly accurate numerical solutions (NUMSs) with computational efficiency. However, it is important to acknowledge some limitations of the proposed method. The performance of GFJCOPMM may be sensitive to the selection of parameters, such as ${\varsigma }_1,{\varsigma }_2,\vartheta ,$ which can affect the accuracy of the solutions. Additionally, while the method shows promise for a range of FDEs, its applicability to highly nonlinear or complex boundary value problems remains to be fully explored. Future work will extend GFJCOPMM to boundary value problems. Moreover, the theoretical framework presented here can be generalized to solve broader classes of FDEs, such as the following: variable-order fractional systems, multi-term fractional operators, and nonlinear fractional PDEs under diverse initial/boundary conditions.