Abstract
The analysis of finite-time stability for a class of fractional-order complex valued neural networks with delays is considered in this paper. Utilizing Gronwall inequality, Cauchy-Schiwartz inequality and inequality scaling techniques, some sufficient conditions for guaranteeing the finite-time stability of the system are derived respectively under two cases with order \(1/2\le \alpha < 1\) and \(0<\alpha <1/2\), in which different inequality scaling strategies are employed. Two numerical examples are also proposed to demonstrate the validity and feasibility of the obtained results.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
Fractional-order calculus, that is, the theory of derivatives and integrals of non-integer order, is firstly considered by Leibniz in 1695 [1]. Then it is applied and theoretical studied by Abel, Liouville, and other mathematicians since the first half of the nineteenth century. Unlike the classical integer derivative operator, fractional derivative operator is non-local in nature, which means that the future state relies on the present state as well as all the history of its previous states. From this point of view, fractional-order models can provide a powerful tool to delicately depict the memory and hereditary properties of various materials and processes and are thus receiving extensive applications in a variety of field such as medical imaging, electronic circuit, system control, economics, biology and so on [2,3,4,5,6]. In [7], Arena et al. firstly introduce fractional-order derivatives into a cellular neural networks. Subsequently the fractional-order neural networks were proposed and designed for more precisely modelling the real world owing to its high effective information processing and the independent transformation of the oscillation frequency of neurons [8]. Recently, some important and interesting results on fractional-order neural networks have been obtained and various issues have been investigated by many authors, such as the chaotic behavior [9], stability [10], bifurcations [11, 12] and limit cycles [13] for fractional-order neural networks.
Due to the development and further application of neural networks, the complex-valued neural networks (CVNNs), namely the input/output signals, connection weights, and activation functions are all taken from the complex field, come into being and have attracted much interest among researchers and practitioners [14,15,16]. CVNNs have advantaged superiority in simpler network structure, shorter training time and more powerful learning ability during complex signal processing compared to real valued neural networks (RVNNs). For instance, both the well-known Exclusive-OR (XOR) problem and the detection of symmetry problem can be realized by only a single complex-valued neuron with the orthogonal decision boundaries, whereas neither of them could be accomplished by RVNNs with such a simple network structure [17]. Furthermore, in RVNNs, we usually employ bounded and smooth functions as activation function such as the Sigmoid type functions, however, activation functions with such properties in CVNNs are impermissible, since on the basis of Liouvilles theorem [18], the function which is both bounded and analytic over complex number field must be a constant. As a result, choosing appropriate activation function is an important and difficult task for CVNNs. According to the above discussion, despite being an extension of RVNNs, CVNNs are very different and more complicated compared to RVNNs. Hence, it is necessary to analyze the dynamic behavior of CVNNs, and considerable efforts have been devoted to study the stability and synchronization of CVNNs [19,20,21,22]. However, there is a little literature to consider the dynamic behavior of fractional-order CVNNs. Until recently, the stability and uniformly stability of this networks are investigated in [23, 24], and the synchronization of a class of fractional-order CVNNs is discussed in [15].
As we all know, stability is one of the most concerned problems for any dynamic system. It is worth noting that most of the existing results focus on the stability of system in the sense of Lyapunov, including asymptotic stability, uniform stability and exponential stability, etc, which are all recognized as infinite-time behavior of such systems. Nevertheless, in some practical situations we may be more interested in the finite-time stability, which sustains the trajectories do not exceed a certain threshold during a fixed short time under a given bound on the initial conditions, since most actual networks only act over finite time. The initial concept of finite-time stability is given in [25] for a class of integer order differential system, and then has been extensively studied [26,27,28,29,30]. Very recently, finite-time stability of fractional order systems are considered and lots of useful results about finite-time stability of fractional-order neural networks are put forward [31,32,33,34], while, up to now, the results on finite-time stability of fractional-order CVNNs are not considered in the existing literatures.
Motivated by the above discussion, the target of this paper is to establish the finite-time stability criterion for fractional-order CVNNs with time delays. By means of Gronwall inequality, Cauchy-Schiwartz inequality and inequality scaling techniques, some sufficient conditions are given to admit the finite-time stability of the system. The reminder of the paper is organized as follows. In Sect. 2, some definitions about fractional calculus and necessary lemmas are recalled, as well as the model of network are described; Then, two sufficient conditions admitting the finite-time stability of fractional-order CVNNs respectively with order \(0<\alpha <1/2\) and \(1/2\le \alpha <1\) are proposed in Sect. 3; The effectiveness of the theoretical results is shown by two numerical simulation examples in Sects. 4 and 5 is the conclusion of this paper.
Notations
Throughout the paper, \({\mathbb {R}}^{n}\) denotes the n dimensional real space. \({\mathbb {R}}^{n\times m}\) is a set of \(n\times m\) real matrices. The superscript “T” represents the transpose. \({\mathbb {C}}, {\mathbb {C}}^n, {\mathbb {C}}^{n\times m}\) respectively denote the set of all complex number, the set of all n-dimensional complex-valued vectors and the set of all \(n\times m\) complex-valued matrices. \(\mathrm {i}\) shows the imaginary unit, i.e. \(\mathrm {i}=\sqrt{-1}\). For any complex number \(z=x+\mathrm {i}y\in {\mathbb {C}}\), the notation |z| stands for the module of z, namely \(|z|=\sqrt{x^2+y^2}\). Given vector \(z \in {\mathbb {C}}^n\), \(\Vert z\Vert \) denotes the 2-norm of z, i.e. \(\Vert z\Vert =(\sum _{j=1}^n |z_j|^2)^{\frac{1}{2}}\). \(C^n(M, N)\) denotes the space consisting of n-order continuous differentiable functions from M into N, and \(C(M)\triangleq C^0(M, {\mathbb {R}})\). For function \(\phi (t): [t_0-\tau , \tau ]\rightarrow {\mathbb {C}}^n\), define the norm \(\Vert \phi \Vert _C=\sup _{s\in [t_0-\tau , t_0]}\Vert \phi (s)\Vert \).
2 Preliminaries
In this section, some basic definitions and results relating to fractional calculus are firstly recalled.
2.1 Fractional Calculus and Preliminary Lemmas
Definition 2.1
[35] The fractional integral with non-integer order \(\alpha >0\) of function f(x) is defined as follows:
where \(\Gamma (\cdot )\) is the Gamma function \(\Gamma (\alpha )=\int _0^\infty t^{\alpha -1}e^{-t}\,\mathrm {d}t\).
Currently there exist several definitions referring to the fractional derivative of order \(\alpha >0\), including the Grünwald–Letnikov (GL) definition, the Riemann–Liouville (RL) definition and the Caputo definition [35]. Among these definitions, the Caputo derivative has the unique advantage in that it only claims initial conditions provided as the integer-order derivative of \(f(\cdot )\) and the function itself, which is conducive to express some well-understood features of physical situations, making it more applicable to the real world. Therefore, our consideration in this paper is the fractional-order neural networks with Caputo derivative, whose definition is given below.
Definition 2.2
[35] The Caputo derivative of fractional order \(\alpha \) of function f(x) is defined as follows:
where \(n-1<\alpha <n\in \mathbb {Z}^+\).
For simplicity \(D^{-\alpha }_{0,t}\) and \({}^C_{_0}D^{\alpha }_{t}\) are respectively rewritten by \(D^{-\alpha }\) and \(D^{\alpha }\), and some properties on these two operator are introduced.
Lemma 2.1
[36] If \(f(t)\in \mathrm {C}^n[0,\,\infty )\), and \(n-1<\alpha <n\in \mathbb {Z}^+\), then
-
(1)
\(D^{-\alpha }D^{-\beta }f(t)=D^{-(\alpha +\beta )}f(t),\quad \alpha ,\beta >0\);
-
(2)
\(D^{\alpha }D^{-\alpha }f(t)=f(t),\quad \alpha \ge 0\);
-
(3)
\(D^{-\alpha }D^{\alpha }f(t)=f(t)-\sum _{j=0}^{n-1}( t^j/j\,!)f^{(j)}(0),\quad \alpha \ge 0\).
Now some well-known inequalities will be introduced for the proofs of main results in this paper.
Lemma 2.2
(H\(\ddot{\mathrm {o}}\)lder inequality [37]) Assume that \(q,p>1\), and \(\frac{1}{p}+\frac{1}{q}=1\), if \(|f(\cdot )|^p,|g(\cdot )|^q\in L^1(\Omega )\), then \(f(\cdot )g(\cdot )\in L^1(\Omega )\) and
where \(L^1(\Omega )\) is the Banach space of all Lebesgue measurable functions \(f:\Omega \rightarrow {\mathbb {R}}\) with \(\int _{\Omega }|f(x)|\mathrm {d}x<\infty \).
Especially, let \(p,q=2\), it reduces to the Cauchy-Schwartz inequality:
Lemma 2.3
[38] Let \(n\in \mathbb {N},\,\,\omega >1\), and \(x_i\in \mathbb {R^+}, i=1,\ldots n\), then
Lemma 2.4
(Gronwall inequality [39]) If
where all the functions involved are continuous on \([t_0,\,T), T\le \infty \), and \(k(t)\ge 0\), then x(t) satisfies
If, in addition, h(t) is nondecreasing, then
2.2 Model Description
In this paper, we consider the following fractional-order CVNNs with time delays:
where \(j=1,2,\ldots ,n\), or in the vector form
where \(0<\alpha <1\), n is the number of neurons, \(z(t)=(z_1(t),z_2(t),\ldots , z_n(t))^T\in {\mathbb {C}}^n\) is the state vector, \(F(z(t))=(f_1(z_1(t)),\ldots , f_n(z_n(t)))^T\), \(G(z(t))=(g_1(z_1(t)),\ldots ,g_n(z_n(t)))^T\), and \(f_j(\cdot ),g_j(\cdot ):{\mathbb {C}}^n\rightarrow {\mathbb {C}}\) denote the activation functions of the jth neuron without and with time delays; \(A=(a_{jk})_{n\times n}, B=(b_{jk})_{n\times n}\in {\mathbb {C}}^{n\times n}\) are, respectively, the connection weight matrix without and with time delays; \(C=diag\{c_1, c_2, \ldots ,c_n\}\in {\mathbb {R}}^{n\times n}\) with \(c_j>0\) is the self-feedback connection weight matrix, \(U=(U_1,U_2,\ldots ,U_n)^T\in {\mathbb {C}}^n\) is the external input vector; \(t_0\) is the initial time for observation of the system, \(\phi (t)=(\phi _1(t),\tau _2(t),\ldots ,\phi _n(t))^T\in C([t_0-\tau , t_0], {\mathbb {C}}^n)\) is the initial function.
Definition 2.3
[28] Set a time \(T>0\), given positive numbers \(\delta ,\epsilon \) with \(\delta <\epsilon \), a solution \(z(t,t_0, \phi )\) of system (5) is said to be finite-time stable with respect to \((t_0, J, \delta , \epsilon )\), if for any solution \(z'(t,t_0, \phi ')\) of (5), \(\Vert \phi '-\phi \Vert _C<\delta \) implies \(\Vert z'(t,t_0,\phi ')-z(t,t_0, \phi )\Vert <\epsilon , \, \forall t\in J=[t_0, t_0+T]\), where \(\phi (t), \phi '(t)\) for \(t\in [t_0-\tau , t_0]\) is initial functions.
System (5) is said to be finite-time stable with respect to \((t_0, J, \delta ,\epsilon )\) if any solution z(t) of (5) is finite-time stability with respect to \((t_0, J, \delta , \epsilon ).\)
Remark 2.1
The finite-time stability, also called short-time stability, is initial introduced in [25]. Inspired by LaSalle and Lefschet’s “brief discussion” on practical stability in [40], the stability defined constant set trajectory bounds over finite time interval is proposed by Weiss and Infante [25] for continuous-time systems, and further development on such theory is explored by Lam and Weiss in [41]. Then, a more vivid concept called “practical stability with settling time” is in consideration in [42, 43] by Grujić. Essentially, these definitions all consist of maintaining the system response within a certain threshold over a short time interval, based on the preset range of initial value change, which is as described by Definition 2.3.
Remark 2.2
It should be pointed out that the finite-time stability and the stability in the sense of Lyapunov are different concepts, because Lyapunov stability or asymptotic stability does not contain finite-time stability, and vise versa [28]. Besides, the finite-time stability considered here is also quite different from the fixed-time stability or finite-time stability in [44] and [45] , which requires the trajectory of system both finite-time attractive and Lyapunov stable, noting that the latter is a special case of Lyapunov stability. Sometimes a system can be stable or asymptotically stable but yet no use at all due to its undesirable transient performances. Consequently, it may be helpful to study its stability within a certain subset of the state space which are defined a priori over a finite time interval. That is the prime task of this paper.
To facilitate in establishing our main results, the following assumptions are utilized.
Assumption 1
Let \(z=x+\mathrm {i}y\), F(z(t)) and \(G(z(t-\tau ))\) are analytic and can be expressed by separating their real and imaginary parts as
where \(F^k(x,y)=(f^k_1(x_1,y_1),\ldots ,f^k_n(x_n,y_n))^T\), \(G^k(x,y)=(g^k_1(x_1,y_1),\ldots ,g^k_n(x_n,y_n))^T\), and \(f^k_j(x,y)\), \(g^k_j(x,y):{\mathbb {R}}^2\rightarrow {\mathbb {R}}\) are real differentiable, \(j=1,2,\ldots ,n;\,k=R,I.\)
Similarly, the complex matrices A and B can be separated by \(A=A^R+\mathrm {i}A^I\), \(B=B^R+\mathrm {i}B^I\), and let \(\bar{A}=\Vert A^R\Vert , \tilde{A}=\Vert A^I\Vert , \bar{B}=\Vert B^R\Vert , \tilde{B}=\Vert B^I\Vert \).
Assumption 2
\(f^k_j(\cdot ,\cdot ), g^k_j(\cdot ,\cdot )\,(k=R,I;j=1,2,\ldots ,n)\) satisfy the Lipschitz conditions in \({\mathbb {R}}^2\), that is, for any \((u, v), (u',v')\in {\mathbb {R}}^2\), there exist positive constants \(F^k_j,G^k_j\), such that
Remark 2.3
Noting that for any \(z, z' \in {\mathbb {C}}^n\), let \(z=x+\mathrm {i}y, z'=x'+\mathrm {i}y'\), then \((x,y), (x',y')\in {\mathbb {R}}^{\,n\times 2}\), and we have
Letting \(\bar{F}=\max \nolimits _{1\le j\le n}\{F^R_j\}\) and using Assumption 2, one can easily obtain
Similarly, it could be derived
where \(\tilde{F}=\max \nolimits _{1\le j\le n}\{F^I_j\},\, \bar{G}=\max \nolimits _{1\le j\le n}\{G^R_j\}, \,\) and \(\tilde{G}=\max \nolimits _{1\le j\le n} \{G^I_j\}\).
For convenience, we set \(t_0=0\) throughout this paper and then our initial interval is \([-\tau , 0].\) Assuming that z(t) and \(z'(t)\) are two solution of (5) with different initial functions \(\phi (t)\) and \(\phi '(t)\) for \(t\in [-\tau ,0]\), let \(e(t)=z'(t)-z(t),\, \theta (t)=\phi '(t)-\phi (t)\), one has the error system
From Definition 2.3, the finite-time stability for system (5) is equivalent to the finite time stability of trivial solution for the error system (9). Thus we just consider system (9) hereafter.
3 Main Results
In this section, we derive the sufficient conditions for finite-time stability of a class of fractional-order complex-valued neural networks with time delays, which are discussed into two cases: \(\frac{1}{2}\le \alpha <1\) and \(0<\alpha <\frac{1}{2}\). For simplification, the following notations are employed:
Then from (12), \(e(t)=\bar{e}(t)+\mathrm {i}\tilde{e}(t)\), and by means of (10), (11) and (9), we have
Theorem 3.1
When \(\frac{1}{2}\le \alpha <1\), if Assumptions 1 and 2 holds and
for all \(t\in J=[0,T]\), then system (9) is finite time stable with respect to \([t_0, J, \delta , \epsilon ]\), where
Proof
Based on Lemma 2.1, the system (13) can be expressed by
From Assumption 2 and Eqs. (6)–(8), it yields
By using the Cauchy-Schwartz inequality (2), one has
Similarly, we have
Noting that the expression of Gama function \(\Gamma (\alpha )=\int _0^{\infty }t^{\alpha -1}e^{-t}\mathrm {d}t\), we obtain
Substituting (18)–(21) into (17), it could be derived
From Lemma 2.3, and let \(n=4\), \(\omega =2\), it follows from (22) that
From the initial condition of system (9), we can get
Thus (23) can be written by
Applying the similar techniques, we can obtain the estimation of imaginary part for the solution of system (9) as follow
Note that \(\Vert e(s)\Vert ^2=\Vert \bar{e}(s)\Vert ^2+\Vert \tilde{e}(s)\Vert ^2\), for \(s\in [0,t]\), the combination of (25) and (26) induces
which is equivalent to
where M, N is the form of (16). From the Gronwall inequality (3), one has
Thus
It follows that when \(\Vert \theta \Vert _C<\delta \) and if (15) is satisfied for all \(t\in J\), then \(\Vert e(t)\Vert <\epsilon \), from Definition 2.3, system (5) is finite-time stable with respect to \((t_0, J, \delta , \epsilon )\).
Theorem 3.2
When \(0<\alpha <1/2\), if assumption 1 and 2 are satisfied, and
for all \(t\in J=[0,T]\), then system (5) is finite time stable with respect to \((t_0, J, \delta , \epsilon )\), where \(p=1+\alpha , q=1+1/\alpha \), and
Proof
As the same in Theorem 3.1, we have the following estimation for the real part of solution of system (9).
As \(p=1+\alpha , q=1+1/\alpha \), obviously \(p, q>1\) and \(1/p+1/q=1\). By using the Hölder inequality (1), one has
Similarly, we have
Noting that the expression of function \(\Gamma (\cdot )\), we derive
Substituting (32)–(35) into (31), one obtains
From Lemma 2.3, and let \(n=4\), \(\omega =q\), it follows from (36) that
From the initial condition of system (9), we can get
Thus (37) can be estimated by
Applying the similar strategies, we can obtain
Since \(0<\alpha <1/2\), \(q/2=(1+1/\alpha )/2>3/2\), then applying Lemma 2.3, and let \(n=2\), \(\omega =q/2\), it follows from (39) and (38) that
Noting that \(a^{\omega }+b^{\omega }\le (a+b)^{\omega }\), for \(a,b>0\) and \(\omega >1\), hence
Applying (42) to (41), and multiplying by \(e^{-qt}\) on both sides of (41), we have
where \(\tilde{M}, \tilde{N}\) is the form of (30). From the Gronwall inequality (3), one has
which is equivalent to
It follows that when \(\Vert \theta \Vert _C<\delta \) and if (29) is satisfied, then \(\Vert e(t)\Vert <\epsilon \) for all \(t\in J\), from Definition 2.3, system (5) is finite-time stable with respect to \((t_0, J, \delta , \epsilon )\).
Remark 3.1
Reference [24] investigated the uniform stability of system (4), but the conditions are so tedious and complicate that it is hard to meet in reality. References [33, 34] considered the finite-time stability only for linear time invariant RVNNs. References [31, 32] proposed some criterions for the finite-time stability of nonlinear fractional-order neural networks, just confined to real number field. Here, a popular fractional-order nonlinear delayed CVNNs are discussed. It is worth mentioning that if the parameters, states, and activation functions in system (5) are all specially selected from real number field, resulting a fractional-order real-valued system, our results are still valid. As long as set the parameters associated with the imaginary parts in Theorem 1 and Theorem 2 as zero, we can get conclusions similar to [32], which means, to some extent, our results include those of [32].
Remark 3.2
In practice, the selection for the setting time T largely relies on the parameters such as \(\alpha , \tau , \delta \) and \(\varepsilon \). By the aid of values for the above parameters and (15) [or (29)], we could obtain an approximation namely \(T_e\) for the setting time T, which called “estimate time”, then given a time T being no more than \(T_e\), the system is finite-time stability.
4 Numerical Examples
In this section, to demonstrate the effectiveness of our proposed theoretical results, two numerical simulations for fractional-order CVNNs models will be carried out. Dealing with fractional delayed models, the frequently used numerical method is the modified predictor-corrector algorithm, see [46, 47] and references therein.
Example 1
Consider a two-neuron fractional-order Hopfield neural networks described as
where
\(F(z)=(f_1(z_1), f_2(z_2))^T\), \(G(z)=(g_1(z_1), g_2(z_2))^T\), and for \(j=1,2\)
So \(\Vert C\Vert =0.45\), \(\bar{A}=0.3, \tilde{A}=0.3606, \bar{B}=0.4541, \tilde{B}=0.6403\). Obviously, the system satisfies Assumptions 1 and 2 with \(\bar{F}=\sqrt{5}/2, \tilde{F}=\sqrt{5}/4, \bar{G}=\sqrt{5}/4, \tilde{G}=\sqrt{5}/2\). Then we aim to check the finite-time stability with respect to \((t_0=0, J=[0,T],\delta =0.1,\epsilon =1)\). When \(\alpha =0.88, \tau =0.1\), it could be calculated that \(M\approx 0.3723, N\approx 5.3470\), from the condition (15) of Theorem 1, it immediately follows
then the estimated time of finite-time stability is \(T_e\approx 0.4635\), this means for given T which less than 0.4653, the considered system is finite-time stability. For simulations, the following five different initial states are considered respectively:
Also, trajectories corresponding to these initial values are depicted in Fig. 1. Especially, the error between the solutions under initial values \(\phi ^5\) and \(\phi ^3\) and its norm are respectively illustrated in Figs. 2, 3. As shown in Fig. 1, the difference, between any two trajectories of the system with initial error no more than \(\delta \), does not exceed \(\epsilon \) over interval time [0, T], and Figs. 2, 3 more accurately confirm this point. Thus, the results of Theorem 1 are verified by means of this simulation.
Example 2
Consider a CVNNs as described in (46), where
Then \(\Vert C\Vert =0.6\), \(\bar{A}=0.3623, \tilde{A}=0.3623, \bar{B}=0.4515, \tilde{B}=0.7073\). Clearly, the system satisfies Assumptions 1 and 2 with \(\bar{F}=0.5, \tilde{F}=0.25, \bar{G}=0.5, \tilde{G}=0.25\). Next there is the task to test the finite-time stability with respect to \((t_0=0; J=[0,T],\delta =0.1, \epsilon =1)\). When \(\alpha =0.48, \tau =0.3\), according to (30), it could be derived that \(p=1+\alpha =1.48\), \(q=1+1/\alpha =3.0833\), \(\tilde{M}\approx 1.7492, \tilde{N}\approx 17.4862\) and from the condition (29) of Theorem 2, we have
then it could be obtained that the estimated time of finite-time stability is \(T_e\approx 0.2913\). For numerical simulations, the following five initial states are considered respectively:
Trajectories corresponding to these initial values are showed in Fig. 4. Take the solutions referring to initial values \(\phi ^4\) and \(\phi ^1\) into extra consideration, the error between them and its norm are respectively described in Figs. 5, 6. From Figs. 4, 5, 6, it can be directly observed that the numeric conclusions affirm Theorem 2.
5 Conclusions
In this paper, the non-Lyapunov point of view (finite-time stability) of fractional-order CVNNs with time delays have been studied. Not as in integer-order systems, it is hard to search Lyapunov functionals for fractional order cases, causing more difficulties in consideration of infinite-time behavior for such systems. Most important, sometimes it is more critical to study its stability within a certain subset of the state space which are defined a priori over a finite time interval. As a result, the finite-time stability is reasonable and practical. Refer to methods and theoretical foundations, Gronwall inequality, Cauchy–Schiwartz inequality and some inequality scaling techniques are all employed to analysis our model. Some sufficient conditions are obtained for admitting the finite-time stability of the system. Finally, the effectiveness of the theoretical results is showed with the help of two numerical examples. It is worth mentioning that for an exploration of fractional-order CVNNs, our results may be somewhat conservative, which require to be relaxed in the future.
References
Leibniz GW (1962) Mathematische schiften. Georg Olms Verlagsbuch-handlung, Hildesheim
Hall MG, Barrick TR (2008) From diffusion-weighted MRI to anomalous diffusion imaging. Magn Resonan Med 59(3):55–447
Enacheanu O, Riu D, Retiere N, et al (2006) Identification of fractional order models for electrical networks. In: IECON 2006-32nd annual conference on IEEE industrial electronics, pp. 5392–5396
Ahn HS, Chen YQ (2008) Necessary and sufficient stability condition of fractional-order interval linear systems. Automatica 44(11):2985–2988
Rostek S, Schöbel R (2013) A note on the use of fractional Brownian motion for financial modeling. Econ Model 30:30–35
Anastasio TJ (1994) The fractional-order dynamics of brainstem vestibulo-oculomotor neurons. Biol Cybern 72(1):69–79
Arena P, Caponetto R, Fortuna L, Porto D (1998) Bifurcation and chaos in noninteger order cellular neural networks. Int J Bifurc Chaos 8(7):1527–1539
Lundstrom B, Higgs M, Spain W, Fairhall A (2008) Fractional differention by neocortical pyramidal neurons. Nat Neurosci 11:1335–1342
Arena P, Fortuna L, Porto D (2000) Chaotic behavior in noninteger order cellular neural networks. Physi Rev E 61(1):776–781
Boroomand A, Menhaj M (2009) Fractional-order Hopfield neural networks. Lect Notes Comput Sci 5506:883–890
Kaslik E, Sivasundaram S (2011) Dynamics of fractional-order neural networks. In: The 2011 international joint conference on neural networks (IJCNN), IEEE, pp. 611–618
Kaslik E, Sivasundaram S (2012) Nonlinear dynamics and chaos in fractional-order neural networks. Neural Netw 32:245–256
Petráš I (2006) A note on the fractional-order cellular neural networks. In: The 2006 international joint conference on neural networks (IJCNN), IEEE, pp. 1021–1024
Hirose A (2013) Complex-valued neural networks: advances and applications. Wiley, Hoboken
Bao HB, Park JH, Cao JD (2016) Synchronization of fractional-order complex-valued neural networks with time delay. Neural Netw 81:16–28
Song QK, Zhao ZJ, Liu YR (2015) Impulsive effects on stability of discrete-time complex-valued neural networks with both discrete and distributed time-varying delays. Neurocomputing 168:1044–1050
Jankowski S, Lozowski A, Zurada JM (1996) Complex-valued multistate neural associative memory. IEEE Trans Neural Netw 7(6):1491–1496
Mathews JH, Howell RW (2012) Complex analysis for mathematics and engineering, 6th edn. Jones and Bartlett Learning, Burlington
Xu XH, Zhang JY, Shi JZ (2014) Exponential stability of complex-valued neural networks with mixed delays. Neurocomputing 128:483–490
Gong WQ, Liang JL, Zhang CJ (2016) Multistability of complex-valued neural networks with distributed delays. Neural Computing and Applications. doi:10.1007/s00521-016-2305-9
Zhou B, Song QK (2013) Boundedness and complete stability of complex-valued neural networks with time delay. IEEE Trans Neural Netw Learn Syst 24(8):1227–1238
Wu EL, Yang XS (2016) Adaptive synchronization of coupled nonidentical chaotic systems with complex variables and stochastic perturbations. Nonlinear Dyn 84(1):261–269
Rakkiyappana R, Velmurugana G, Cao JD (2015) Stability analysis of fractional-order complex-valued neural networks with time delays. Chaos Solitons Fractals 78:297–316
Rakkiyappan R, Cao JD, Velmurugan G (2015) Existence and uniform stability analysis of fractional-order complex-valued neural networks with time delays. IEEE Trans Neural Netw Learn Syst 26(1):84–97
Weiss L, Infante F (1965) On the stability of systems defined over finite time interval. Proc Natl Acad Sci 54(1):44–48
Khoo S, Yin JL, Man ZH, Yu XH (2013) Finite-time stabilization of stochastic nonlinear systems instrict-feedback form. Automatica 49:1403–1410
Liu H, Zhao XD, Zhang HM (2014) New approaches to finite-time stability and stabilization for nonlinear system. Neurocomputing 138:218–228
Hien LV (2014) An explicit criterion for finite-time stability of linear nonautonomous systems with delays. Appl Math Lett 30:12–18
Yang XS, Ho DWC, Lu JQ, Song Q (2015) Finite-time cluster synchronization of T-S fuzzy complex networks with discontinuous subsystems and random coupling delays. IEEE Trans Fuzzy Syst 23(6):2302–2316
Yang XS, Lu JQ (2016) Finite-time synchronization of coupled networks with Markovian topology and impulsive effects. IEEE Trans Autom Control 61(8):2256–2261
Wu RC, Hei XD, Chen LP (2013) Finite-time stability of fractional-order neural networks with delay. Commun Theor Phys 60(2):189–193
Wu RC, Lu YF, Chen LP (2015) Finite-time stability of fractional delayed neural networks. Neurocomputing 149:700–707
Lazarević MP (2006) Finite time stability analysis of PD\(^\alpha \) fractional control of robotic time-delay systems. Mech Res Commun 33:269–279
Lazarević MP, Spasić AM (2009) Finite-time stability analysis of fractional order time-delay systems: Gronwall’s approach. Math Comput Model 49:475–481
Diethelm K (2004) The analysis of fractional differential equations: an application-oriented exposition using differential operators of caputo type. Springer-Verlag, New York
Li CP, Deng WH (2007) Remarks on fractional derivatives. Appl Math Comput 187(2):777–784
Jiang ZJ, Wu ZQ (1994) The theory of real variable functions. Higher Education Press, Beijing
Kuczma M (2009) An introduction to the theory of functional equations and inequalities: Cauchy’s equation and Jensen’s inequality, Birkhäuser
Corduneanu C (1977) Principles of differential and intergral equations, 2nd edn. Chelsea Pub Co, New York
La Salle S (1961) Lefschet, stability by Lyapunovs direct method. Academic Press, New York
Lam L, Weiss L (1972) Finite time stability with respect to time-varying sets. J Frankl Inst 9:415–421
Grujić Lj T (1975) Non-Lyapunov stability analysis of large-scale systems on time-varying sets. Int J Control 21(3):401–415
Grujić Lj T (1975) Practical stability with settling time on composite systems. Automatika(Yu) 9:1–11
Bhat SP, Bernstein DS (1995) Lyapunov analysis of finite-time differential equations. In: Proceedings of the American control conference, Seattle, pp. 1831–1832
Cao JD, Li RX (2017) Fixed-time synchronization of delayed memristor-based recurrent neural networks. Sci China Inf Sci 60(3):032201. doi:10.1007/s11432-016-0555-2
Diethelm K, Ford NJ, Freed AD (2002) Apredictor-corrector approach for the numerical solution of fractional differential equations. Nonlinear Dyn 29(1):3–22
Bhalekar S, Daftardar-Gejji V (2011) A predictor-corrector scheme for solving nonlinear delay differential equations of fractional order. J Fract Calc Appl 1(5):1–9
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was jointly supported by National Natural Science Foundation of China (Nos. 11301308, 61573096, 61272530), the 333 Engineering Foundation of Jiangsu Province of China (No. BRA2015286), and the Natural Science Youth Foundation of Jiangsu Province of China (No. BK20160660).
Rights and permissions
About this article
Cite this article
Ding, X., Cao, J., Zhao, X. et al. Finite-time Stability of Fractional-order Complex-valued Neural Networks with Time Delays. Neural Process Lett 46, 561–580 (2017). https://doi.org/10.1007/s11063-017-9604-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11063-017-9604-8