Introduction

In recent years differential equations with fractional order have attracted many researchers’ attention because of their applications in many areas of science and engineering; see, for example, [1, 2], and [3]. The need for fractional-order differential equations stems in part from the fact that many phenomena cannot be modeled by differential equations with integer derivatives. The fractional calculus has allowed the operations of integration and differentiation to be applied upon any fractional order. Recently, the theory of fractional differential equations attracted many scientists and mathematicians to work on [48]. For stability conditions and synchronization of a system of fractional-order differential equations, one can see [911].

We recall the basic definitions (Caputo) and properties of fractional order differentiation and integration.

Definition 1 The fractional integral of order β R + of the function f(t), t>0, is defined by

I β f(t)= 0 t ( t s ) β 1 Γ ( β ) f(s)ds,

and the fractional derivative of order α(n1,n) of f(t), t>0, is defined by

D α f(t)= I n α D n f(t),D= d d t .

In addition, the following results are the main ones in fractional calculus. Let β,γ R + , α(0,1),

  • I a β : L 1 L 1 , and if f(x) L 1 , then I a γ I a β f(x)= I a γ + β f(x).

  • lim β n I a β f(x)= I a n f(x) uniformly on [a,b], n=1,2,3, , where I a 1 f(x)= a x f(s)ds.

  • lim β 0 I a β f(x)=f(x) weakly.

  • If f(x) is absolutely continuous on [a,b], then lim α 1 D a α f(x)= d f ( x ) d x .

To solve fractional-order differential equations, there are two famous methods: frequency domain methods [12] and time domain methods [13]. In recent years it has been shown that the second method is more effective because the first method is not always reliable in detecting chaos [14] and [15].

Often it is not desirable to solve a differential equation analytically, and one turns to numerical or computational methods.

In [16], a numerical method for nonlinear fractional-order differential equations with constant or time-varying delay was devised. It should be noticed that the fractional differential equations tend to lower the dimensionality of the differential equations in question; however, introducing delay in differential equations makes them infinite dimensional. So, even a single ordinary differential equation with delay could display chaos.

Dealing with fractional-order differential equations as dynamical systems is somehow new and has motivated the leading research literature recently; see, for example, [17, 18] and [19]. The non-local property of fractional differential equations means that the next state of a system not only depends on its current state but also on its historical states. This property is very close to the real world, and thus fractional differential equations have become popular and have been applied to dynamical systems.

On the other hand, some examples of dynamical systems generated by piecewise constant arguments were studied in [2024].

Discretization process

In [25], a discretization process is introduced to discretize the fractional-order differential equations, and we take Riccati’s fractional-order differential equations as an example. We noticed that when the fractional-order parameter α1, Euler’s discretization method is obtained. In [26], the same discretization method is applied to the logistic fractional-order differential equation. We concluded that Euler’s method is able to discretize first-order difference equations; however, we succeeded in discretizing a second-order difference equation.

Here, we are interested in applying the discretization method to a system of differential equations like Chua’s system which is one of the autonomous differential equations capable of generating chaotic behavior. This system is well known and has been studied widely.

Let α(0,1) and consider the differential equation of fractional order

D α x ( t ) = f ( x ( t ) ) , t > 0 . x ( 0 ) = x 0 , t 0 .
(1)

The corresponding equation with a piecewise constant argument

D α x(t)=f ( x ( r [ t r ] ) ) ,x(t)= x 0 ,t0.
(2)

Let t[0,r), then t r [0,1). So, we get

D α x(t)=f( x 0 ),t[0,r).

Thus

x 1 (t)= x 0 + t α Γ ( 1 + α ) f( x 0 ).

Let t[r,2r), then t r [1,2). So, we get

D α x(t)=f ( x 1 ( r ) ) ,t[r,2r).

Thus

x 2 (t)= x 1 (r)+ ( t r ) α Γ ( 1 + α ) f ( x 1 ( r ) ) .

Let t[2r,3r), then t r [2,3). So, we get

D α x(t)=f ( x 2 ( r ) ) ,t[2r,3r).

Thus

x 3 (t)= x 1 (r)+ ( t 2 r ) α Γ ( 1 + α ) f ( x 2 ( r ) ) .

Repeating the process, we get when t[nr,(n+1)r), then t r [n,n+1). So, we get

D α x(t)=f ( x n ( n r ) ) ,t[nr,(n+1)r).

Thus

x n + 1 (t)= x n (r)+ ( t n r ) α Γ ( 1 + α ) f ( x n ( r ) ) .

Consider Chua’s dynamical system with cubic nonlinearity (see [27, 28])

x . = γ ( y + 1 7 x 2 7 x 3 ) , y . = x y + z , z . = β y .
(3)

In [28], the author studied the effect of the fractional dynamics in Chua’s system. It has been demonstrated that the usual idea of system order must be modified when fractional derivatives are present.

Here, we are concerned with fractional-order Chua’s system given by

D α x(t)=γ ( y + 1 7 x 2 7 x 3 ) ,
(4)
D α y(t)=xy+z,
(5)
D α z(t)=βy.
(6)

Actually, we are interested in discretizing fractional-order Chua’s system with piecewise constant arguments given in the form

D α x ( t ) = γ ( y ( r [ t r ] ) + 1 7 x ( r [ t r ] ) 2 7 x ( r [ t r ] ) 3 ) , D α y ( t ) = x ( r [ t r ] ) y ( r [ t r ] ) + z ( r [ t r ] ) , D α z ( t ) = β y ( r [ t r ] ) ,
(7)

with initial conditions x(0)= x o , y(0)= y o , and z(0)= z o .

The proposed discretization method has the following steps.

(1) Let t[0,r), then t r [0,1). So, we get

D α x ( t ) = γ ( y 0 + 1 7 x 0 2 7 x 0 3 ) , t [ 0 , r ) , D α y ( t ) = x 0 y 0 + z 0 , D α y ( t ) = β y 0 ,

and the solution of (7) is given by

x 1 ( t ) = x 0 + I α ( γ ( y 0 + 1 7 x 0 2 7 x 0 3 ) ) x 1 ( t ) = x 0 + ( γ ( y 0 + 1 7 x 0 2 7 x 0 3 ) ) 0 t ( t s ) α 1 Γ ( α ) d s x 1 ( t ) = x 0 + ( γ ( y 0 + 1 7 x 0 2 7 x 0 3 ) ) t α Γ ( 1 + α ) , y 1 ( t ) = y 0 + I α ( x 0 y 0 + z 0 ) y 1 ( t ) = y 0 + ( x 0 y 0 + z 0 ) 0 t ( t s ) α 1 Γ ( α ) d s y 1 ( t ) = y 0 + ( x 0 y 0 + z 0 ) t α Γ ( 1 + α ) , z 1 ( t ) = z 0 + I α ( β y 0 ) z 1 ( t ) = z 0 + ( β y 0 ) 0 t ( t s ) α 1 Γ ( α ) d s z 1 ( t ) = z 0 + ( β y 0 ) t α Γ ( 1 + α ) .

(2) Let t[r,2r), then t r [1,2). So, we get

D α x ( t ) = γ ( y 1 ( r ) + 1 7 x 1 ( r ) 2 7 x 1 ( r ) 3 ) , t [ r , 2 r ) , D α y ( t ) = x 1 ( r ) y 1 ( r ) + z 1 ( r ) , D α y ( t ) = β y 1 ( r ) ,

and the solution of (7) is given by

x 2 ( t ) = x 1 ( r ) + I α ( γ ( y 1 ( r ) + 1 7 x 1 ( r ) 2 7 x 1 ( r ) 3 ) ) x 2 ( t ) = x 1 ( r ) + ( γ ( y 1 ( r ) + 1 7 x 1 ( r ) 2 7 x 1 ( r ) 3 ) ) 0 t ( t s ) α 1 Γ ( α ) d s x 2 ( t ) = x 1 ( r ) + ( γ ( y 1 ( r ) + 1 7 x 1 ( r ) 2 7 x 1 ( r ) 3 ) ) t α Γ ( 1 + α ) , y 2 ( t ) = y 1 ( r ) + I α ( x 1 ( r ) y 1 ( r ) + z 1 ( r ) ) y 2 ( t ) = y 1 ( r ) + ( x 1 ( r ) y 1 ( r ) + z 1 ( r ) ) 0 t ( t s ) α 1 Γ ( α ) d s y 2 ( t ) = y 1 ( r ) + ( x 1 ( r ) y 1 ( r ) + z 1 ( r ) ) t α Γ ( 1 + α ) , z 2 ( t ) = z 1 ( r ) + I α ( β y 1 ( r ) ) z 2 ( t ) = z 1 ( r ) + ( β y 1 ( r ) ) 0 t ( t s ) α 1 Γ ( α ) d s z 2 ( t ) = z 1 ( r ) + ( β y 1 ( r ) ) t α Γ ( 1 + α ) .

Repeating the process, we can easily deduce that the solution of (7) is given by

x n + 1 ( t ) = x n ( n r ) + ( t n r ) α Γ ( 1 + α ) ( γ ( y n ( n r ) + 1 7 x n ( n r ) 2 7 x n ( n r ) 3 ) ) , t [ n r , ( n + 1 ) r ) , y n + 1 ( t ) = y n ( n r ) + ( t n r ) α Γ ( 1 + α ) ( x n ( n r ) y n ( n r ) + z n ( n r ) ) , z n + 1 ( t ) = z n ( n r ) + ( t n r ) α Γ ( 1 + α ) ( β y n ( n r ) ) .

Let t(n+1)r, we obtain the discretization

x n + 1 ( ( n + 1 ) r ) = x n ( n r ) + r α Γ ( 1 + α ) ( γ ( y n ( n r ) + 1 7 x n ( n r ) 2 7 x n ( n r ) 3 ) ) , y n + 1 ( ( n + 1 ) r ) = y n ( n r ) + r α Γ ( 1 + α ) ( x n ( n r ) y n ( n r ) + z n ( n r ) ) , z n + 1 ( ( n + 1 ) r ) = z n ( n r ) + r α Γ ( 1 + α ) ( β y n ( n r ) ) ,

which can be rewritten as

x n + 1 = x n + r α Γ ( 1 + α ) ( γ ( y n + 1 7 x n 2 7 x n 3 ) ) , y n + 1 = y n + r α Γ ( 1 + α ) ( x n y n + z n ) , z n + 1 = z n + r α Γ ( 1 + α ) ( β y n ) .
(8)

Remark 1 It should be noticed that if α1 in (8), we deduce the Euler discretization method of Chua’s system [29].

It is worth to mention here that many discretization methods, such as Euler’s method and predictor-corrector method, have been applied to Chua’s system (4). Euler’s method discretization is an approximation for the derivative while the predictor-corrector method is an approximation for the integral. However, our proposed discretization method here is an approximation for the right-hand side as it is pretty clear from formula (8).

Fixed points and their asymptotic stability

Now we study the asymptotic stability of the fixed points of system (8) which has three fixed points:

  • fi x 1 =(0,0,0),

  • fi x 2 =( 1 2 ,0, 1 2 ),

  • fi x 3 =( 1 2 ,0, 1 2 ).

By considering a Jacobian matrix for one of these fixed points and calculating their eigenvalues, we can investigate the stability of each fixed point based on the roots of the system characteristic equation [30].

Linearizing system (8) about fi x 1 yields the following characteristic equation:

P ( λ ) = λ 3 + ( s ( 1 1 7 γ ) 3 ) λ 2 + ( 3 2 s ( 1 1 7 γ ) s 2 ( β + 8 7 γ ) ) λ + ( 1 + s ( 1 1 7 γ ) + s 2 ( β + 8 7 γ ) + 1 7 β γ s 3 ) = 0 ,
(9)

where s= r α Γ ( 1 + α ) . Let

a 1 = s ( 1 1 7 γ ) 3 , a 2 = 3 2 s ( 1 1 7 γ ) s 2 ( β + 8 7 γ ) , a 3 = 1 + s ( 1 1 7 γ ) + s 2 ( β + 8 7 γ ) + 1 7 β γ s 3 .

Now, let a 1 =A, a 2 =B, and a 3 =C. From the Jury test, if P(1)>0, P(1)<0, and a 3 <1, | b 3 |> b 1 , c 3 >| c 2 |, where b 3 =1 a 3 2 , b 2 = a 1 a 3 a 2 , b 1 = a 2 a 3 a 1 , c 3 = b 3 2 b 1 2 , and c 2 = b 3 b 2 b 1 b 2 , then the roots of P(λ) satisfy λ<1 and thus fi x 1 is asymptotically stable. This is not satisfied here since γ and β are positive and so | b 3 |< b 1 . That is, fi x 1 is unstable.

While linearizing system (8) about fi x 2 or fi x 3 yields the following characteristic equation:

F ( λ ) = λ 3 + ( s ( 1 + 2 7 γ ) 3 ) λ 2 + ( 3 s ( 2 + 4 7 γ ) s 2 ( β + γ 2 7 γ ) ) λ + ( 1 + s ( 1 + 2 7 γ ) + s 2 ( β + γ 2 7 γ ) 2 7 γ β s 3 ) = 0 .
(10)

We let a 11 =s(1+ 2 7 γ)3, a 22 =3s(2+ 4 7 γ) s 2 (β+γ 2 7 γ), and a 33 =1+s(1+ 2 7 γ)+ s 2 (β+γ 2 7 γ) 2 7 γβ s 3 . From the Jury test, if F(1)>0, F(1)<0, and a 33 <1, | b 33 |> b 11 , c 33 >| c 22 |, where b 33 =1 a 33 2 , b 22 = a 11 a 33 a 22 , b 11 = a 22 a 33 a 11 , c 33 = b 33 2 b 11 2 , and c 22 = b 33 b 22 b 11 b 22 , then the roots of F(λ) satisfy λ<1 and thus fi x 2 or fi x 3 is asymptotically stable. We can check easily that F(1)<0, that is, both fi x 2 and fi x 3 are unstable.

Attractors, bifurcation and chaos

Since the Lyapunov exponent is a good indicator for existence of chaos, we compute the Lyapunov characteristic exponents (LCEs) via the householder QR based methods described in [31]. LCEs play a key role in the study of nonlinear dynamical systems and they are the measure of sensitivity of solutions of a given dynamical system to small changes in the initial conditions. One feature of chaos is the sensitive dependence on initial conditions; for a chaotic dynamical system, at least one LCE must be positive. Since for non-chaotic systems all LCEs are non-positive, the presence of a positive LCE has often been used to help determine if a system is chaotic or not. We find that LCE1 = 0.0263, LCE2 = −0.0077, and LCE3 = −0.4160. Figure 1 shows the LCEs for system (8) for parameter values r=0.0105, β= 100 7 , and α=0.75 with initial conditions ( x 0 , y 0 , z 0 )=(0.2,0.4,0.2).

Figure 1
figure 1

Lyapunov characteristic exponents (LCEs) for system ( 8 ).

On the other hand, we show some attractors of system (8) for different α. The numerical experiments show that playing with the parameter α away from α=0.75 will not produce any bifurcation diagrams. Figures 2 and 3 show attractors of system (8), while Figures 4-13 show bifurcation diagrams for the same system.

Figure 2
figure 2

Strange attractor of ( 8 ) with α=0.75 , β=16 , r=0.01 , γ=29.5 .

Figure 3
figure 3

Attractor of ( 8 ) with α=0.85 , β=16 , r=0.01 , γ=29.5 .

Figure 4
figure 4

Bifurcation diagram of ( 8 ) with α=0.75 , β=16 , r=0.01 .

Figure 5
figure 5

Bifurcation diagram of ( 8 ) with α=0.75 , β=16 , r=0.01 .

Figure 6
figure 6

Bifurcation diagram of ( 8 ) with α=0.75 , β= 100 7 , r=0.0105 .

Figure 7
figure 7

Bifurcation diagram of ( 8 ) with α=0.75 , β=16 , r=0.01 .

Figure 8
figure 8

Bifurcation diagram of ( 8 ) with α=0.85 , β=16 , r=0.01 .

Figure 9
figure 9

Bifurcation diagram of ( 8 ) with α=0.95 , β=16 , r=0.01 .

Figure 10
figure 10

Bifurcation diagram of ( 8 ) with α=1 , β=16 , r=0.01 .

Figure 11
figure 11

Bifurcation diagram of ( 8 ) with α=1 , β=16 , r=0.01 .

Figure 12
figure 12

Bifurcation diagram of ( 8 ) with α=1 , β=16 , r=0.01 .

Figure 13
figure 13

Bifurcation diagram of ( 8 ) with α=0.1 , β=16 , r=0.01 .

Conclusion

A discretization method is introduced to discretize fractional-order differential equations and we take Chua’s system with cubic nonlinearity for our purpose. We have noticed that when α1, the discretization will be Euler’s discretization [29]. In addition, we carried out the numerical simulation when α1, we did not get any bifurcation at all. Actually, this is not surprising since we did the same in Rössler’s system in its discrete version. When we contacted Prof. Dr. Rössler himself about why we were not getting any bifurcation diagrams, he assured our results. Finally, it is not clear in this situation why the parameter α takes one value only to produce bifurcation and chaos diagrams.

On the other hand, we show some attractors of system (8) for different α. The numerical experiments show that playing with the parameter α away from α=0.75 will not produce any bifurcation diagrams.