Next Article in Journal
Semidefinite Multiobjective Mathematical Programming Problems with Vanishing Constraints Using Convexificators
Next Article in Special Issue
Study on Date–Jimbo–Kashiwara–Miwa Equation with Conformable Derivative Dependent on Time Parameter to Find the Exact Dynamic Wave Solutions
Previous Article in Journal / Special Issue
Dynamics of Fractional Model of Biological Pest Control in Tea Plants with Beddington–DeAngelis Functional Response
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Designing a Matrix Collocation Method for Fractional Delay Integro-Differential Equations with Weakly Singular Kernels Based on Vieta–Fibonacci Polynomials

1
Department of Mathematics, Rasht Branch, Islamic Azad University, Rasht 413353516, Iran
2
Department of Mathematics, Near East University TRNC, Mersin 10, Nicosia 99138, Turkey
3
Department of Mathematics, Faculty of Arts and Sciences, Cankaya University, Ankara 06530, Turkey
4
Institute of Space Sciences, R-76900 Magurele-Bucharest, Romania
5
Department of Medical Research, China Medical University, Taichung 40447, Taiwan
6
Faculty of Engineering and Natural Sciences, Bahcesehir University, Istanbul 34349, Turkey
7
Research Institute for Natural Sciences, Hanyang University, Seoul 04763, Korea
*
Authors to whom correspondence should be addressed.
Fractal Fract. 2022, 6(1), 2; https://doi.org/10.3390/fractalfract6010002
Submission received: 10 October 2021 / Revised: 19 November 2021 / Accepted: 21 November 2021 / Published: 22 December 2021
(This article belongs to the Special Issue Recent Advances in Computational Physics with Fractional Application)

Abstract

:
In the present work, the numerical solution of fractional delay integro-differential equations (FDIDEs) with weakly singular kernels is addressed by designing a Vieta–Fibonacci collocation method. These equations play immense roles in scientific fields, such as astrophysics, economy, control, biology, and electro-dynamics. The emerged fractional derivative is in the Caputo sense. By resultant operational matrices related to the Vieta–Fibonacci polynomials (VFPs) for the first time accompanied by the collocation method, the problem taken into consideration is converted into a system of algebraic equations, the solving of which leads to an approximate solution to the main problem. The existence and uniqueness of the solution of this category of fractional delay singular integro-differential equations (FDSIDEs) are investigated and proved using Krasnoselskii’s fixed-point theorem. A new formula for extracting the VFPs and their derivatives is given, and the orthogonality of the derivatives of VFPs is easily proved via it. An error bound of the residual function is estimated in a Vieta–Fibonacci-weighted Sobolev space, which shows that by properly choosing the number of terms of the series solution, the approximation error tends to zero. Ultimately, the designed algorithm is examined on four FDIDEs, whose results display the simple implementation and accuracy of the proposed scheme, compared to ones obtained from previous methods. Furthermore, the orthogonality of the VFPs leads to having sparse operational matrices, which makes the execution of the presented method easy.

1. Introduction

Numerous works have been devoted to numerically solving fractional integro-differential equations with weakly singular kernels. These equations emerged in diverse fields of science, such as the heat conduction problem, radiative equilibrium, elasticity, and fracture mechanics [1,2,3,4]. Determining the analytic solutions of fractional integro-differential equations with weakly singular kernels is often complicated and even infeasible. Therefore, finding new numerical methods or developing existing methods to solve this class of equations is unavoidable. Hence, different computing methods have been presented, for example, Mohammadi used block-pulse functions for solving fractional integro-differential equations with weakly singular kernels [5]. Wang et al. applied second-kind Chebyshev wavelets to the fractional integro-differential equations with a weakly singular kernel [6]. Authors in [7] used a Jacobi collocation method to obtain analytically approximate solutions of weakly singular integro-differential equations. Du et al. proposed a stable least residual method for nonlinear fractional integro-differential equations with weakly singular kernels [8]. Ghanbari et al. focused on a novel high-order algorithm for a class of linear fractional integro-differential algebraic equations with weakly singular kernels [9].
Delay differential equations and delay integro-differential equations play an influential role in different fields of science, such as astrophysics, economy, control, biology, and electrodynamics [10,11,12,13]. In a time-delay equation, the feature of a modeled process depends not only on its current state, but also on its past evolution. Due to these equations appearing in diverse fields and the complexity of their solution, researchers have attempted to present some efficient schemes. For example, Rezabeyk et al. used fractional-order Euler polynomials for solving FDIDEs [14]. Yapman et al. applied a homogeneous second-order difference method for a singular perturbed Volterra delay integro-differential equation [15]. Authors in [16] constructed an operational matrix formulation of the Tau method to solve a class of delay fractional integro-differential equations. A shifted Jacobi polynomial scheme was considered for the fractional delay differential equations in [17]. The Bernoulli wavelets method was employed by Rahimkhani et al. for fractional delay differential equations [18]. Developing the operational Tau method to solve delay Fredholm and Volterra integro-differential equations was the concern of authors in [19]. Liu et al. applied the split-step theta method for stochastic delay integro-differential equations [20].
The spectral methods are one of the most popular and efficient methods for enjoying the exponential convergence property. Among these methods, the Galerkin, Tau, and collocation methods are the most widely used spectral methods. The nature of the spectral methods is joined to orthogonal functions and especially orthogonal polynomials. Hence, different orthogonal functions and polynomials were taken into account as basis functions in the spectral methods. Some of these applications can be mentioned as follows: a Legendre collocation method was proposed by Singh and Mehra [21]. The obtained approximations from the Chebyshev and Legendre polynomials methods are compared together for achieving a better result for solving two-dimensional Volterra–Fredholm integral equations [22]. Nemati et al. introduced a numerical method based on Bernoulli polynomials for solving multi-term variable-order fractional differential equations [23]. In [24], the shifted Gegenbauer polynomials involved in a novel operational matrices-based method are suggested for fractional-order delay differential equations. The Bernoulli wavelet method is proposed in [25] for neural delay differential equations. Biazar and Sadri applied two-variable Jacobi polynomials to solve some time-fractional partial differential equations [26]. A numerical scheme based on two-variable Bernstein polynomials was developed to solve two-dimensional fractional nonlinear integral equations [27]. Jie et al. proposed the Legendre orthogonal polynomial method to calculate the reflection transmission coefficients of fluid-loaded functionally gradient plates [28]. Sahlan et al. constructed fractional-order Bernoulli wavelets and employed Galerkin and collocation methods to evaluate the numerical solution of fractional-order diffusion wave equations [29], and so on. Recently, Agarwal et al. used orthogonal VFPs (unlike the Fibonacci polynomials that are not orthogonal [30,31]) for solving variable-order fractional integro-differential equations [32]. To the best of the authors’ knowledge, these polynomials have not been widely considered yet as basis functions. For the first time, in the present paper, the VFPs are proposed to numerically solve a class of FDIDEs with weakly singular kernels in the following form [14]:
0 C D t η Z ( t ) = ϑ 1 0 t θ 1 ( t , ξ ) ( t ξ ) σ 1 Z ( ξ ) d ξ + ϑ 2 0 t θ 2 ( t , ξ ) ( t ξ ) σ 2 Z ( q ξ ) d ξ + ϑ 3 0 r t θ 3 ( t , ξ ) Z ( ξ ) d ξ + g ( t ) Z ( q t ) + p ( t ) Z ( t ) + f ( t ) , 0 < η 1 , 0 σ i < 1 , i = 1 , 2 , t I 0 ,
where I 0 = [ 0 , 1 ] , 0 < q , r 1 , g , p , f : I 0 R and θ i : I 0 × I 0 R , i = 1 , 2 , 3 are known continuous functions, and 0 C D t η is the Caputo derivative operator of the order η ( 0 , 1 ] . The initial condition is as follows:
Z ( 0 ) = z 0 ,
where z 0 is a real constant. Equation (1) is revealed in astrophysics, economy, control, biology, and electro-dynamics [10,11]. To solve problem (1)–(2), the operational matrices of the integration of the integer and fractional orders and the product operational matrix are derived for the VFPs. A matrix relationship between the main basis and its delay form is presented. The integral parts with weakly singular kernels are approximated in a matrix form. By substituting resultant approximations and operational matrices into the considered equation, the main problem is transformed into an algebraic equation; collocating it at the collocation points leads to a system of algebraic equations. It is worth noting that the roots of the VFPs are considered collocation nodes. By solving the resultant system, an approximate solution is obtained for the main problem. The existence and uniqueness of the solution of problem (1)–(2) is investigated, using Krasnoselskii’s fixed point theorem. An error bound is calculated for the residual function in a Vieta–Fibonacci-weighted Sobolev space. For this, it is necessary to prove the orthogonality of the derivatives of the VFPs. As seen, Equation (1) has integral parts with singular kernels and some delay terms, which make it difficult to solve the problem (1)–(2). Hence, there exist few numerical and analytical approximation methods to solve Equation (1). Rezabeyk et al. [14] constructed the fractional-order Euler polynomials to obtain the numerical solution of FDIDEs in the form of Equation (1). Ezz-Eldien and Doha proposed a Chebyshev collocation method to solve pantograph Volterra integro-differential equations [10]. Zhao et al. suggested the Sinc method for pantograph Volterra delay integro-differential equations [11]. The discretization process of these three methods increased the computational cost. The VFPs are not widely taken into consideration as basis functions in the spectral methods. These reasons motivate the authors to employ the VFPs to proffer a numerical method with a smaller computational size to solve the FDIDEs with weakly singular kernels. In general, the objectives of this work are highlighted as follows:
  • Obtaining the VFPs and their derivatives from Rodrigues’ formula for the first time.
  • Designing a new scheme based on the VFPs to solve FDIDEs for the first time.
  • Proving the existence and uniqueness of solutions of the considered equations, using Krasnoselskii’s fixed-point theorem.
  • Computing an error bound for the residual function in a Vieta–Fibonacci-weighted Sobolev space.
Eventually, the obtained approximate solutions demonstrate the efficiency of the VFPs as an influential tool to solve different functional equations.
The rest of the paper is organized as follows: some vital definitions and concepts related to the fractional calculus are recalled in Section 2. The conditions of the existence and uniqueness of the solutions of problems (1)–(2) are studied in Section 3. The shifted VFPs are introduced, and their operational matrices are derived in Section 4. The method of extracting the VFPs and their derivatives from Rodigues’ formula is expressed in this section. Section 5 is devoted to stating the methodology. An error bound for the residual function is estimated in a Vieta–Fibonacci-weighted Sobolev space in Section 6. The proposed scheme is implemented on four illustrated examples in Section 7. The paper concludes with a conclusion in Section 8.

2. Fractional Operators

Definitions of the Caputo derivative and the Riemann–Liouville integral and some of their properties are given in this section.
Definition 1.
The fractional Caputo derivative of order μ > 0 of a n times differentiable function h is given as follows [24]:
0 C D t μ h ( t ) = 1 Γ ( n μ ) 0 t ( t ξ ) n μ 1 d n h ( ξ ) d ξ n d ξ , n N , n 1 < μ < n .
The operator 0 C D t μ possesses the following properties:
1. 
   0 C D t μ γ = 0 ,
2. 
   0 C D t μ t ν = Γ ( ν + 1 ) Γ ( ν μ + 1 ) t ν μ , ν μ , 0 , otherwise ,
3. 
   0 C D t μ ( λ 1 h 1 ( t ) + λ 2 h 2 ( t ) ) = λ 1 0 C D t μ h 1 ( t ) + λ 2 0 C D t μ h 2 ( t ) ,
where γ , λ 1 , and λ 2 are constants.
Definition 2.
The fractional Riemann–Liouville integral of order μ > 0 of a continuous function h is defined as shown below [24]:
0 R L I t μ h ( t ) = 1 Γ ( μ ) 0 t ( t ξ ) μ 1 h ( ξ ) d ξ .
The operator 0 R L I t μ has the following characteristics:
1. 
   0 R L I t μ 1 0 R L I t μ 2 h ( t ) = 0 R L I t μ 1 + μ 2 h ( t ) ,
2. 
   0 R L I t μ h ( t ) = 0 R L I t n μ ( D n h ( t ) ) ,
3. 
   0 R L I t μ t ν = Γ ( ν + 1 ) Γ ( ν + μ + 1 ) t ν + μ ,
where D n = d n d t n .

3. Existence and Uniqueness of the Solution

In this section, conditions of the existence and uniqueness of the solution for the problem (1)–(2) are investigated and proved using Krasnoselskii’s fixed point theorem. First, this theorem is stated.
Theorem 1.
Let Ω be a closed convex and non-empty subset of a Banach space ( X , | | . | | ) (Krasnoselskii’s fixed-point theorem [33]). Suppose that A , B maps Ω into X such that the following hypotheses are fulfilled:
(i) 
A x + B y Ω for all x , y Ω ;
(ii) 
A is a contraction mapping;
(iii) 
B is compact and continuous.
Then there exists z Ω such that z = A z + B z .
By applying the Riemann–Liouville integral operator of the order η ( 0 , 1 ] on Equation (1), the following equivalent equation is achieved:
Z ( t ) = Z ( 0 ) + ϑ 1 Γ ( 1 η ) 0 t ( t s ) η 0 s θ 1 ( s , ξ ) ( s ξ ) σ 1 Z ( ξ ) d ξ d s + ϑ 2 Γ ( 1 η ) 0 t ( t s ) η 0 s θ 2 ( s , ξ ) ( s ξ ) σ 2 Z ( q ξ ) d ξ d s + ϑ 3 Γ ( 1 η ) 0 t ( t s ) η 0 r s θ 3 ( s , ξ ) Z ( ξ ) d ξ d s + 1 Γ ( 1 η ) 0 t ( t ξ ) η g ( ξ ) Z ( q ξ ) d ξ + 1 Γ ( 1 η ) 0 t ( t ξ ) η p ( ξ ) Z ( ξ ) d ξ + 1 Γ ( 1 η ) 0 t ( t ξ ) η f ( ξ ) d ξ .
Now suppose that C ( I 0 , X ) is a Banach space of real-valued continuous functions from I 0 = [ 0 , 1 ] into X R equipped with the norm X C = sup t I 0 | X ( t ) | , X C ( I 0 , X ) and the following assumptions hold for any t I 0 and ( t , ξ ) J = I 0 × I 0 :
T i = sup ( t , ξ ) J | θ i ( t , ξ ) | , i = 1 , 2 , 3 , P = sup t I 0 | p ( t ) | , G = sup t I 0 | g ( t ) | , F = sup t I 0 | f ( t ) | .
Theorem 2.
Suppose that the assumptions in (4) and the following inequalities hold:
G + P Γ ( 2 η ) + | ϑ 1 | T 1 Γ ( 2 σ 1 ) ( 1 σ 1 ) Γ ( 3 σ 1 η ) + | ϑ 2 | T 2 Γ ( 2 σ 2 ) ( 1 σ 2 ) Γ ( 3 σ 2 η ) + | ϑ 3 | T 3 Γ ( 3 η ) < 1 , G + P Γ ( 2 η ) < 1 , G + P Γ ( 2 η ) + | ϑ 1 | T 1 Γ ( 1 σ 1 ) Γ ( 3 σ 1 η ) + | ϑ 2 | T 2 Γ ( 1 σ 2 ) Γ ( 3 σ 2 η ) + | ϑ 3 | T 3 Γ ( 3 η ) < 1 .
Then, problem (1)–(2) has a unique solution on C ( I 0 , X ) .
Proof. 
Let B r = { u C ( I 0 , X ) | u C r } subject to the following:
r | Z 0 | + F Γ ( 2 η ) 1 G + P Γ ( 2 η ) + | ϑ 1 | T 1 Γ ( 2 σ 1 ) ( 1 σ 1 ) Γ ( 3 σ 1 η ) + | ϑ 2 | T 2 Γ ( 2 σ 2 ) ( 1 σ 2 ) Γ ( 3 σ 2 η ) + | ϑ 3 | T 3 Γ ( 3 η ) .
Then B r is a closed, bounded, and convex subset of C ( I 0 , X ) . The operators K and L are defined as shown below:
( K Z ) ( t ) = Z ( 0 ) + 1 Γ ( 1 η ) 0 t ( t ξ ) η g ( ξ ) Z ( q ξ ) d ξ + 1 Γ ( 1 η ) 0 t ( t ξ ) η p ( ξ ) Z ( ξ ) d ξ + 1 Γ ( 1 η ) 0 t ( t ξ ) η f ( ξ ) d ξ ,
( L Z ) ( t ) = ϑ 1 Γ ( 1 η ) 0 t ( t s ) η 0 s θ 1 ( s , ξ ) ( s ξ ) σ 1 Z ( ξ ) d ξ d s + ϑ 2 Γ ( 1 η ) 0 t ( t s ) η 0 s θ 2 ( s , ξ ) ( s ξ ) σ 2 Z ( q ξ ) d ξ d s + ϑ 3 Γ ( 1 η ) 0 t ( t s ) η 0 r s θ 3 ( s , ξ ) Z ( ξ ) d ξ d s .
It is shown that K + L has a fixed point in B r . The proof is divided into four steps:
Step 1
It is shown that K Z + L U B r for every Z , U B r . Using (4) and (6), one obtains the following:
K Z + L U C | Z ( 0 ) | + ( G + P ) Z C Γ ( 2 η ) + F Γ ( 2 η ) + | ϑ 1 | Γ ( 2 σ 1 ) T 1 U C ( 1 σ 1 ) Γ ( 3 σ 1 η ) + | ϑ 2 | Γ ( 2 σ 2 ) T 2 U C ( 1 σ 2 ) Γ ( 3 σ 2 η ) + | ϑ 3 | T 3 U C Γ ( 3 η ) | Z 0 | + F Γ ( 2 η ) + ( G + P Γ ( 2 η ) + | ϑ 1 | Γ ( 2 σ 1 ) T 1 ( 1 σ 1 ) Γ ( 3 σ 1 η ) + | ϑ 2 | Γ ( 2 σ 2 ) T 2 ( 1 σ 2 ) Γ ( 3 σ 2 η ) + | ϑ 3 | T 3 Γ ( 3 η ) ) r r .
Therefore, K Z + L U C r , which implies that K Z + L U B r for any Z , U B r .
Step 2
The operator K is a contraction mapping on B r . For each Z , U B r and each t I 0 , one gets the following:
K Z K U C = 1 Γ ( 1 η ) 0 t ( t ξ ) η [ g ( ξ ) ( Z ( q ξ ) U ( q ξ ) ) + p ( ξ ) ( Z ( ξ ) U ( ξ ) ) ] d ξ C G + P Γ ( 2 η ) Z U C .
From (5), this shows that K is a contraction mapping on B r .
Step 3
The operator L is compact and continuous. We know that the following holds:
L Z C | ϑ 1 | Γ ( 2 σ 1 ) T 1 ( 1 σ 1 ) Γ ( 3 σ 1 η ) + | ϑ 2 | Γ ( 2 σ 2 ) T 2 ( 1 σ 2 ) Γ ( 3 σ 2 η ) + | ϑ 3 | T 3 Γ ( 3 η ) r .
This shows that L is uniformly bounded on B r . It remains to prove the compactness of the operator L . For t 1 , t 2 I 0 such that t 1 < t 2 and Z B r , one has the following:
L Z ( t 2 ) L Z ( t 1 ) = ϑ 1 Γ ( 1 η ) 0 t 2 ( t 2 s ) η 0 s θ 1 ( s , ξ ) Z ( ξ ) ( s ξ ) σ 1 d ξ d s + ϑ 2 Γ ( 1 η ) 0 t 2 ( t 2 s ) η 0 s θ 2 ( s , ξ ) Z ( q ξ ) ( s ξ ) σ 2 d ξ d s + ϑ 3 Γ ( 1 η ) 0 t 2 ( t 2 s ) η 0 s θ 3 ( s , ξ ) Z ( ξ ) d ξ d s ϑ 1 Γ ( 1 η ) 0 t 1 ( t 1 s ) η 0 s θ 1 ( s , ξ ) Z ( ξ ) ( s ξ ) σ 1 d ξ d s ϑ 2 Γ ( 1 η ) 0 t 1 ( t 1 s ) η 0 s θ 2 ( s , ξ ) Z ( q ξ ) ( s ξ ) σ 2 d ξ d s ϑ 3 Γ ( 1 η ) 0 t 1 ( t 1 s ) η 0 s θ 3 ( s , ξ ) Z ( ξ ) d ξ d s .
By taking norm, one has the following:
L Z ( t 2 ) L Z ( t 1 ) C | ϑ 1 | Γ ( 1 σ 1 ) T 1 r Γ ( 3 σ 1 η ) ( t 2 2 σ 1 η t 1 2 σ 1 η ) + | ϑ 2 | Γ ( 1 σ 2 ) T 2 r Γ ( 3 σ 2 η ) ( t 2 2 σ 2 η t 1 2 σ 2 η ) + | ϑ 3 | T 3 r Γ ( 3 η ) ( t 2 2 η t 1 2 η ) .
As t 2 t 1 , the right-hand side of the above inequality tends to zero. Thus, L is equicontinuous. As a consequence of Steps 1–3 together with the Arzela–Ascoli theorem, one deduces that the operator L is compact and continuous. Finally, by Krasnoselskii’s fixed point theorem, problem (1) has at least one solution on I 0 .
Step 4
Define ( WZ ) ( t ) = ( KZ ) ( t ) + ( LZ ) ( t ) . For any Z , U C ( I 0 , X ) and t I 0 one has the following:
( W Z ) ( t ) ( W U ) ( t ) C = ϑ 1 Γ ( 1 η ) 0 t ( t s ) η 0 s θ 1 ( s , ξ ) ( Z ( ξ ) U ( ξ ) ) ( s ξ ) σ 1 d ξ d s + ϑ 2 Γ ( 1 η ) 0 t ( t s ) η 0 s θ 2 ( s , ξ ) ( Z ( q ξ ) U ( q ξ ) ) ( s ξ ) σ 2 d ξ d s + ϑ 3 Γ ( 1 η ) 0 t ( t s ) η 0 s θ 3 ( s , ξ ) ( Z ( ξ ) U ( ξ ) ) d ξ d s + 1 Γ ( 1 η ) 0 t ( t ξ ) η ( g ( ξ ) ( Z ( q ξ ) U ( q ξ ) ) + p ( ξ ) ( Z ( ξ ) U ( ξ ) ) ) d ξ C | ϑ 1 | Γ ( 1 σ 1 ) T 1 Γ ( 3 σ 1 η ) + | ϑ 2 | Γ ( 1 σ 2 ) T 2 Γ ( 3 σ 2 η ) + | ϑ 3 | T 3 Γ ( 3 η ) + G + P Γ ( 2 η ) Z U C .
Imposing the hypothesis in (5) implies that W is a contraction mapping. It follows that W has a unique fixed-point, which is a solution of the problem (1)–(2).    □

4. Shifted VFPs and Their Operational Matrices

The definition of the shifted VFPs is given in this section, the operational matrices of the integration of the integer and fractional orders and the product operational matrix are derived. A matrix relationship between the main basis and its delay form is presented, and the integral parts with the singular kernels are approximated, using an operational matrix.

4.1. Shifted VFPs

Shifted VFPs are defined using the following recurrence formula on the interval [ 0 , 1 ] :
VF n ( t ) = ( 4 t 2 ) VF n 1 ( t ) VF n 2 ( t ) , n = 2 , 3 , ,
with the starting values VF 0 ( t ) = 0 , VF 1 ( t ) = 1 . These polynomials are expressed by means of the following series:
VF n ( t ) = i = 0 n 1 ( 1 ) n i 1 2 2 i Γ ( n + i + 1 ) Γ ( n i ) Γ ( 2 i + 2 ) t i = i = 0 n 1 γ i ( n ) t i , n = 2 , 3 , ,
where
γ i ( n ) = ( 1 ) n i 1 2 2 i Γ ( n + i + 1 ) Γ ( n i ) Γ ( 2 i + 2 ) , n = 2 , 3 , , i = 0 , 1 , , n 1 .
These polynomials are orthogonal concerning the weight function w ( t ) = t t 2 . On the other hand, one has the following:
ζ n = 0 1 VF n ( t ) VF m ( t ) w ( t ) d t = 0 , n m , π 8 , n = m 0 .
Every square-integrable function U L 2 ( I 0 ) can be expanded in the VFPs as follows:
U ( t ) = i = 1 u i VF i ( t ) ,
where the coefficients u i are obtained as follows:
u i = 1 ζ i 0 1 U ( t ) VF i ( t ) w ( t ) d t , i = 1 , 2 , .
A finite form of the series in (10) is considered an approximation to U ( t ) , that is, the following:
U ( t ) U N ( t ) = i = 1 N + 1 u i VF i ( t ) = U T Ψ ( t ) ,
where U and Ψ ( t ) are the following vectors:
U = [ u 1 , u 2 , , u N + 1 ] T , Ψ ( t ) = [ VF 1 ( t ) , VF 2 ( t ) , , VF N + 1 ( t ) ] T .
Due to the need of the orthogonality of derivatives of the shifted VFPs in the subject of the approximation error, we show that the mth derivative of these polynomials is orthogonal with respect to the weight function w m ( t ) = t m + 1 2 ( 1 t ) m + 1 2 , m = 1 , 2 , . First, we obtain Rodrigues’ formula for extracting the VFPs and their derivatives.
The mth derivative of VF n ( t ) can be stated as follows:
d m VF n ( t ) d t m = A n m t m 1 2 ( 1 t ) m 1 2 d n m + 1 d t n m + 1 t n 1 2 ( 1 t ) n 1 2 .
By differentiating (8) and comparing the leading terms in d m VF n ( t ) d t m and d n m + 1 d t n m + 1 [ t n 1 2 ( 1 t ) n 1 2 ] , the value of A n m is determined as follows:
A n m = ( 1 ) n m 1 2 2 ( n 1 ) Γ ( n ) Γ ( n + m + 1 ) Γ ( 2 n ) Γ ( n m ) .
Define κ n ( t ) = t n 1 2 ( 1 t ) n 1 2 . Then, from (13) one has the following:
I = 0 1 d m VF k ( t ) d t m d m VF n ( t ) d t m w m ( t ) d t = A n m 0 1 d m VF k ( t ) d t m κ n ( n m 1 ) ( t ) d t .
Using the integration by parts for the second integral in (14) results in the following:
I = A n m 0 1 d m + 1 VF k ( t ) d t m + 1 κ n ( n m ) ( t ) d t .
By performing the integration by parts ( k m 1 ) times for I, one has the following:
I = ( 1 ) k m 1 A n m 0 1 d k 1 VF k ( t ) d t k 1 κ n ( n k ) ( t ) d t .
If k < n , using the integration by parts again, one obtains the following result:
I = ( 1 ) k m A n m 0 1 d k VF k ( t ) d t k κ n ( n k 1 ) ( t ) d t = 0 .
Therefore, d m VF k ( t ) d t m and d m VF n ( t ) d t m are orthogonal with respect to the weight function w m ( t ) . If k = n , one has from (13) and (15) the following:
I = 0 1 d m VF k ( t ) d t m 2 w m ( t ) d t = ( 1 ) k m 1 A k m ( k 1 ) ! 2 2 ( k 1 ) 0 1 t k 1 2 ( 1 t ) k 1 2 d t = 2 4 ( k 1 ) Γ 2 ( k ) Γ 2 ( k + 1 2 ) Γ ( k + m + 1 ) Γ ( 2 k + 1 ) Γ ( 2 k ) Γ ( k m ) .

4.2. Operational Matrix of the Integration of the Integer Order

Integrating the components of vector Ψ ( t ) leads to the following:
0 t Ψ k ( ξ ) d ξ = i = 0 k 1 ( 1 ) k i 1 2 2 i Γ ( k + i + 1 ) Γ ( k i ) Γ ( 2 i + 2 ) 0 t ξ i d ξ = i = 0 k 1 γ i ( k ) Γ ( i + 1 ) Γ ( i + 2 ) t i + 1 , k = 1 , 2 , , N + 1 .
Now, t i + 1 is approximated in terms of shifted VFPs as follows:
t i + 1 j = 1 N + 1 ρ j ( i + 1 ) VF j ( t ) ,
where
ρ i ( i + 1 ) = 8 π 0 1 t i + 1 VF j ( t ) w ( t ) d t = 8 π l = 0 j 1 γ l ( j ) 0 1 t i + l + 3 2 ( 1 t ) 1 2 d t = 4 π l = 0 j 1 γ l ( j ) Γ ( i + l + 5 2 ) Γ ( i + l + 4 ) .
Using the last equality in (18), the integral in (17) can be written as follows:
0 t Ψ k ( ξ ) d ξ j = 1 N + 1 i = 0 k 1 4 γ i ( k ) Γ ( i + 1 ) π Γ ( i + 2 ) l = 0 j 1 γ l ( j ) Γ ( i + l + 5 2 ) Γ ( i + l + 4 ) VF j ( t ) , k = 1 , 2 , , N + 1 .
Therefore, one obtains the following:
0 t Ψ ( ξ ) d ξ Π Ψ ( t ) ,
where Π is the integral operational matrix of the integer order and its entries are as follows:
Π ( k , j ) : = i = 0 k 1 4 γ i ( k ) Γ ( i + 1 ) π Γ ( i + 2 ) l = 0 j 1 γ l ( j ) Γ ( i + l + 5 2 ) Γ ( i + l + 4 ) , k , j = 1 , 2 , , N + 1 .

4.3. Operational Matrix of the Integration of the Fractional Order

The Riemann–Liouville integral of the kth component of vector Ψ ( t ) is computed as follows:
0 R L I t μ Ψ k ( t ) = i = 0 k 1 γ i ( k ) Γ ( i + 1 ) Γ ( i + μ + 1 ) t i + μ .
The term t i + μ can be approximated as follows:
t i + μ j = 1 N + 1 ρ j ( i ) VF j ( t ) ,
where the coefficients ρ j ( i ) , j = 1 , 2 , . . . , N + 1 can be computed as follows:
ρ j ( i ) = 8 π 0 1 t i + μ VF j ( t ) w ( t ) d t = 4 π l = 0 j 1 γ l ( j ) Γ ( i + l + μ + 3 2 ) Γ ( i + l + μ + 3 ) .
Thus, relation (20) is written as the following:
  
0 R L I t μ Ψ k ( t ) j = 1 N + 1 i = 0 k 1 4 γ i ( k ) Γ ( i + 1 ) π Γ ( i + μ + 1 ) l = 0 j 1 γ l ( j ) Γ ( i + l + 3 2 ) Γ ( i + l + 3 ) VF j ( t ) , k = 1 , 2 , , N + 1 .
If the last relation is written as a matrix form, one has the following:
0 R L I t μ Ψ ( t ) Π ( μ ) Ψ ( t ) ,
where Π ( μ ) is the operational matrix of the fractional order μ > 0 and its entries are calculated as follows:
Π ( μ ) ( k , j ) : = i = 0 k 1 4 γ i ( k ) Γ ( i + 1 ) π Γ ( i + μ + 1 ) l = 0 j 1 γ l ( j ) Γ ( i + l + μ + 3 2 ) Γ ( i + l + μ + 3 ) , k , j = 1 , 2 , , N + 1 .

4.4. Approximating the Integral Part with the Singular Kernel

A matrix relation is derived to approximate the integral parts in Equation (1) with the weakly singular kernels as shown below:
0 t ψ k ( ξ ) ( t ξ ) σ d ξ = i = 0 k 1 γ i ( k ) 0 t ξ i ( t ξ ) σ d ξ = i = 0 k 1 γ i ( k ) Γ ( 1 σ ) Γ ( i + 1 ) Γ ( i σ + 2 ) t k σ + 1 .
Since t k σ + 1 = t σ t k + 1 , the term t k + 1 is approximated in terms of the Vieta–Fibonacci basis. So, relation (22) is written as follows:
0 t ψ k ( ξ ) ( t ξ ) σ d ξ j = 1 N + 1 { i = 0 k 1 4 t σ γ i ( k ) Γ ( 1 σ ) Γ ( i + 1 ) π Γ ( i σ + 2 ) l = 0 j 1 γ l ( j ) Γ ( k + l + 5 2 ) Γ ( k + l + 4 ) } VF j ( t ) , k = 1 , 2 , , N + 1 .
By rewriting the last approximation as a matrix form, one has the following:
0 t Ψ ( ξ ) ( t ξ ) σ d ξ S ( σ ) Ψ ( t ) ,
where S ( σ ) is the operational matrix for approximating the integral part with the weakly singular kernels and its entries are as follows:
S ( σ ) ( k , j ) : = i = 0 k 1 4 t σ γ i ( k ) Γ ( 1 σ ) Γ ( i + 1 ) π Γ ( i σ + 2 ) l = 0 j 1 γ l ( j ) Γ ( k + l + 5 2 ) Γ ( k + l + 4 ) , k , j = 1 , 2 , , N + 1 .

4.5. Delay Operational Matrix

To obtain a matrix relation between Ψ ( q t ) and Ψ ( t ) , the kth component of the vector Ψ ( q t ) is approximated in terms of the shifted VFPs. According to representation (8), one has the following:
ψ k ( q t ) = i = 0 k 1 γ i ( k ) q i t i , k = 1 , 2 , , N + 1 .
Now, t i is approximated as the following:
t i j = 1 N + 1 ρ j ( i ) VF j ( t ) ,
where
ρ j ( i ) = 4 π l = 0 j 1 γ l ( j ) Γ ( i + l + 3 2 ) Γ ( i + l + 3 ) .
Therefore, equality (24) is as follows:
ψ k ( q t ) j = 1 N + 1 4 π γ i ( k ) q i l = 0 j 1 γ l ( j ) Γ ( i + l + 3 2 ) Γ ( i + l + 3 ) VF j ( t ) , k = 1 , 2 , , N + 1 .
The matrix form of the last relation is as follows:
Ψ ( q t ) Q ( q ) Ψ ( t ) ,
where Q ( q ) is the delay operational matrix. Using approximation (25), one can approximate the following integral:
0 r t ψ k ( ξ ) d ξ = i = 0 k 1 γ i ( k ) Γ ( i + 1 ) r i + 1 Γ ( i + 2 ) t i + 1 j = 1 N + 1 i = 0 k 1 4 r i + 1 γ i ( k ) Γ ( i + 1 ) π Γ ( i + 2 ) l = 0 j 1 γ l ( j ) Γ ( i + l + 5 2 ) Γ ( i + l + 4 ) VF j ( t ) .
If the last approximation is represented as a matrix form, one has the following:
0 r t Ψ ( ξ ) d ξ R ( r ) Ψ ( t ) ,
where R ( r ) is a ( N + 1 ) × ( N + 1 ) matrix with the following entries:
R ( r ) ( k , j ) : = i = 0 k 1 4 r i + 1 γ i ( k ) Γ ( i + 1 ) π Γ ( i + 2 ) l = 0 j 1 γ l ( j ) Γ ( i + l + 5 2 ) Γ ( i + l + 4 ) , k , j = 1 , 2 , , N + 1 .

4.6. Operational Matrix of the Product

After substituting appropriate approximations into integral parts, the expression Ψ ( t ) Ψ T ( t ) H may appear in which H is a vector. Here, an approximation is given for this multiplication expression as follows:
Ψ ( t ) Ψ T ( t ) H H ˜ Ψ ( t ) ,
where H ˜ is the product operational matrix. The matrix form of (27) is as follows:
k = 1 N + 1 ψ 1 ( t ) ψ k ( t ) H k k = 1 N + 1 ψ 2 ( t ) ψ k ( t ) H k k = 1 N + 1 ψ N + 1 ( t ) ψ k ( t ) H k k = 1 N + 1 H ˜ 1 , k ψ k ( t ) k = 1 N + 1 H ˜ 2 , k ψ k ( t ) k = 1 N + 1 H ˜ N + 1 , k ψ k ( t ) .
So, the ith row of (28) is as follows:
k = 1 N + 1 ψ i ( t ) ψ k ( t ) H k k = 1 N + 1 H ˜ i , k ψ k ( t ) .
Taking inner product and using (9) result in the following:
k = 1 N + 1 H k 0 1 ψ i ( t ) ψ k ( t ) ψ m ( t ) w ( t ) d t k = 1 N + 1 H ˜ i , k 0 1 ψ k ( t ) ψ m ( t ) w ( t ) d t = H ˜ i , k ζ m .
Now, the product ψ k ( t ) ψ m ( t ) is written as follows:
ψ k ( t ) ψ m ( t ) = r = 0 k 1 γ r ( k ) t r s = 0 m 1 γ s ( m ) t s = l = 0 k + m 2 τ l ( k , m ) t l ,
where coefficients τ l ( k , m ) are computed from Algorithms 1 and 2. By (30), the integral on the left-hand side of (29) is computed as follows:
0 1 ψ i ( t ) ψ k ( t ) ψ m ( t ) w ( t ) d t = l = 0 k + m 2 τ l ( k , m ) n = 0 i 1 Γ ( 3 2 ) Γ ( l + n + 3 2 ) Γ ( l + n + 3 ) .
Thus, from the right-hand side of (29) and the last equality, the entries of H ˜ are as follows:
H ˜ ( i , m ) : = 4 π k = 1 N + 1 l = 0 k + m 2 n = 0 i 1 H k τ l ( k , m ) γ n ( i ) Γ ( l + n + 3 2 ) Γ ( l + n + 3 ) , i , m = 1 , 2 , , N + 1 .
Algorithm 1 The computation of the coefficient τ l ( k , m ) if k m
  • l = 0 , 1 , , k + m
  • if  l > k  then
  •     τ l ( k , m ) = s = l k m γ l s ( k ) γ s ( m )
  • else
  •     l 1 = min { l , m }
  •     τ l ( k , m ) = s = 0 l 1 γ l s ( k ) γ s ( m )
  • end if
Algorithm 2 The computation of the coefficient τ l ( k , m ) if k < m
  • l = 0 , 1 , , k + m
  • if  l k  then
  •     l 1 = min { l , k }
  •     τ l ( k , m ) = s = 0 l 1 γ l s , k γ s , m
  • else
  •     l 2 = min { l , m }
  •     τ l ( k , m ) = s = l k l 2 γ l s , k γ s , m
  • end if

5. Methodology

To better understand the implementation of the proposed method, consider Equation (1) again. To present an approximation for the function Z , first an approximation is given for 0 C D t η Z ( t ) as follows:
0 C D t η Z ( t ) C T Ψ ( t ) .
Applying the Riemann–Liouville integral operator to approximation (31) and using the operational matrix in (21) and the initial condition in (2), an approximation is achieved for Z ( t ) :
Z ( t ) C T Π ( η ) Ψ ( t ) + z 0 C T Π ( η ) Ψ ( t ) + F T Ψ ( t ) = U T Ψ ( t ) ,
where U T = C T Π ( η ) + F T . Using approximation (32) and the operational matrix in (25), an approximation is obtained for Z ( q t ) as follows:
Z ( q t ) C T Π ( η ) Ψ ( q t ) + F T Ψ ( q t ) C T Π ( η ) Q ( q ) Ψ ( t ) + F T Q ( q ) Ψ ( t ) = V T Ψ ( t ) ,
where V T = C T Π ( η ) Q ( q ) + F T Q ( q ) . The functions θ i , i = 1 , 2 , 3 are approximated as follows:
θ i ( t , ξ ) Ψ T ( t ) Θ i Ψ ( ξ ) , i = 1 , 2 , 3 ,
where Θ i , i = 1 , 2 , 3 are the known ( N + 1 ) × ( N + 1 ) matrices for which their entries are computed by means of the inner product. Utilizing approximations (32)–(34), the operational matrices in (23) and (26), and the definition of the product operational matrix in (27), the integral parts are approximated as follows:
0 t θ 1 ( t , ξ ) ( t ξ ) σ 1 Z ( ξ ) d ξ 0 t Ψ T ( t ) Θ 1 Ψ ( ξ ) Ψ T ( ξ ) U ( t ξ ) σ 1 d ξ Ψ T ( t ) Θ 1 U ˜ 0 t Ψ ( ξ ) ( t ξ ) σ 1 d ξ Ψ T ( t ) Θ 1 U ˜ S ( σ 1 ) Ψ ( t ) ,
0 t θ 2 ( t , ξ ) ( t ξ ) σ 2 Z ( q ξ ) d ξ 0 t Ψ T ( t ) Θ 2 Ψ ( ξ ) Ψ T ( ξ ) V ( t ξ ) σ 2 d ξ Ψ T ( t ) Θ 2 V ˜ 0 t Ψ ( ξ ) ( t ξ ) σ 2 d ξ Ψ T ( t ) Θ 2 V ˜ S ( σ 2 ) Ψ ( t ) ,
0 r t θ 3 ( t , ξ ) Z ( ξ ) d ξ 0 r t Ψ T ( t ) Θ 3 Ψ ( ξ ) Ψ T ( ξ ) U d ξ Ψ T ( t ) Θ 3 U ˜ 0 r t Ψ ( ξ ) d ξ Ψ T ( t ) Θ 3 U ˜ R ( r ) Ψ ( t ) .
Substituting approximations (31)–(37) into Equation (1) leads to the following residual function:
R ( t ) = C T Ψ ( t ) ϑ 1 Ψ T ( t ) Θ 1 U ˜ S ( σ 1 ) Ψ ( t ) ϑ 2 Ψ T ( t ) Θ 2 V ˜ S ( σ 2 ) Ψ ( t ) ϑ 3 Ψ T ( t ) Θ 3 U ˜ R ( r ) Ψ ( t ) g ( t ) V T Ψ ( t ) p ( t ) U T Ψ ( t ) f ( t ) .
Collocating Equation (38) at roots of the VF N + 2 ( t ) ( VF N + 2 ( t ) is of degree N + 1 ) results in a system involving ( N + 1 ) algebraic equations. By solving the resultant system and using (32), an approximate solution is obtained.

6. Error Bound

In this section, an error bound for the residual function is computed in a weighted Sobolev space. Let Ω = { X | X C 1 } and w ( t ) = t t 2 be the weight function. The Vieta–Fibonacci-weighted Sobolev space is introduced as follows:
H w s ( Ω ) = { v | v is measurable and v s , w < } , s N { 0 } ,
equipped with the following norm and semi-norm:
v s , w = k = 0 s d k v ( t ) d t k w k 2 1 2 , | v | s , w = d s v ( t ) d t s w s ,
where . w k stands for the known L 2 -norm.
Definition 3
([34]). The Gagliardo–Nirenberg inequality holds for any real number s = [ s ] + ν , 0 < ν < 1 and any v H w [ s ] + 1 ( Ω ) :
v s , w v [ s ] + 1 , w ν v [ s ] , w 1 ν .
Theorem 3.
Suppose that U H w s ( Ω ) , s N { 0 } , 0 λ s , and U N + 1 ( t ) is the Vieta-Fibonacci approximation to U ( t ) . Then, an error bound for U ( t ) U N + 1 ( t ) is obtained as follows:
U U N + 1 λ , w C ( ( N + 2 ) ( N + 3 ) ) λ s 2 | U | s , w ,
where C is a positive constant.
Proof. 
Because U N + 1 ( t ) is the Vieta–Fibonacci approximation to U ( t ) , one has the following:
U ( t ) = l = 1 c l VF l ( t ) , U N + 1 ( t ) = l = 1 N + 1 c l VF l ( t ) .
Then, for m N { 0 } , one has the following:
d m d t m ( U ( t ) U N + 1 ( t ) ) = d m d t m l = N + 2 c l VF l ( t ) = l = N + 2 c l d m VF l ( t ) d t m , m s .
From (16), one obtains the following:
d m d t m ( U ( t ) U N + 1 ( t ) ) w m 2 = l = N + 2 c l 2 2 4 ( l 1 ) Γ 2 ( l ) Γ 2 ( l + 1 2 ) Γ ( l + m + 1 ) Γ ( 2 l + 1 ) Γ ( 2 l ) Γ ( l m ) .
Similarly, one has the following:
d s U d t s w s 2 = l = s + 1 c l 2 2 4 ( l 1 ) Γ 2 ( l ) Γ 2 ( l + 1 2 ) Γ ( l + s + 1 ) Γ ( 2 l + 1 ) Γ ( 2 l ) Γ ( l s ) .
Using the Stirling formula [34], one deduces the following:
c l 2 2 4 ( l 1 ) Γ 2 ( l ) Γ 2 ( l + 1 2 ) Γ ( l + m + 1 ) Γ ( 2 l + 1 ) Γ ( 2 l ) Γ ( l s ) c l 2 2 4 ( l 1 ) Γ 2 ( l ) Γ 2 ( l + 1 2 ) Γ ( l + s + 1 ) Γ ( 2 l + 1 ) Γ ( 2 l ) Γ ( l m ) C 1 ( l + 1 ) m s l m s .
From (41)–(43), one obtains the following:
| U U N + 1 | m , w 2 = d m d t 2 ( U U N + 1 ) w m 2 = l = N + 2 c l 2 2 4 ( l 1 ) Γ 2 ( l ) Γ 2 ( l + 1 2 ) Γ ( l + m + 1 ) Γ ( 2 l + 1 ) Γ ( 2 l ) Γ ( l s ) c l 2 2 4 ( l 1 ) Γ 2 ( l ) Γ 2 ( l + 1 2 ) Γ ( l + s + 1 ) Γ ( 2 l + 1 ) Γ ( 2 l ) Γ ( l m ) × c l 2 2 4 ( l 1 ) Γ 2 ( l ) Γ 2 ( l + 1 2 ) Γ ( l + s + 1 ) Γ ( 2 l + 1 ) Γ ( 2 l ) Γ ( l s ) l = N + 2 C 1 l m s ( l + 1 ) m s c l 2 2 4 ( l 1 ) Γ 2 ( l ) Γ 2 ( l + 1 2 ) Γ ( l + s + 1 ) Γ ( 2 l + 1 ) Γ ( 2 l ) Γ ( l s ) C 1 ( N + 2 ) m s ( N + 3 ) m s l = s + 1 c l 2 2 4 ( l 1 ) Γ 2 ( l ) Γ 2 ( l + 1 2 ) Γ ( l + s + 1 ) Γ ( 2 l + 1 ) Γ ( 2 l ) Γ ( l s ) = C 1 ( ( N + 2 ) ( N + 3 ) ) m s | U | s , w 2 .
Then, one has the following:
U U N + 1 s , w C 2 ( ( N + 2 ) ( N + 3 ) ) m s 2 | U | s , w .
Using Definition 3 implies the desired result for λ = [ λ ] + δ , 0 < δ < 1 as follows:
U U N + 1 λ , w U U N + 1 [ λ ] + 1 , w δ U U N + 1 [ λ ] , w 1 δ C ( ( N + 2 ) ( N + 3 ) ) λ s 2 | U | s , w .
Corollary 1.
To find an error bound for U ( t ) U N + 1 ( t ) , the same procedure of proving in Theorem 3 is pursued. So, for m s one has the following:
d m d t m ( U ( t ) U N + 1 ( t ) ) = d m + 1 d t m + 1 ( U ( t ) U N + 1 ( t ) ) = d m + 1 d t m + 1 l = N + 2 c l VF l ( t ) = l = N + 2 c l d m + 1 VF l ( t ) d t m + 1 .
Therefore, the following bound is obtained for 0 < λ < s :
U U N + 1 λ , w C * ( ( N + 4 ) ( N + 1 ) ) λ s 2 | U | s , w .
Theorem 4.
Assume that U H w s ( Ω ) , s N { 0 } , 0 λ s , 0 < η < 1 , and U N + 1 ( t ) is the Vieta-Fibonacci approximation to U ( t ) . Then, an error bound for 0 C D t η U ( t ) 0 C D t η U N + 1 ( t ) is obtained as the following:
0 C D t η U 0 C D t η U N + 1 λ , w 1 C π Γ ( 3 2 η ) Γ ( 1 η ) Γ ( 3 η ) ( ( N + 4 ) ( N + 1 ) ) λ s 2 | U | s , w ,
where C is a positive constant.
Proof. 
Using the second property in Definition 2, one has the following:
0 C D t η U ( t ) 0 C D t η U N + 1 ( t ) = 0 R L I t 1 η ( U ( t ) U N + 1 ( t ) ) = 1 Γ ( 1 η ) 0 t ( t ξ ) η ( U ( ξ ) U N + 1 ( ξ ) ) d ξ = 1 Γ ( 1 η ) [ t η ( U ( t ) U N + 1 ( t ) ) ] ,
where the star denotes the convolution. Using Young’s convolution inequality f g q C 0 f 1 g q and Corollary 1, one has the following:
0 C D t η U 0 C D t η U N + 1 λ , w 1 C 0 Γ ( 1 η ) t η L w 1 ( Ω ) U U N + 1 λ , w 1 C 0 Γ ( 1 η ) π Γ ( 3 2 η ) Γ ( 3 η ) U U N + 1 λ , w 1 C π Γ ( 3 2 η ) Γ ( 1 η ) Γ ( 3 η ) ( ( N + 4 ) ( N + 1 ) ) λ s 2 | U | s , w .
Now, suppose that Z ( t ) is the exact solution of Equation (1), and Z N + 1 ( t ) is the approximate solution obtained from the proposed scheme. Therefore, Z N + 1 ( t ) satisfies the following equation:
0 C D t η Z N + 1 ( t ) = ϑ 1 0 t θ 1 ( t , ξ ) ( t ξ ) σ 1 Z N + 1 ( ξ ) d ξ + ϑ 2 0 t θ 2 ( t , ξ ) ( t ξ ) σ 2 Z N + 1 ( q ξ ) d ξ + ϑ 3 0 r t θ 3 ( t , ξ ) Z N + 1 ( ξ ) d ξ + g ( t ) Z N + 1 ( q t ) + p ( t ) Z N + 1 ( t ) + f ( t ) + R ( t ) ,
where R ( t ) is the residual function or perturbation term. By Subtracting Equation (46) from Equation (1), the following error equation is obtained:
R ( t ) = 0 C D t η Z ( t ) 0 C D t η Z N + 1 ( t ) + ϑ 1 0 t θ 1 ( t , ξ ) ( t ξ ) σ 1 ( Z ( ξ ) Z N + 1 ( ξ ) ) d ξ + ϑ 2 0 t θ 2 ( t , ξ ) ( t ξ ) σ 2 ( Z ( q ξ ) Z N + 1 ( q ξ ) ) d ξ + ϑ 3 0 r t θ 3 ( t , ξ ) ( Z ( ξ ) Z N + 1 ( ξ ) ) d ξ + g ( t ) ( Z ( q t ) Z N + 1 ( q t ) ) + p ( t ) ( Z ( t ) Z N + 1 ( t ) ) .
Assume that the functions g and p are square-integrable on I 0 , the functions θ i , i = 1 , 2 , 3 are square-integrable on J = I 0 × I 0 , s N { 0 } , and 0 < λ < s . Using the obtained bounds in (40) and (45), an error bound is achieved for R ( t ) .
R λ , w C π Γ ( 3 2 η ) Γ ( 1 η ) Γ ( 3 η ) ( ( N + 4 ) ( N + 1 ) ) λ s 2 | Z | s , w 1 + | ϑ 1 | θ 1 L w 2 ( J ) C π Γ ( 3 2 σ 1 ) Γ ( 3 σ 1 ) ( ( N + 2 ) ( N + 3 ) ) λ s 2 | Z | s , w + | ϑ 2 | θ 2 L w 2 ( J ) C π Γ ( 3 2 σ 2 ) Γ ( 3 σ 2 ) ( ( N + 2 ) ( N + 3 ) ) λ s 2 | Z | s , w + | ϑ 3 | θ 3 L w 2 ( J ) C ( ( N + 2 ) ( N + 3 ) ) λ s 2 | Z | s , w + g L w 2 ( I 0 ) C ( ( N + 2 ) ( N + 3 ) ) λ s 2 | Z | s , w + p L w 2 ( I 0 ) C ( ( N + 2 ) ( N + 3 ) ) λ s 2 | Z | s , w .
The right-hand side of inequality (48) shows that by appropriately choosing the number of basis functions, the approximation error will decrease.

7. Illustrated Examples

In this section, the Vieta–Fibonacci collocation method is utilized to solve four FDIDEs as special cases of Equation (1). Maximum absolute errors (MAEs) of the obtained results are computed by the following formula:
E a b s = max t I 0 | Z ( t ) Z N + 1 ( t ) | .
Example 1
([14]). As the first example, consider the following equation:
0 C D t 1 2 Z ( t ) = Z ( t 2 ) + Z ( t ) + 0 t Z ( ξ ) d ξ + 8 3 π t 3 2 5 4 t 2 1 3 t 3 , t I 0 ,
with the exact solution Z ( t ) = t 2 and the initial condition Z ( 0 ) = 0 . For examining the effect of N on the numerical solution, this example is solved for different values of N. According to the results in Figure 1, the MAEs are decreased by increasing N. A graphical comparison of the exact and approximate solutions and the absolute error function are seen in Figure 2 for N = 25 . Values of absolute errors are listed in Table 1 at the equally spaced points t j = 0.2 j , j = 0 , 1 , , 5 and compared with ones reported in [14], which have used the fractional-order Euler polynomials to find an approximate solution. The results show a good agreement of the approximate solution with the exact one.
Example 2.
Consider the following FDIDE [11,14]:
0 C D t η Z ( t ) = Z ( t 4 ) + 1 2 Z ( t ) + 0 t exp ( t + ξ ) Z ( ξ ) d ξ + 0 t 4 ξ Z ( ξ ) d ξ + 1 2 1 4 t exp ( t 4 ) + 1 32 t 2 1 2 exp ( 3 t ) + exp ( 2 t ) , 0 < η 1 , t I 0 ,
with the exact solution Z ( t ) = exp ( t ) 1 as η = 1 and the initial condition Z ( 0 ) = 0 . The above equation is solved by the presented method, and the MAE is 5.3398 × 10 6 for η = 1 and N = 6 . This equation was solved in [11,14], and the reported MAEs are 1.9487 × 10 6 for N = 6 and 4.7215 × 10 6 for N = 20 , respectively. From these values of errors, it can be seen that the suggested algorithm has given results with the same accuracy with a smaller number of basis functions. The figures of the exact and approximate solutions are plotted in Figure 3 for η = 1 , N = 6 . As seen, the approximate solution has good agreement with the exact one. In Figure 4, approximate solutions are observed for N = 6 and η = 0.7 , 0.8 , 0.9 , 1 . It can be seen that the numerical solutions get close to the exact one as η 1 .
Example 3.
The equation in Example 2 is considered again with the exact solution Z ( t ) = t 2 if η = 1 . In here, the function f is as below [14]:
f ( t ) = 2 t 9 16 t 2 1 45 t 3 t 2 exp ( 2 t ) + 2 t exp ( 2 t ) 2 exp ( 2 t ) + 2 exp ( t ) .
The equation is solved by the suggested scheme, and the MAE is 3.0170 × 10 6 for η = 1 , N = 6 . This equation was solved in [14] using a modified algorithm based on constructing fractional-order Euler polynomials. The reported MAE is 4.5311 × 10 7 for m = 6 , α = 1 2 . As seen, the obtained results are close together. The figures of the exact and approximate solutions are plotted in Figure 5 for η = 1 , N = 6 . As seen, the approximate solution has good agreement with the exact one. In Figure 6, approximate solutions are observed for N = 6 and η = 0.7 , 0.8 , 0.9 , 1 . It can be seen that the numerical solutions get close to the exact one as η 1 . The values of absolute errors of the approximate solution at equally spaced points t j = 0.2 j , j = 0 , 1 , , 5 are seen in Table 2 for N = 6 and η = 0.8 , 0.9 , 1 . It can be found that when η 1 , the values of the errors decrease.
Example 4.
Consider the following FDIDE with the singular kernels [14]:
0 C D t η Z ( t ) = Z ( t 2 ) + 0 t ξ Z ( ξ ) ( t ξ ) 1 2 d ξ + 0 t ξ Z ( ξ 2 ) ( t ξ ) 1 3 d ξ + 2 t 32 35 t 7 2 243 1760 t 11 3 1 4 t 2 , 0 < η 1 , t I 0 .
The exact solution is Z ( t ) = t 2 if η = 1 and the initial condition is Z ( 0 ) = 0 . This equation is solved by the presented method and the value of the MAE is 4.7670 × 10 20 for η = 1 and N = 3 , while the MAE reported by [14] is 5.511 × 10 16 for ν = α = 1 and m = 3 . So, the proposed method has given the more accurate result with the same number of basis functions. The figures of the exact and approximate solutions are plotted in Figure 7 for η = 1 , N = 5 . As seen, the approximate solution has good agreement with the exact one. In Figure 8, approximate solutions are observed for N = 5 and η = 0.6 , 0.7 , 0.8 , 0.9 , 1 . It can be seen that the numerical solutions converge the exact one as η 1 .

8. Conclusions

In this paper, the VFPs were applied to set a new matrix spectral method for solving FDIDEs. First, operational matrices of the integration of fractional and integer orders, a pseudo-operational matrix for the integral parts with singular kernels, a delay operational matrix, and a product operational matrix were constructed, and then the collocation method along with the obtained operational matrices were used for reducing the FDIDEs to an algebraic system. The existence and uniqueness of the solution of the given problem were investigated and proved, using Krasnoselskii’s fixed point theorem. An error bound of the approximation error was computed in a Vieta–Fibonacci-weighted Sobolev space, which showed that by increasing the number of basis functions, the approximation error is decreased. A Rodrigues’ formula was presented to extract the VFPs and their derivatives, for which the orthogonality was proved, using this formula. The orthogonality property of the VFPs was required to estimate the error bounds of the approximate solutions. Most presented spectral methods in the literature have used classic orthogonal polynomials as basic functions, such as Chebyshev, Legendre, Bernstein, and Bernoulli. Constructing fractional-order orthogonal polynomials or using the discretization techniques increase the computational cost. To the best of the authors’ knowledge, the VFPs have not been employed to solve singular or delay fractional integro-differential equations. Therefore, the authors of the present paper constructed the operational matrices in a more applicable and simpler way. The reported MAEs confirm that the suggested method provides more accurate results than the ones reported by previous methods. Comparing the exact solutions and their resultant approximations in the figures and tables for the examples demonstrates the efficiency of the proposed method. The suggested scheme is extended and applied by the authors to the numerical study of some types of two-dimensional fractional integro-differential and fractional partial differential equations.

Author Contributions

Data curation, K.S. and K.H.; Formal analysis, K.S.; Funding acquisition, C.P.; Investigation, K.S.; Methodology, K.S.; Project administration, C.P.; Resources, K.H. and S.S.; Software, K.S.; Supervision, D.B., S.S. and C.P.; Validation, K.H.; Visualization, D.B., S.S. and C.P.; Writing—original draft, K.S.; Writing—review & editing, K.H., D.B., S.S. and C.P. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Acknowledgments

The authors are indebted to the anonymous reviewers for their helpful, valuable comments and suggestions in the improvement of the manuscript.

Conflicts of Interest

The authors declare that they have no competing interest.

References

  1. Yi, M.; Huang, J. CAS wavelet method for solving the fractional integro-differential equation with a weakly singular kernel. Int. J. Comput. Math. 2015, 92, 1715–1728. [Google Scholar] [CrossRef]
  2. Tang, B.Q.; Li, X.F. Solution of a class of Volterra integral equations with singular and weakly singular kernels. Appl. Math. Comput. 2008, 199, 406413. [Google Scholar] [CrossRef]
  3. Kythe, P.K.; Puri, P. Computational Method for Linear Integral Equations; Birkhauser: Boston, MA, USA, 2002. [Google Scholar]
  4. Zozulya, V.V.; Gonzalez-Chi, P.I. Weakly singular, singular and hypersingular integrals in 3-D elasticity and fracture mechanics. J. Chin. Inst. Eng. 1999, 22, 763775. [Google Scholar] [CrossRef]
  5. Mohammadi, F. Fractional integro-differential equation with a weakly singular kernel by using block pulse functions. UPB Sci. Bull. Ser. A. 2017, 79, 57–66. [Google Scholar]
  6. Wang, Y.; Zhu, L. SCW method for solving the fractional integro-differential equations with a weakly singular kernel. App. Mat. Comput. 2016, 275, 72–80. [Google Scholar] [CrossRef]
  7. Biazar, J.; Sadri, K. Solution of weakly singular fractional integro-differential equations by using a new operational approach. J. Comput. Appl. Math. 2019, 352, 453–477. [Google Scholar] [CrossRef]
  8. Du, H.; Chen, Z.; Yang, T. A stable least residue method in reproducing kernel space forsolving a nonlinear fractional integro-differential equation with a weakly singular kernel. Appl. Numer. Math. 2020, 157, 210–222. [Google Scholar] [CrossRef]
  9. Ghanbari, F.; Mokhtary, P.; Ghanbari, K. On the numerical solution of a class of linear fractional integro-differential algebraic equations with weakly singular kernels. Appl. Numer. Math. 2019, 144, 1–20. [Google Scholar] [CrossRef]
  10. Ezz-Eldien, S.S.; Doha, E.H. Fast and precise spectral method for solving pantograph type Volterra integro-differential equations. Numer. Algorithms 2019, 81, 57–77. [Google Scholar] [CrossRef]
  11. Zhao, J.; Cao, Y.; Xu, Y. Sinc numerical solution for pantograph Volterra delay-integro-differential equation. Int. J. Comput. Math. 2017, 94, 853–865. [Google Scholar] [CrossRef]
  12. Bocharov, G.A.; Rihan, F.A. Numerical modelling in biosciences with delay differential equations. J. Comput. Appl. Math. 2000, 125, 183–199. [Google Scholar] [CrossRef] [Green Version]
  13. Jerri, A. Introduction to Integral Equations with Applications; Wiley: New York, NY, USA, 1999. [Google Scholar]
  14. Rezabeyk, S.; Abbasbandy, S.; Shivanian, E. Solving fractional-order delay integro-differential equations using operational matrix based on fractional-order Euler polynomials. Math. Sci. 2020, 14, 97–107. [Google Scholar] [CrossRef]
  15. Yapman, O.; Amiraliyev, G.M.; Amirali, I. Convergence analysis of fitted numerical method for a singularly perturbed nonlinear Volterra integro-differential equation with delay. J. Comput. Appl. Math. 2019, 355, 301–309. [Google Scholar] [CrossRef]
  16. Shahmorad, S.; Ostadzad, M.H.; Baleanu, D. A Tau-like numerical method for solving fractional delay integro-differential equations. Appl. Numer. Math. 2020, 151, 322–336. [Google Scholar] [CrossRef]
  17. Muthukumar, P.; Ganesh Priya, B. Numerical solution of fractional delay differential equation by shifted Jacobi polynomials. Int. J. Comput. Math. 2017, 94, 471–492. [Google Scholar] [CrossRef]
  18. Rahimkhani, P.; Ordokhani, Y.; Babolian, E. A new operational matrix based on Bernoulli wavelets for solving fractional delay differential equations. Numer. Algor. 2017, 74, 223–245. [Google Scholar] [CrossRef]
  19. Shahmorad, S.; Ostadzad, M.H. An operational matrix method for solving delay fredholm and volterra integro-differential equations. Int. J. Comput. Methods 2016, 13, 1650040. [Google Scholar] [CrossRef]
  20. Liu, L.; Mo, H.; Deng, F. Split-step theta method for stochastic delay integro-differential equations with mean square exponential stability. Appl. Math. Comput. 2019, 353, 320–328. [Google Scholar] [CrossRef]
  21. Singh, A.K.; Mehra, M. Wavelet collocation method based on Legendre polynomials and its application in solving the stochastic fractional integro-differential equations. J. Comput. Sci. 2021, 51, 101342. [Google Scholar] [CrossRef]
  22. Mohamed, D.S.; Taher, R.A. Comparison of Chebyshev and Legendre polynomials methods for solving two dimensional Volterra-Fredholm integral equations. J. Egypt. Math. Soci. 2017, 25, 302–307. [Google Scholar] [CrossRef]
  23. Nemati, S.; Lima, P.M.; Torres, D.F.M. Numerical solution of variable-order fractional differential equations using Bernoulli polynomials. Fractal Fract. 2021, 5, 219. [Google Scholar] [CrossRef]
  24. Usman, M.; Hamid, M.; Zubair, T.; Haq, R.U.; Wang, W.; Liu, M.B. Novel operational matrices-based method for solving fractional-order delay differential equations via shifted Gegenbauer polynomials. Appl. Math. Comput. 2020, 372, 124985. [Google Scholar] [CrossRef]
  25. Faheem, M.; Raza, A.; Khan, A. Collocation methods based on Gegenbauer and Bernoulli wavelets for solving neutral delay differential equations. Math. Comput. Simulat. 2021, 180, 72–92. [Google Scholar] [CrossRef]
  26. Biazar, J.; Sadri, K. Two-variable Jacobi polynomials for solving some fractional partial differential equations. J. Comput. Math. 2020, 38, 849–873. [Google Scholar] [CrossRef]
  27. Mirzaee, F.; Samadyar, N. Numerical solution based on two-dimensional orthonormal Bernstein polynomials for solving some classes of fractional order. Appl. Math. Comput. 2019, 344, 191–203. [Google Scholar] [CrossRef]
  28. Jie, G.; Yan, L.; Guorong, S.; Mingkun, L.; Mingfang, Z.; Cunfu, H.; Yungchun, L. Legendre orthogonal polynomial method in calculating reflection and transmission coefficients of fluid-loaded functionally gradient plates. Wave Motion. 2021, 104, 102754. [Google Scholar] [CrossRef]
  29. Sahlan, M.N.; Afshari, H.; Alzabut, J.; Alobaidi, G. Using fractional Bernoulli Wavelets for solving fractional diffusion wave equations with initial and boundary conditions. Fractal Fract. 2021, 5, 212. [Google Scholar] [CrossRef]
  30. Shah, F.A.; Irfan, M.; Nisar, K.S.; Matoog, R.T.; Mahmoud, E.E. Fibonacci wavelet method for solving time-fractional telegraph equations with Dirichlet boundary conditions. Results Phy. 2021, 24, 104123. [Google Scholar] [CrossRef]
  31. Dwivedia, K.D.; Singh, J. Numerical solution of two-dimensional fractional-order reaction advection sub-diffusion equation with finite-difference Fibonacci collocation method. Math. Comput. Simulat. 2021, 181, 38–50. [Google Scholar] [CrossRef]
  32. Agarwal, P.; El-Sayed, A.A.; Tariboon, J. Vieta-Fibonacci operational matrices for spectral solutions of variable-order fractional integro-differential equations. J. Comput. Appl. Math. 2021, 382, 113063. [Google Scholar] [CrossRef]
  33. Granas, A.; Dugundji, J. Fixed Point Theory; Springer: New York, NY, USA, 2003. [Google Scholar]
  34. Guo, B.; Wang, L. Jacobi approximations in non-uniformly Jacobi-weighted Sobolev spaces. J. Approx. Theory 2004, 128, 1–41. [Google Scholar] [CrossRef] [Green Version]
Figure 1. MAEs for different values of N for Example 1.
Figure 1. MAEs for different values of N for Example 1.
Fractalfract 06 00002 g001
Figure 2. (a) Exact and approximate solutions, (b) absolute error function for N = 25 for Example 1.
Figure 2. (a) Exact and approximate solutions, (b) absolute error function for N = 25 for Example 1.
Fractalfract 06 00002 g002
Figure 3. (a) Exact and approximate solutions, (b) absolute error function for N = 6 , η = 1 for Example 2.
Figure 3. (a) Exact and approximate solutions, (b) absolute error function for N = 6 , η = 1 for Example 2.
Fractalfract 06 00002 g003
Figure 4. Approximate solutions for various values of η and N = 6 for Example 2.
Figure 4. Approximate solutions for various values of η and N = 6 for Example 2.
Fractalfract 06 00002 g004
Figure 5. (a) Exact and approximate solutions, (b) absolute error function for N = 6 , η = 1 for Example 3.
Figure 5. (a) Exact and approximate solutions, (b) absolute error function for N = 6 , η = 1 for Example 3.
Fractalfract 06 00002 g005
Figure 6. Approximate solutions for various values of η and N = 6 for Example 3.
Figure 6. Approximate solutions for various values of η and N = 6 for Example 3.
Fractalfract 06 00002 g006
Figure 7. (a) Exact and approximate solutions, (b) absolute error function for N = 5 , η = 1 for Example 4.
Figure 7. (a) Exact and approximate solutions, (b) absolute error function for N = 5 , η = 1 for Example 4.
Fractalfract 06 00002 g007
Figure 8. Approximate solutions for various values of η and N = 5 for Example 4.
Figure 8. Approximate solutions for various values of η and N = 5 for Example 4.
Fractalfract 06 00002 g008
Table 1. Absolute errors at equally spaced points for N = 25 of Example 1.
Table 1. Absolute errors at equally spaced points for N = 25 of Example 1.
t j Our MethodMethod in [14]
0.0 2.3411 × 10 6
0.2 5.4722 × 10 7 2.1171 × 10 6
0.4 1.0244 × 10 6 1.8265 × 10 4
0.6 1.8351 × 10 6 2.5511 × 10 4
0.8 3.0761 × 10 6 2.8650 × 10 4
1.0 9.0540 × 10 7 1.0307 × 10 3
Table 2. Absolute errors at equally spaced points for N = 6 for Example 3.
Table 2. Absolute errors at equally spaced points for N = 6 for Example 3.
t j η = 0.8 η = 0.9 η = 1
0.0 1.4320 × 10 4 8.5465 × 10 5 8.3830 × 10 8
0.2 2.8435 × 10 2 1.2243 × 10 2 7.1611 × 10 9
0.4 8.5384 × 10 2 3.7550 × 10 2 4.6171 × 10 8
0.6 1.6978 × 10 1 7.4345 × 10 2 3.7699 × 10 8
0.8 3.0641 × 10 1 1.3095 × 10 1 7.6940 × 10 9
1.0 5.7394 × 10 1 2.3424 × 10 1 3.0170 × 10 6
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Sadri, K.; Hosseini, K.; Baleanu, D.; Salahshour, S.; Park, C. Designing a Matrix Collocation Method for Fractional Delay Integro-Differential Equations with Weakly Singular Kernels Based on Vieta–Fibonacci Polynomials. Fractal Fract. 2022, 6, 2. https://doi.org/10.3390/fractalfract6010002

AMA Style

Sadri K, Hosseini K, Baleanu D, Salahshour S, Park C. Designing a Matrix Collocation Method for Fractional Delay Integro-Differential Equations with Weakly Singular Kernels Based on Vieta–Fibonacci Polynomials. Fractal and Fractional. 2022; 6(1):2. https://doi.org/10.3390/fractalfract6010002

Chicago/Turabian Style

Sadri, Khadijeh, Kamyar Hosseini, Dumitru Baleanu, Soheil Salahshour, and Choonkil Park. 2022. "Designing a Matrix Collocation Method for Fractional Delay Integro-Differential Equations with Weakly Singular Kernels Based on Vieta–Fibonacci Polynomials" Fractal and Fractional 6, no. 1: 2. https://doi.org/10.3390/fractalfract6010002

APA Style

Sadri, K., Hosseini, K., Baleanu, D., Salahshour, S., & Park, C. (2022). Designing a Matrix Collocation Method for Fractional Delay Integro-Differential Equations with Weakly Singular Kernels Based on Vieta–Fibonacci Polynomials. Fractal and Fractional, 6(1), 2. https://doi.org/10.3390/fractalfract6010002

Article Metrics

Back to TopTop