Research

# A Jacobi operational matrix for solving a fuzzy linear fractional differential equation

Ali Ahmadian1*, Mohamed Suleiman1, Soheil Salahshour2 and Dumitru Baleanu345

Author Affiliations

1 Institute for Mathematical Research, Universiti Putra Malaysia, Serdang, Selangor, 43400 UPM, Malaysia

2 Young Researchers and Elite Club, Mobarakeh Branch, Islamic Azad University, Mobarakeh, Iran

3 Department of Mathematics and Computer Sciences, Faculty of Art and Sciences, Çankaya University, Ankara, Balgat, 0630, Turkey

4 Department of Chemical and Materials Engineering, Faculty of Engineering, King Abdulaziz University, Jeddah, 21589, Saudi Arabia

5 Institute of Space Sciences, Magurele, Bucharest, Romania

For all author emails, please log on.

Advances in Difference Equations 2013, 2013:104  doi:10.1186/1687-1847-2013-104

 Received: 31 January 2013 Accepted: 3 April 2013 Published: 16 April 2013

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

### Abstract

This paper reveals a computational method based using a tau method with Jacobi polynomials for the solution of fuzzy linear fractional differential equations of order 0 < v < 1 . A suitable representation of the fuzzy solution via Jacobi polynomials diminishes its numerical results to the solution of a system of algebraic equations. The main advantage of this method is its high robustness and accuracy gained by a small number of Jacobi functions. The efficiency and applicability of the proposed method are proved by several test examples.

PACS Codes: 02, 02.30.Jr, 02.60.-x, 45.10.Hj.

##### Keywords:
fuzzy fractional differential equation; Caputo-type fuzzy fractional derivative; single-term Caputo fractional differential equation; Jacobi polynomials; operational matrix

### 1 Introduction

Recently, the enormous number of applications in the field of fractional calculus and fractional differential equations has been visualized. Fractional differential equations provide an outstanding instrument to describe the complex phenomena in fields of viscoelasticity, electromagnetic waves, diffusion equations and so on [1-5]. Moreover, the fractional order models of real systems are more sufficient in comparison with the integer order cases. Therefore, the field of fractional calculus has motivated the interest of researchers in various fields like physics, chemistry, engineering and even finance [6-10].

Finding a high accurate and efficient numerical method has become a significant research due to except for a few number of these equations, there exists difficulty to find the exact solution of fractional differential equations (FDEs). Consequently, various numerical methods have appeared to approximate reasonably the analytical solutions. These methods are such as the predictor corrector method [11], Adomian decomposition method (ADM) [12-15], variational iteration method (VIM) [16,17] and homotopy analysis method (HAM) [18,19].

Orthogonal functions have received noticeable consideration in dealing with various problems. The main advantage behind the approach using this method is that it reduces these problems to those of solving a system of algebraic equations leading to simplify the original problem clearly. Saadatmandi and Dehghan [20] presented a shifted Legendre tau method with an operational matrix for the numerical solution of a multilinear and nonlinear fractional differential equation. Esmaeili et al.[21] introduced a direct method using the collocation method and Müntz polynomials for the solution of FDEs. Consequently, the operational matrix of the other orthogonal polynomials has been derived for solving FDEs with boundary conditions and initial conditions, like Chebyshev polynomials [22,23], Laguerre series [24], fractional Legendre polynomials [25], generalized hat basis functions [26] and Jacobi polynomials [27,28].

The study of fuzzy differential equations (e.g., in this contribution, we consider fuzzy fractional differential equation) creates a suitable setting for mathematical modeling of real-world problems in which uncertainties or vagueness penetrate. A comprehensive approach to this kind of equations has been considered by Seikkala [29] and Kaleva [30]. Despite the vast applications of the H-derivative introduced by them, due to an important drawback in this kind of derivative, Bede and Gal [31] introduced strongly generalized differentiability and followed up by the authors in [32,33]. Actually, strongly generalized differentiability can be applied for a more enormous class of fuzzy differential equations than Hukuhara differentiability.

Recently, some attempts have been made for solving fuzzy fractional differential equations (FFDEs) that Agarwal et al. was a pioneer [34]. They considered the solution of FFEDs under Riemann-Liouville’s differentiability. Also, Salahshour et al.[35] studied the existence, uniqueness and approximate solutions of (FFDEs) under Caputo’s H-differentiability. Afterward, Mazandarani, Vahidian Kamyad [36] applied the fractional Euler method for FFDEs under Caputo-type differentiability and Salahshour et al.[37] extended fuzzy Laplace transforms for solving FFDEs under the Riemann-Liouville H-derivative.

Our main motivation for preparing this paper is to generalize shifted Jacobi function operational matrix for solving fuzzy fractional differential equations of order 0 < v < 1 under Caputo’s H-differentiability. We introduce a suitable way to approximate fuzzy solution of linear fuzzy fractional differential equations by means of shifted Jacobi functions based on the fuzzy residual of the problem in which the Jacobi operational matrix is introduced to be applied in the derivation of the proposed method. Another motivation is that the approximate solution based on the shifted Jacobi polynomials, P i ( α , β ) ( x ) ( i 0 , α , β > 1 ), can be obtained in terms of the Jacobi parameters α and β. Therefore, instead of using with particular indexes, the solution can be derived generally to extend for other requests.

The paper organized as follows. In Section 2, we present some relevant properties of fuzzy sets, fuzzy differential equations and Jacobi polynomials with its error bound for approximate function accompanied by some details of JOM based on shifted Jacobi polynomials in crisp concept. Also, Caputo type derivative definition and its properties in the crisp sense is considered in this section. Some basic concepts of fuzzy fractional derivatives are explained in Section 3. Section 4 is devoted to the fuzzy approximation function using shifted Jacobi polynomials. Additionally, the Jacobi operational matrix (JOM) based on shifted Jacobi polynomials is extended for solving FFDEs in this section. Several examples are experienced to depict the effectiveness of the proposed method in Section 5. Finally, some conclusions are drawn in Section 6.

### 2 Preliminaries

Let us denote by E the class of fuzzy subsets u of the real axis ℝ (i.e. u : R [ 0 , 1 ] satisfying the following properties):

(i) u is upper semicontinuous,

(ii) u is fuzzy convex, i.e., u ( λ x + ( 1 λ ) y ) min { u ( x ) , u ( y ) } for all x , y R , λ [ 0 , 1 ] ,

(iii) u is normal, i.e., x 0 R for which u ( x 0 ) = 1 ,

(iv) supp u = { x R | u ( x ) > 0 } is the support of the u, and its closure cl ( supp u ) is compact.

Then E is called the space of fuzzy real numbers and any u E is called fuzzy real number (see, e.g., [38]).

The α-level set of a fuzzy number u ˜ E , 0 r 1 , denoted by [ u ] r , is defined as

[ u ] r = { { x R | u ( x ) r } if  0 < r 1 , cl ( supp u ) if  r = 0 .

It is clear that the r-level set of a fuzzy number is a closed and bounded interval [ u r , u + r ] , where u r denotes the left-hand endpoint of [ u ] r and u + r denotes the right-hand endpoint of [ u ] r . Since each y R can be regarded as a fuzzy number y ˜ defined by

y ˜ ( t ) = { 1 if  t = y , 0 if  t y ,

ℝ can be embedded in E .

The addition and scaler multiplication of fuzzy number in E are defined as follows:

(1) u v = ( u + v , u + + v ) , (2) ( λ u ˜ ) = { ( λ u r , λ u + r ) , λ 0 , ( λ u + r , λ u r ) , λ < 0 .

We can define a matrix D on E ( D : E × E R + 0 ) by a distance which is so-called Hausdorff distance as follows:

D ( u , v ) = sup r [ 0 , 1 ] max { | u r v r | , | u + r v + r | } .

Then the following properties are known (see [38,39]):

(i) D ( u ˜ w ˜ , v ˜ w ˜ ) = D ( u ˜ , v ˜ ) , u ˜ , v ˜ , w ˜ E ,

(ii) D ( k u ˜ , k v ˜ ) = | k | D ( u ˜ , v ˜ ) , k R , u ˜ , v ˜ E ,

(iii) D ( u ˜ v ˜ , w ˜ e ˜ ) D ( u ˜ , w ˜ ) + D ( v ˜ , e ˜ ) , u ˜ , v ˜ , w ˜ E ,

(iv) D ( u ˜ + v ˜ , 0 ˜ ) D ( u , 0 ˜ ) + D ( v , 0 ˜ ) , u , v E ,

(v) ( E , D ) is a complete metric space.

Definition 1 ([40])

Let f and g be the two fuzzy-number-valued functions on the interval [ a , b ] , i.e., f , g : [ a , b ] E . The uniform distance between fuzzy-number-valued functions is defined by

D ( f , g ) : = sup x [ a , b ] D ( f ( x ) , g ( x ) ) . (1)

Remark 1 ([39])

Let f : [ a , b ] E be fuzzy continuous. Then from property (iv) of Hausdorff distance, we can define

D ( f ( x ) , 0 ˜ ) = sup r [ 0 , 1 ] max { | f r ( x ) | , | f + r ( x ) | } , x [ a , b ] .

Definition 2 ([30])

Let x , y E . If there exists z E such that x = y z , then z is called the H-difference of x and y, and it is denoted by x y .

In this paper, the sign ‘⊖’ always stands for H-difference and note that x y x + ( y ) . Also, throughout of paper is assumed the Hukuhara difference and generalized Hukuhara differentiability are existed.

Definition 3 ([41])

The generalized difference (g-difference for short) of two fuzzy numbers u , v E is given by the expression

[ u g v ] α = [ inf β α min { u β v β , u β + v β + } , sup β α max { u β v β , u β + v β + } ] .

Proposition 1 ([41])

For any fuzzy numbers u , v E theg-difference u g v exists and it is a fuzzy number.

In this paper, we consider the definition of fuzzy differentiability presented by Bede and Gal in [32].

Definition 4 ([32])

Let f : ( a , b ) E and x 0 ( a , b ) . We say that f is strongly generalized differential at x 0 . If there exists an element f ( x ) E , such that

(i) for all h > 0 sufficiently small, f ( x 0 + h ) f ( x 0 ) , f ( x 0 ) f ( x 0 h ) and the limits (in the metric d)

lim h 0 + f ( x 0 + h ) f ( x 0 ) h = lim h 0 + f ( x 0 ) f ( x 0 h ) h = f ( x 0 ) ,

(ii) for all h > 0 sufficiently small, f ( x 0 ) f ( x 0 + h ) , f ( x 0 h ) f ( x 0 ) and the limits (in the metric d)

lim h 0 + f ( x 0 ) f ( x 0 + h ) h = lim h 0 + f ( x 0 h ) f ( x 0 ) h = f ( x 0 ) ,

(iii) for all h > 0 sufficiently small, f ( x 0 + h ) f ( x 0 ) , f ( x 0 h ) f ( x 0 ) and the limits (in the metric d)

lim h 0 + f ( x 0 + h ) f ( x 0 ) h = lim h 0 + f ( x 0 h ) f ( x 0 ) h = f ( x 0 ) ,

(iv) for all h > 0 sufficiently small, f ( x 0 ) f ( x 0 + h ) , f ( x 0 ) f ( x 0 h ) and the limits (in the metric d)

lim h 0 + f ( x 0 ) f ( x 0 + h ) h = lim h 0 + f ( x 0 ) f ( x 0 h ) h = f ( x 0 ) .

Remark 2f is so-called (1)-differentiable on ( a , b ) , if f is differentiable in the sense (i) of Definition 4 and also f is (2)-differentiable on ( a , b ) , if f is differentiable in the sense (ii) of Definition 4.

The following theorem was proved by Chalco-Cano and Román-Flores [42] based on Definition 4.

Theorem 1 (see [42])

Let F : ( a , b ) E be a function and denote [ F ( t ) ] r = [ f r ( t ) , g r ( t ) ] , for each r [ 0 , 1 ] . Then:

(1) IfFis (1)-differentiable, then f r ( t ) and g r ( t ) are differentiable functions and

[ F ( t ) ] r = [ f r ( t ) , g r ( t ) ] .

(2) IfFis (1)-differentiable, then f r ( t ) and g r ( t ) are differentiable functions and

[ F ( t ) ] r = [ g r ( t ) , f r ( t ) ] .

Theorem 2 (see [43])

Let f ( x ) be a fuzzy-valued function on [ a , ) and it is represented by ( f r ( x ) , f + r ( x ) ) . For any fixed r [ 0 , 1 ] , assume ( f r ( x ) and f + r ( x ) ) are Riemann-integrable on [ a , b ] for every b a , and assume there are two positive M r and M + r such that a b | f r ( x ) | d x M r and a b | f + r ( x ) | d x M + r for every b a . Then f ( x ) is improper fuzzy Riemann-integrable on [ a , ) and the improper fuzzy Riemann-integral is a fuzzy number. Furthermore, we have

a f ( x ) d x = [ a f r ( x ) d x , a f + r ( x ) d x ] .

Definition 5 ([39])

f ( x ) : [ a , b ] E . We say that ffuzzy-Riemann integrable to I E , if for any ϵ > 0 , there exists δ > 0 such that for any division P = { [ u , v ] ; ξ } of [ a , b ] with the norms Δ ( P ) < δ , we have

D ( P ( u v ) f ( ζ ) , I ) < ε ,

where ∑ means addition with respect to ⊕ in E

I : = ( FR ) a b f ( x ) d x .

We also call an f as above ( FR ) -integrable.

Definition 6 ([44])

Consider the n × n linear system of equations:

{ a 11 x 1 + a 12 x 2 + + a 1 n x n = y 1 , a 21 x 1 + a 22 x 2 + + a 2 n x n = y 2 , a n 1 x 1 + a n 2 x 2 + + a n n x n = y n . (2)

The matrix form of the above equations is

A X = Y , (3)

where the coefficient matrix A = ( a i j ) , 1 i , j n is a crisp n × n matrix and y i E , 1 i n . This system is called a fuzzy linear system (FLS).

Definition 7 ([44])

A fuzzy number vector ( x 1 , x 2 , , x n ) t given by x i = ( x i r , x i + r ) , 1 i n , 0 r 1 is called a solution of the fuzzy linear system (2) if

( j = 1 n a i j x j ) r = j = 1 n ( a i j x j ) r = y i r , ( j = 1 n a i j x j ) + r = j = 1 n ( a i j x j ) + r = y i + r .

If for a particular k, a k j > 0 , 1 j n , we simply get

j = 1 n a k j x j r = y k r , j = 1 n a k j x j + r = y k + r .

To solve fuzzy linear systems, one can refer to [44,45].

Now, we review some basic definitions of fractional integral and derivative, especially Caputo type, with their properties presented in crisp context [6,46].

Remark 3 The fuzzy fractional derivative, in this paper, is assumed in the Caputo sense. The reason for adopting the Caputo definition, as pointed by Momani and Noor [47], is as follows: to solve differential equations (both classical and fractional), we need to specify additional conditions in order to produce a unique solution. Therefore, for the case of the fuzzy Caputo fractional differential equations, these additional conditions are just the traditional conditions, which are akin to those of classical fuzzy differential equations, and are therefore familiar to us. In contrast, for the fuzzy Riemann-Liouville fractional differential equations, these additional conditions constitute certain fuzzy fractional derivatives (and/or integrals) of the unknown solution at the initial point x = 0 , which are functions of x. These fuzzy initial conditions are not physical like in the crisp concept; furthermore, it is not clear how such quantities are to be measured from experiment, say, so that they can be appropriately assigned in an analysis. See more details in [35,37,48].

Definition 8 ([46])

The Riemann-Liouville fractional integral operator of order v, v 0 is defined as

( I v f ) ( x ) = 1 Γ ( v ) 0 x f ( t ) ( x t ) 1 v d t , v > 0 , x > 0 , I 0 f ( x ) = f ( x ) .

Definition 9 ([6])

The Caputo fractional derivatives of order v is defined as

D v f ( x ) = I m v D m f ( x ) = 1 Γ ( m v ) 0 x ( x t ) m v 1 f m ( t ) d t , m 1 < v m , x > 0 ,

where D m is the classical differential operator of order m.

For the Caputo derivative, we have:

D v c C = 0 ( C  is a constant ) , D v c x β = { 0 , for  β N 0  and  β < v , Γ ( β + 1 ) Γ ( β + 1 v ) x β v , for  β N 0  and  β v  or  β N  and  β > v .

The ceiling function v is used to denote the smallest integer greater than or equal to v, and the floor function v to denote the largest integer less than or equal to v. Also N = { 1 , 2 , } and N 0 = { 0 , 1 , 2 , } .

Definition 10 ([48])

Similar to the differential equation of integer order, the Caputo’s fractional differentiation is a linear operation, i.e.,

D v c ( λ f ( x ) + μ g ( x ) ) = λ c D v f ( x ) + μ c D v g ( x ) ,

where λ and μ are constants.

Definition 11 ([49])

A classical (crisp) set is normally defined as a collection of elements or objects x X which can be finite, accountable, or overcountable. Each single element can either belong to or not belong to a set A, A X while in a fuzzy set (subset) elements of the set have a degree of membership in the set.

Remark 4 Throughout the paper, we use the crisp context frequently, regarding to Definition 11.

#### 2.1 Jacobi polynomials

The Jacobi polynomials, denoted by J n α , β ( z ) , are orthogonal with Jacobi weight function: w ( z ) = ( 1 z ) α ( 1 + z ) β over [ 1 , 1 ] , namely [50,51],

1 1 J n α , β ( z ) J m α , β ( z ) w ( z ) d z = γ n α , β δ n m ,

where δ n m is the Kronecker function and

γ n α , β = 2 α + β + 1 Γ ( n + α + 1 ) Γ ( n + β + 1 ) ( 2 n + α + β + 1 ) n ! Γ ( n + α + β + 1 ) .

Also, the Jacobi polynomials can be created by means of the following recurrence formula:

J i ( α , β ) ( z ) = ( α + β + 2 i 1 ) { α 2 β 2 + t ( α + β + 2 i ) ( α + β + 2 i 2 ) } 2 i ( α + β + i ) ( α + β + 2 i 2 ) J i 1 ( α , β ) ( z ) ( α + i 1 ) ( β + i 1 ) ( α + β + 2 i ) i ( α + β + i ) ( α + β + 2 i 2 ) J i 2 ( α , β ) ( z ) ,

for i = 2 , 3 ,  , where J 0 ( α , β ) ( z ) = 1 , and J 1 ( α , β ) ( z ) = α + β + 2 2 z + α β 2 . In order to use these polynomials on the interval x [ 0 , 1 ] , we define the so-called shifted Jacobi polynomials by introducing the change of variable z = 2 x 1 . Let the shifted Jacobi polynomials J n ( α , β ) ( 2 x 1 ) be denoted by P i ( α , β ) ( x ) . The shifted Jacobi polynomials are orthogonal with respect to the weight function w ( α , β ) ( x ) = ( 1 x ) α x β in the interval [ 0 , 1 ] with the orthogonality property

0 1 P n α , β ( x ) P m α , β ( x ) w ( α , β ) ( x ) d x = ν n α , β δ n m ,

at which ν n α , β δ n m = γ n α , β / 2 α + β + 1 . The analytic form of the shifted Jacobi polynomials P i α , β ( x ) of degree i is acquired by

P i ( α , β ) ( x ) = k = 0 i ( 1 ) i k Γ ( i + β + 1 ) Γ ( i + k + α + β + 1 ) Γ ( k + β + 1 ) Γ ( i + α + β + 1 ) ( i k ) ! k ! x k ,

that

P 0 ( α , β ) ( 0 ) = ( 1 ) i Γ ( i + β + 1 ) Γ ( β + 1 ) i ! , P 1 ( α , β ) ( 1 ) = Γ ( i + α + 1 ) Γ ( α + 1 ) i ! .

Also, the shifted Jacobi polynomial can be stated by the following concise form.

Lemma 1 ([28])

The shifted Jacobi polynomial P n ( α , β ) ( x ) can be obtained in the form of

P n ( α , β ) ( x ) = i = 0 n P i ( n ) x i ,

in which P i ( n ) are

P i ( n ) = ( 1 ) n i ( n + α + β + i i ) ( n + α n i ) , i = 0 , 1 , , n .

Lemma 2 ([28])

For v > 0

0 1 x v P j ( α , β ) ( x ) w ( α , β ) ( x ) d x = l = 0 j P l ( j ) B ( v + l + β + 1 , α + 1 ) ,

in which B ( s , t ) is the Beta function and stated as

B ( s , t ) = 0 1 v s 1 ( 1 v ) t 1 d v = Γ ( s ) Γ ( t ) Γ ( s + t ) .

Let Ω = ( 0 , 1 ) and { P i ( α , β ) ( x ) } i = 0 m generate the space P m + 1 , α , β . A function f belonging to L w 2 ( Ω ) , can be expanded in P m + 1 , α , β by

f ( x ) = i = 0 + θ i P i ( α , β ) ( x ) ,

where the coefficients θ i are gained by

θ i = 1 ν i α , β 0 1 P i ( α , β ) ( x ) f ( x ) w ( α + β ) ( x ) d x , i = 0 , 1 , .

Realistically, only the first ( m + 1 ) -terms shifted Jacobi polynomials are considered. Then we have

f ( x ) f m ( x ) = i = 0 m θ i P i ( α , β ) ( x ) = Θ T Φ ( x ) , (4)

that

Θ = [ θ 0 , θ 1 , , θ m ] T , Φ ( x ) = [ P 0 ( α , β ) ( x ) , P 1 ( α , β ) ( x ) , , P m ( α , β ) ( x ) ] T .

Regarding to P m + 1 , α , β as a finite dimensional vector space, f has a unique best approximation from P m + 1 , α , β , say f m ( x ) P m + 1 , α , β , that is,

y P m + 1 , α , β , f ( x ) f m ( x ) w f ( x ) y w .

So, the following lemma provides the upper bound of approximate function f m + 1 ( x ) using shifted Jacobi polynomials. This error bound proves that the approximate function f m ( x ) converges to f ( x ) based on shifted Jacobi polynomials.

Lemma 3 ([28])

Let the function f : [ x 0 , 1 ] R be m + 1 times continuously differentiable for x 0 > 0 , f C m + 1 [ x 0 , 1 ] , and P m + 1 , α , β = Span { P i ( α , β ) ( x ) } i = 0 m . If f m = Θ T Φ ( x ) is the best approximation toffrom P m + 1 , α , β , then the error bound is presented as follows:

f ( x ) f m ( x ) w M S m + 1 ( m + 1 ) ! B ( α + 1 , β + 1 ) ,

that M = max x [ x 0 , 1 ] f ( m + 1 ) ( x ) and S = max { 1 x 0 , x 0 } .

#### 2.2 Operational matrix of Caputo’s derivative of order v

In this section, the Jacobi operational matrix method based on the Caputo-type fractional derivative with using shifted Jacobi polynomials is explained. Afterward, an upper bound for the absolute error between the exact and approximate values of Caputo fractional derivative operator is provided (for more details, see [27,28]).

Lemma 4 ([27])

Let Φ ( x ) be shifted Jacobi vector defined in Eq. (4) and also let v > 0 . Then

D v Φ ( x ) D ( v ) Φ ( x ) , (5)

where D ( v ) is ( m + 1 ) × ( m + 1 ) operational matrix of derivatives of ordervin the Caputo sense and is defined by:

D ( v ) = ( 0 0 0 0 0 0 0 0 Δ v ( v , 0 ) Δ v ( v , 1 ) Δ v ( v , 0 ) Δ v ( v , N ) Δ v ( i , 0 ) Δ v ( i , 1 ) Δ v ( i , 2 ) Δ v ( i , N ) Δ v ( m , 0 ) Δ v ( m , 1 ) Δ v ( m , 2 ) Δ v ( m , m ) ) ,

where

Δ v ( i , j ) = k = v i δ i j k ,

and δ i j k is given by

δ i j k = ( 1 ) i k Γ ( j + β + 1 ) Γ ( i + β + 1 ) Γ ( i + k + α + β + 1 ) ν j Γ ( j + k + α + β + 1 ) Γ ( k + β + 1 ) Γ ( i + α + β + 1 ) Γ ( k v + 1 ) ( i k ) ! × l = 0 j ( 1 ) j l Γ ( j + l + α + β + 1 ) Γ ( α + 1 ) Γ ( l + k + β v + 1 ) Γ ( l + β + 1 ) Γ ( l + k + α + β v + 2 ) ( j l ) ! l ! .

Note that in D ( v ) , the first v rows, are all zeros.

Now, the following lemma gives us an upper bound for error estimation of Caputo derivative operator mentioned in Lemma 4. But initially, we define the error vector E v as:

E v = D v Φ D ( v ) Φ = [ E 0 , v , E 1 , v , , E m , v ] T ,

where

E k , v = D v P k ( α , β ) ( x ) j = 0 m D k j ( v ) P j ( α , β ) ( x ) , k = 0 , 1 , , m .

Lemma 5If the error function of Caputo fractional derivative operator for Jacobi polynomials E k , v : [ x 0 , 1 ] R is m + 1 times continuously differentiable for 0 < x 0 x , x ( 0 , 1 ] . Also E k , v C m + 1 [ x 0 , 1 ] and v < m + 1 then the error bound is gained as follows:

E k , v w x 0 v ( m + 1 ) ! | Γ ( 1 v ) | ( S ) m + 1 ( k + β k ) B ( α + 1 , β + 1 ) . (6)

Proof Analogously to the demonstration of Lemma 5 in [28], we can prove this lemma. □

Therefore, the maximum norm of error vector E v is achieved as

E v { x 0 v ( m + 1 ) ! | Γ ( 1 v ) | ( S ) m + 1 ( m + 1 + β m + 1 ) B ( α + 1 , β + 1 ) , β 0 , x 0 v ( m + 1 ) ! | Γ ( 1 v ) | ( S ) m + 1 B ( α + 1 , β + 1 ) , β < 0 .

### 3 Fuzzy Caputo-type fractional differentiability

The fuzzy fractional differentiability of order 0 < v < 1 , particularly Caputo type, is considered in this section. Some basic definitions and theorems are given and introduced the necessary notation, which will be used in the rest of paper. See, for example, [34,35,37].

At first, some notations are presented which are put to use throughout the remaining sections. It is easy to find these notations in the crisp sense. See [46,48].

L p E ( a , b ) , 1 p is the set of all fuzzy-valued measurable functions f on [ a , b ] where f p = ( 0 1 ( d ( f ( t ) , 0 ) ) p d t ) 1 p .

C E [ a , b ] is a space of fuzzy-valued functions, which are continuous on [ a , b ] .

C n E [ a , b ] indicates the set of all fuzzy-valued functions, which are continuous up to order n.

A C E [ a , b ] denotes the set of all fuzzy-valued functions, which are absolutely continuous.

Definition 12 ([37])

Let f C E L p E , the Riemann-Liouville integral of fuzzy-valued function f is as follows:

( I a + v f ) ( x ) = 1 Γ ( v ) a x f ( t ) d t ( x t ) 1 v , x > a . (7)

To specify the fuzzy Riemann-Liouville integral of fuzzy-valued function f based on the lower and upper functions, the following definition is determined.

Definition 13 ([37])

Let f C E L p E , the parametric form of the Riemann-Liouville integral of fuzzy-valued function f can be expressed by

( I a + v f ) r ( x ) = [ 1 Γ ( 1 v ) a x f r ( t ) ( x t ) v d t , 1 Γ ( 1 v ) a x f + r ( t ) ( x t ) v d t ] ,

in which f r ( x ) = [ f r ( x ) , f + r ( x ) ] and 0 < v < 1 .

Definition 14 ([35])

Let f : L E C E be a fuzzy set-value function. Then f is said to be Caputo’s fuzzy differentiable at x when

( C D a + v f ) ( x ) = 1 Γ ( 1 v ) a x f ( t ) ( x t ) v d t , (8)

where 0 < α < 1 .

Definition 15 ([35])

Let f : L E C E and x 0 ( a , b ) and Φ ( x ) = 1 Γ ( 1 v ) a x f ( t ) ( x t ) v d t . We say that f ( x ) is fuzzy Caputo fractional differentiable of order 0 < v < 1 at x 0 , if there exists an element ( c D a + v f ) ( x 0 ) C E such that for all 0 r 1 , h > 0 ,

(i) ( c D a + v f ) ( x 0 ) = lim h 0 + Φ ( x 0 + h ) Φ ( x 0 ) h = lim h 0 + Φ ( x 0 ) Φ ( x 0 h ) h ,

or

(ii) ( c D a + v f ) ( x 0 ) = lim h 0 + Φ ( x 0 ) Φ ( x 0 + h ) h = lim h 0 + Φ ( x 0 h ) Φ ( x 0 ) h ,

or

(iii) ( c D a + v f ) ( x 0 ) = lim h 0 + Φ ( x 0 + h ) Φ ( x 0 ) h = lim h 0 + Φ ( x 0 h ) Φ ( x 0 ) h ,

or

(iv) ( c D a + v f ) ( x 0 ) = lim h 0 + Φ ( x 0 ) Φ ( x 0 + h ) h = lim h 0 + Φ ( x 0 ) Φ ( x 0 h ) h .

Remark 5 A fuzzy-valued function f is [ c 1 v ] -differentiable, if it is differentiable as in the Definition 15, case (i), and it is [ c 2 v ] -differentiable, if it is differentiable as in the Definition 15, case (ii).

Theorem 3 ([35])

Let us assume that f C E [ a , b ] , then we have the following:

( I a + v c D a + v f ) ( x ) = f ( x ) f ( a ) , 0 < v < 1 ,

whenfis [ c 1 v ] -differentiable and

( I a + v c D a + v f ) ( x ) = f ( a ) ( f ( x ) ) , 0 < v < 1 ,

whenfis [ c 2 v ] -differentiable.

Lemma 6 ([35])

Let 0 < α < 1 and f A C E [ a , b ] , then the fuzzy Caputo derivative can be stated using the fuzzy fractional Riemann-Liouville integral operator as follows:

( c D a + v f ) ( x ; r ) = ( I a + 1 v D f ) ( x ; r ) = [ ( I a + 1 v D f ) r ( x ) , ( I a + 1 v D f ) + r ( x ) ] ,

whenfis [ c 1 v ] -differentiable, and

( C D a + v f ) ( x ; r ) = ( I a + 1 v D f ) ( x ; r ) = [ ( I a + 1 v D f ) + r ( x ) , ( I a + 1 α D f ) r ( x ) ] ,

whenfis [ c 2 v ] -differentiable.

### 4 Extension of JOM method for FFEDs

In this section, fuzzy approximation function by means of shifted Jacobi polynomials is derived. Moreover, the Jacobi operational matrix based of fuzzy shifted Jacobi polynomials is introduced with details and provided the application of the method for solving fuzzy linear fractional differential equations of order 0 < v < 1 . It should be mentioned that this method is the extension of the researches implemented in the crisp sense by Doha et al.[27] and Kazem [28].

In [52-54], the authors established the concepts of the best approximation of fuzzy function and as an application, Lowen introduced fuzzy approximation of fuzzy function by means of Lagrange interpolation [55]. Firstly, we define the approximate fuzzy function using shifted Jacobi polynomials.

Definition 16 For y L p E [ 0 , 1 ] C E [ 0 , 1 ] and shifted Jacobi polynomial P n ( α , β ) ( x ) a real valued function over [ 0 , 1 ] , the fuzzy function is approximated by

y ( x ) = i = 0 + θ i P i ( α , β ) ( x ) ,

where the fuzzy coefficients θ i are gained by

θ i = 1 ν i α , β 0 1 P i ( α , β ) ( x ) y ( x ) w ( α + β ) ( x ) d x , i = 0 , 1 , (9)

in which w ( α , β ) ( x ) = ( 1 x ) α x β , P i ( α , β ) ( x ) is as the same as the shifted Jacobi polynomials described in Section 2.1, and ∑ means addition with respect to ⊕ in E .

Remark 6 In practice, only the first ( m + 1 ) -terms shifted Jacobi polynomials are taken into consideration. So, we have

y ( x ) y ˜ m + 1 ( x ) = i = 0 m θ i P i ( α , β ) ( x ) = Θ m + 1 T Φ m + 1 ( x ) , (10)

that the fuzzy shifted Jacobi coefficient vector Θ m + 1 T and shifted Jacobi function vector Φ m + 1 ( x ) are explained by:

Θ m + 1 T = [ θ 0 , θ 2 , , θ m ] , (11)

Φ m + 1 ( x ) = [ P 0 ( α , β ) ( x ) , P 1 ( α , β ) ( x ) , , P m ( α , β ) ( x ) ] T . (12)

Since θ i r = [ θ i , r , θ i , + r ] , for all 0 r 1 , then we can point out the fuzzy approximation function y m ( x ) , according to the lower and upper functions as follows.

Definition 17 Let y ( x ) L p E [ 0 , 1 ] C E [ 0 , 1 ] , the approximation of fuzzy-valued function y ( x ) in the parametric form is

y r ( x ) y ˜ m + 1 r ( x ) = [ i = 0 m θ i , r P i ( α , β ) ( x ) , i = 0 m θ i , + r P i ( α , β ) ( x ) , ] , 0 r 1 . (13)

Theorem 4The best approximation of a fuzzy function based on the Jacobi points exists and is unique.

Proof The proof is an immediate result of Theorem 4.2.1 in [54]. □

Now, in the following theorem, we will achieve the error bound for the fuzzy approximate function based on shifted Jacobi polynomials. Actually, this error bound depicts that the approximation converges to the fuzzy function y ( x ) .

Theorem 5Consider the function y ( x ) : [ x 0 , 1 ] L p E [ 0 , 1 ] C E [ 0 , 1 ] is m + 1 times continuously fuzzy differentiable for x 0 > 0 , y ( x ) C m + 1 E [ x 0 , 1 ] , and P m + 1 , α , β = Span { P 0 ( α , β ) ( x ) , P 1 ( α , β ) ( x ) , , P m ( α , β ) ( x ) } . If y m = Θ T Φ ( x ) is the best fuzzy approximation to y ( x ) from P m + 1 , α , β , then the error bound is presented as follows:

D ( y ( x ) , y m ( x ) ) M S m + 1 ( m + 1 ) ! B ( α + 1 , β + 1 ) ,

that M r = max x [ x 0 , 1 ] { M r , M + r } and S = max { 1 x 0 , x 0 } .

Proof It follows from Definition 1 of D that

D ( y ( x ) , y m ( x ) ) = sup x [ 0 , 1 ] D ( y ( x ) , y m ( x ) ) = sup x [ 0 , 1 ] sup r [ 0 , 1 ] max { | y r ( x ) y m , r ( x ) | , | y + r ( x ) y m , + r ( x ) | } = sup r [ 0 , 1 ] max { y r ( x ) y m , r ( x ) , y + r ( x ) y m , + r ( x ) } Lemma 3 sup r [ 0 , 1 ] max { M r S m + 1 ( m + 1 ) ! B ( α + 1 , β + 1 ) , M + r S m + 1 ( m + 1 ) ! B ( α + 1 , β + 1 ) } M S m + 1 ( m + 1 ) ! B ( α + 1 , β + 1 ) ,

in which M r = max x [ x 0 , 1 ] { M r , M + r } and S = max { 1 x 0 , x 0 } . This completes the proof of theorem. □

#### 4.1 Jacobi operational matrix

This part is devoted to the operational matrix of shifted Jacobi polynomials regarding to fuzzy Caputo’s derivative. The operational matrix play an important role in solving fractional differential equations by means of orthogonal functions [22,23,25,27,28]. Our aim in this section is to generalize this method for solving fuzzy linear fractional differential equations.

Lemma 7The fuzzy Caputo fractional derivative of order 0 < v < 1 over the shifted Jacobi functions can be acquired in the form of

D v c P i ( α , β ) ( x ) = k = 0 i P k ( i ) Γ ( k + 1 ) Γ ( k v + 1 ) x k v ,

where P k ( i ) = 0 for i < v and for i v , we have P k ( i ) = P k ( i ) .

Proof It is straightforward from Section 2.1 and the Caputo derivative of x k . □

The fuzzy Caputo operational matrix based on the shifted Jacobi polynomials is expressed as well as relation (5). So, we have

D v E Φ ( x ) E D ( v ) Φ ( x ) , (14)

where D ( v ) is the ( m + 1 ) -square operational matrix of fuzzy fractional Caputo’s derivative of shifted Jacobi polynomials and D v E Φ ( x ) C E [ a , b ] . So, using (10) and (14), we can approximate the fuzzy fractional Caputo’s derivative as

D v E y ( x ) E D ( v ) y ˜ m + 1 ( x ) = i = 0 m θ i E D ( v ) P i ( α , β ) ( x ) = Θ m + 1 T E D ( v ) Φ m + 1 ( x ) . (15)

The subsequent property of the product of two fuzzy Jacobi function vectors will also be utilized

Φ Φ T Θ Θ Φ , (16)

that Θ is a m + 1 product operational matrix for the vector Θ, which its elements { Θ } i , j = 0 m can be calculated from:

Θ i j = 1 ν j α , β k = 0 m θ k g i j k , (17)

where g i j k is acquired by

g i j k = 0 1 P i α , β ( x ) P j α , β ( x ) w α , β ( x ) d x .

The error bound of fuzzy Caputo fractional differential operator is taken into consideration in the next theorem for 0 < v < 1 . Therefore, we clarify the E v E as

E v E = E D v Φ ( x ) E D ( v ) Φ ( x ) = [ E 0 , v , E 1 , v , , E m , v ] T ,

where

E k , v = E D v P k ( α , β ) ( x ) j = 0 m E D k j ( v ) P j ( α , β ) ( x ) , k = 0 , 1 , , m .

Theorem 6Assume that the error function of fuzzy Caputo fractional derivative operator for shifted Jacobi polynomials E k , v be m + 1 times continuously fuzzy differentiable for 0 < x 0 x , x ( 0 , 1 ] . Additionally, E k , v C m + 1 E [ x 0 , 1 ] and 0 < v < 1 then the error bound is given by

D ( E D v Φ ( x ) , E D ( v ) Φ ( x ) ) x 0 v ( m + 1 ) ! | Γ ( 1 v ) | ( S ) m + 1 ( m + 1 + β m + 1 ) B ( α + 1 , β + 1 ) . (18)

Proof Again using Definition 1 of D and Lemma 5, we have

D ( E D v Φ ( x ) , E D ( v ) Φ ( x ) ) = sup x [ 0 , 1 ] D ( E D v Φ ( x ) , E D ( v ) Φ ( x ) ) = sup x [ 0 , 1 ] sup r [ 0 , 1 ] max { | ( E D v Φ ( x ) ) r ( E D ( v ) Φ ( x ) ) r | , | ( E D v Φ ( x ) ) + r ( E D ( v ) Φ ( x ) ) + r | } = sup x [ 0 , 1 ] sup r [ 0 , 1 ] max { | E D v ( Φ r ( x ) ) E D ( v ) ( Φ r ( x ) ) | , | ( E D v Φ + r ( x ) ) ( E D ( v ) Φ + r ( x ) ) | } = sup r [ 0 , 1 ] max { E D v ( Φ r ( x ) ) E D ( v ) ( Φ r ( x ) ) , ( E D v Φ + r ( x ) ) ( E D ( v ) Φ + r ( x ) ) } = sup r [ 0 , 1 ] max { E E v , r , E E v , + r } x 0 v ( m + 1 ) ! | Γ ( 1 v ) | ( S ) m + 1 ( m + 1 + β m + 1 ) B ( α + 1 , β + 1 ) .

□

#### 4.2 Application of the JOM of the fractional Caputo derivative

In this section, the Jacobi operational matrix derived from the previous sections is applied for solving linear FFDEs of order 0 < v < 1 based on the shifted Jacobi polynomials. The fuzzy residual of the general single-term FFDEs is obtained and then using the orthogonal property of the Jacobi polynomials, a fuzzy algebraic system is extracted, which is solved easily to find the unknown fuzzy coefficient of the approximate solution of the problem.

Let us consider the general linear fuzzy fractional differential equation

{ ( c D 0 + v y ) ( x ) = y ( x ) f ( x ) , 0 < v 1 , y ( 0 ) = y 0 E , (19)

in which y ( x ) : L E C E is a continuous fuzzy-valued function, D 0 + v c denotes the fuzzy Caputo fractional derivative of order v and f ( x ) : [ 0 , 1 ] E .

In the following theorem, we clarify the way to find the fuzzy unknown coefficient of the fuzzy approximate function y ˜ m + 1 ( x ) , using the fuzzy residual function of the problem easily.

Theorem 7Let y r C E [ 0 , 1 ] and 0 < v 1 , then

[ ( c D ( v ) y ˜ m ) ( x ) ] ( r ) = [ R m ( x ) f ˜ m ( x ) y ˜ m ( x ) ] ( r ) .

Proof Let r [ 0 , 1 ] . At first, from Eqs. (14) and (15) we can replace solution y ( x ) with y m ( x ) ,

[ ( c D 0 + ( v ) y ˜ m ) ( x ) ] ( r ) = [ ( c D 0 + ( v ) y ˜ m ) r ( x ) , ( c D 0 + ( v ) y ˜ m ) + r ( x ) ] , [ y ˜ m ( x ) ] ( r ) = [ y ˜ m ( r ) ( x ) , y ˜ m + ( r ) ( x ) ] .

Then the fuzzy residual function of the problem is expressed by

( c D ( v ) y ˜ m ± ( r ) ) ( x ) = R m ± ( r ) ( x ) y ˜ m ( x ) ± r f ˜ m ( x ) ± r ,

hence,

[ ( c D ( v ) y ˜ m ) ( x ) ] ( r ) = [ ( c D ( v ) y ˜ m ( r ) ) ( x ) , ( c D v y ˜ m + ( r ) ) ( x ) ] = [ R m ( r ) ( x ) , R m + ( r ) ( x ) ] [ y ˜ m ( x ) r , y ˜ m ( x ) + r ] [ f ˜ m ( x ) r , f ˜ m ( x ) + r ] = [ R m ( x ) ] ( r ) [ y ˜ m ( x ) ] ( r ) [ f ˜ m ( x ) ] ( r ) .

□

Regarding to Definition 3 of g-difference, we have

[ R m ( x ) ] ( r ) = [ ( c D ( v ) y ˜ m ) ( x ) ] ( r ) g [ y ˜ m ( x ) ] ( r ) g [ f ˜ m ( x ) ] ( r ) ,

or in the form of fuzzy operator, we can state

[ R m ] ( r ) = ( I g c D ( v ) ) y ( r ) g f ( r ) . (20)

Let , E denotes the fuzzy inner product over X E = L E 2 ( [ 0 , 1 ] ) . It is required like a typical tau method in the crisp concept (see [56,57]) that R m ( r ) satisfy

R m ( r ) ( x ) , P i ( α , β ) ( x ) E = 0 ˜ , i = 0 , 1 , , m 1 , r [ 0 , 1 ] , (21)

where R m ( r ) ( x ) , P i ( α , β ) ( x ) E r = [ ( FR ) 0 1 R m ( x ) ( x ) , P i ( α , β ) ( x ) w α , β ( x ) d x ] ( r ) .

From Eq. (21), we gain ( m ) -fuzzy linear algebraic equations which are as follows in the expanded form:

j = 0 m θ j ( r ) { D ( v ) P j ( α , β ) , P i ( α , β ) P j ( α , β ) , P i ( α , β ) } = j = 0 m f j ( r ) P j ( α , β ) , P i ( α , β ) , (22)

for i = 0 , 1 , , m 1 . Also the fuzzy coefficients f j are defined as

f ( x ) f ˜ m + 1 ( x ) = j = 0 m f j P j ( α , β ) ( x ) = F m + 1 T Φ m + 1 , (23)

where F m + 1 = [ f 0 , f 1 , , f m ] T is acquired as

f i = 1 ν i α , β 0 1 P i ( α , β ) ( x ) f ( x ) w ( α + β ) ( x ) d x , i = 0 , 1 , , m . (24)

Subsequently, replacing Eq. (10) in the initial condition of the problem (19)

y ( 0 ) = j = 0 m θ j ( r ) P j ( α , β ) ( 0 ) = y 0 , (25)

from the above equation with Eq. (22), ( m + 1 ) -fuzzy linear algebraic equations are generated. It is obvious that the unknown fuzzy coefficients are obtained with solving this fuzzy system using the method presented for example in [44].

### 5 Test problems

In this part, different examples are considered to depict the feasibility of the proposed method for solving FFDEs with a suitable accuracy.

Example 1

Consider the following FFDE:

{ ( c D 0 + v y ) ( x ) = λ y ( x ) ( x + 1 ) , 0 < v 1 , y r ( 0 ) = [ y 0 r , y 0 + r ] , 0 < r 1 . (26)

Here, suppose that λ = 1 , then using [ c 2 v ] -differentiability and Theorem 1 we have the following parametric form:

{ ( c D 0 + v y r ) ( x ) = y r ( x ) + x + 1 , 0 < v 1 , y r ( 0 ) = y 0 r , 0 < r 1 , (27)

and

{ ( c D 0 + v y + r ) ( x ; r ) = y + r ( x ) + x + 1 , 0 < α 1 , y + r ( 0 ) = y 0 + r ( r ) , 0 < r 1 , (28)

where y r ( 0 ) = [ 0.5 + 0.5 r , 1.5 0.5 r ] . The analytical solution of the problem (26) can be acquired using Eqs. (27) and (28) as

{ Y ̲ ( x ; r ) = ( 0.5 + 0.5 r ) E v , 1 [ x v ] + 0 x ( x t ) v 1 E v , v [ ( x t ) v ] ( x + 1 ) d t , 0 < v 1 , Y ¯ ( x ; r ) = ( 1.5 0.5 r ) E v , 1 [ x v ] + 0 x ( x t ) v 1 E v , v [ ( x t ) v ] ( x + 1 ) d t , 0 < r 1 . (29)

By applying the technique explained in Section 4, the equation is gained in the matrix form as

{ Θ m + 1 , T [ D ( v ) + I ] Φ ( x ) = F m + 1 , T Φ ( x ) , Θ m + 1 , + T [ D ( v ) + I ] Φ ( x ) = F m + 1 , + T Φ ( x ) , (30)

where the values of vector F T is obtained as Eq. (23). Deriving the fuzzy residual function and multiplying it by P j ( α , β ) ( x ) w α , β , j = 0 , 1 , , m 1 to generate ( m ) -fuzzy algebraic equations

{ Θ m + 1 , T [ D ( v ) + I ] = F m + 1 , T , Θ m + 1 , + T [ D ( v ) + I ] = F m + 1 , + T . (31)

Also for y ( 0 ; r ) = [ y 0 r , y 0 + r ] , one has

{ y r ( 0 ) Θ m + 1 , T Φ m + 1 = ( 0.5 + 0.5 r ) , y + r ( 0 ) Θ m + 1 , + T Φ m + 1 = ( 1.5 0.5 r ) . (32)

Finally, Eqs. (31) and (32) create ( m + 1 ) -fuzzy linear equations to give us the unknown fuzzy coefficients θ j after solving this system.

With m = 2 , α = β = 0.5 and v = 0.75 , we have

D ( 0.75 ) = ( 0 0 0 Δ ( 0.75 ) ( 1 , 0 ) Δ ( 0.75 ) ( 1 , 1 ) Δ ( 0.75 ) ( 1 , 2 ) Δ ( 0.75 ) ( 2 , 0 ) Δ ( 0.75 ) ( 2 , 1 ) Δ ( 0.75 ) ( 2 , 2 ) ) = ( 0 0 0 2.6929 0.5524 0.1755 1.2429 4.2241 1.1048 ) ,

and with the assumption that r -cut = 1 ,

F 3 = ( 1.5 0.25 1 ) .

So, considering these two matrices and substituting them into Eqs. (30) and (32), we can obtain the fuzzy coefficients as

Θ 3 = [ 1.1550 ˜ , 0.1384 ˜ , 0.0281 ˜ ] .

From Table 1, we can obtain a good approximation with the exact solution by making use of the proposed method. In this table, the results are gained at x = 1 . Also, the method is tested with different values of α, β which are depicted in Figure 1. The results is more accurate with α = 0 , β = 0.5 . We may also see from Figure 2, the absolute error is smaller and smaller when m grows. Finally, the approximate fuzzy solution is illustrated in Figure 3 for different values of v that shows this approach can solve FFDEs of different fractional order effectively.

Figure 1. The absolute error for different values ( α , β ) of Example 1, v = 0.85 , m = 7 .

Figure 2. The absolute error for different valuesmof Example 1, v = 0.85 , α = β = 0 .

Figure 3. The fuzzy approximate solution of Example 1, for different fractional ordersv, α = β = 0 , m = 7 .

Table 1. The absolute error of the proposed method for Example 1 with different values ofα,βand m = 5

Example 2 Consider the inhomogeneous linear fractional relaxation equation in [58] in the sense of fuzzy context, so we have

{ D 0 + v c y ( x ) + y ( x ) = x 4 1 2 x 3 3 Γ ( 4 v ) x ( 3 v ) + 24 Γ ( 5 v ) x ( 4 v ) , y r ( 0 ) = [ 1 + r , 1 r ] , 0 < v 1 , 0 x 1 , (33)

in which y ( x ) : L E [ 0 , 1 ] C E [ 0 , 1 ] is a continuous fuzzy function and D 0 + v c indicates the fuzzy Caputo fractional derivative of order v.

Now, utilizing the definition of [ 1 v ] -differentiability and Theorem 1, we have

{ ( c D 0 + v y r ) ( x ) + y r ( x ) = x 4 1 2 x 3 3 Γ ( 4 v ) x ( 3 v ) + 24 Γ ( 5 v ) x ( 4 v ) , y r ( 0 ) = 1 + r , 0 < v 1 , 0 x 1 , (34)

and

{ ( c D 0 + v y + r ) ( x ) + y + r ( x ) = x 4 1 2 x 3 3 Γ ( 4 v ) x ( 3 v ) + 24 Γ ( 5 v ) x ( 4 v ) , y + r ( 0 ) = 1 r , 0 < v 1 , 0 x 1 . (35)

Solving Eqs. (34)-(35) causes to specify the solution of FFDE (33) as follows:

{ y r ( x ) = ( 1 + r ) E v , 1 [ x v ] + 0 x ( x t ) v 1 E v , v [ ( x t ) v ] y r ( x ) = × ( x 4 1 2 x 3 3 Γ ( 4 v ) x ( 3 v ) + 24 Γ ( 5 v ) x ( 4 v ) ) d t , 0 r 1 , y + r ( x ) = ( 1 r ) E v , 1 [ x v ] + 0 x ( x t ) v 1 E v , v [ ( x t ) v ] y + r ( x ) = × ( x 4 1 2 x 3 3 Γ ( 4 v ) x ( 3 v ) + 24 Γ ( 5 v ) x ( 4 v ) ) d t , 0 r 1 .

Now, if we apply the technique explained in Section 4 in Eqs. (34) and (35) with m = 2 and v = 0.85 , then the 3 unknown fuzzy coefficients with the choices of α = 0.5 and β = 0 are as

D ( 0.85 ) = ( 0 0 0 2.2377 0.4433 0.2028 0.9457 4.6250 0.9395 ) ,

so if we consider r -cut = 0 then the approximate fuzzy function is obtained as

{ y 0 ( x ) = 1 + 0.7681 x + 0.9454 x 2 , y + 0 ( x ) = 1 1.5531 x + 1.3842 x 2 .

The absolute error for some various α, β at x = 1 are shown in Table 2 and Figure 4. From Table 2, it can be seen that with the few number of Jacobi polynomials, the approximate solution with high accuracy is achievable. Furthermore, Figure 5 shows that the error with increasing the number of Jacobi terms changes slowly. The approximate fuzzy solution has been derived for v = 0.5 , 0.75 , 0.85 , 0.95 in Figure 6, which shows the feasibility of the proposed method for this kind of problems.

Figure 4. The absolute error for different values ( α , β ) of Example 2, v = 0.75 , m = 5 .

Figure 5. The absolute error for different valuesmof Example 2, v = 0.75 , α = 0.5 , β = 0 .

Figure 6. The fuzzy approximate solution of Example 2, for different fractional ordersv, α = 0.5 , β = 0 , m = 5 .

Table 2. The absolute error of the proposed method for Example 2 with different values ofα,βand m = 7

Remark 7 Figure 2 depicts that the approximate solution has a little bit oscillation when the number of Jacobi functions assumed m = 3 , 4 . Actually, it is related to the oscillatory behavior of fuzzy exact solution. Although the approximate solution using the proposed method has a smooth behavior, it can not respond appropriately to match the exact solution, especially when the r-cuts tend to 1. This has lead to the growing of the absolute error which is not significant. This defect is removed with the increasing of the number of Jacobi functions which is obvious according to Figures 1 and 2.

On the other hand, taking into account Figures 4 and 5. The approximate of lower fuzzy function using JOM method for r -cut = 1 at x = 1 is as follow with m = 5 :

y 1 ( x ) = ( 2.3015 e 16 ) + ( 1.3147 e 13 ) x + ( 1.3644 e 12 ) x 2 0.5 x 3 + x 4 ( 2.04119 e 12 ) x 5 ,

as it can be seen, the approximate solution for lower bound has the negotiable coefficients for x, x 2 , x 5 terms and constant value. Therefore, in this condition, the approximate solution, with initial value y ( 0 ) = 0 , approaches the analytical fuzzy solution rapidly with the increasing the number of Jacobi functions.

Example 3 Let us consider the fractional oscillation equation [59] with fuzzy initial conditions as

{ D 0 + v c y ( x ) + y ( x ) = x e x , y r ( 0 ) = [ 1 + r , 1 r ] , 0 < v 1 , 0 x 1 , (36)

where y ( x ) : L E [ 0 , 1 ] C E [ 0 , 1 ] is a continuous fuzzy set-value function and D 0 + v c points out the fuzzy fractional derivative order of Caputo type.

Again, regarding to the case (i) of Definition 15 and Theorem 1, one can determine the parametric form of (36) as

{ ( c D 0 + v y r ) ( x ) + y r ( x ) = x e x , y r ( 0 ) = 1 + r , 0 < v 1 , 0 x 1 , (37)

and

{ ( c D 0 + v y + r ) ( x ) + y + r ( x ) = x e x , y + r ( 0 ) = 1 r , 0 < v 1 , 0 x 1 , (38)

with the exact solution as

{ y r ( x ) = ( 1 + r ) E v , 1 [ x v ] + 0 x ( x t ) v 1 E v , v [ ( x t ) v ] x e x d t , 0 r 1 , y + r ( x ) = ( 1 r ) E v , 1 [ x v ] + 0 x ( x t ) v 1 E v , v [ ( x t ) v ] x e x d t , 0 r 1 .

With exploiting of the presented method in Section 5, we can obtain following fuzzy equations system:

{ j = 0 m θ j , r [ Δ v ( i , j ) + I ] P j ( α , β ) ( x ) = j = 0 m f j , r P j ( α , β ) ( x ) , j = 0 m θ j , + r [ Δ v ( i , j ) + I ] P j ( α , β ) ( x ) = j = 0 m f j , + r P j ( α , β ) ( x ) ,

then multiplying this system by P i ( α , β ) ( x ) for i = 0 , 1 , , m 1 using the fuzzy inner product and orthogonal property explained in Section 5, give us ( m ) -fuzzy linear algebraic equations:

j = 0 m 1 θ j ( r ) { ( FR ) 0 1 D ( v ) P