Abstract
In order to overcome the complexity of the theoretical analysis caused by using decomposition method to explore the finite-time synchronization behavior of fractional-order quaternion-valued neural networks (FOQVNNs), we aim to deal with this problem directly instead of decomposition. Firstly, two inequalities about quaternion are developed to broaden the current achievements in quaternion field. Secondly, a fractional differential inequality is established by using Laplace transform and applying the definition of Mittag-Leffler function. Then, by employing the presented inequalities and two different quaternion control strategies, some new conditions are derived to guarantee the finite-time synchronization of the delayed FOQVNNs. Finally, two numerical examples are given to illustrate the correctness of the main 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
The synchronization of fractional-order neural networks (FONNs) is used widely in many application fields, such as image encryption [1], cryptography [2], and secure communication [3]. Recently, the synchronization of delayed quaternion-valued neural network (QVNNs) gradually draws researchers’ attention, as the networks carry more information and have broad application prospects. Exploring the field in depth is of great significance.
Compared with integer-order neural networks (IONNs), FONNs describe the dynamic nature of neurons more accurately with their strong memory and more degrees of freedom. In the past few years, great progress has been made in the synchronization of FONNs [4,5,6,7,8,9,10]. Based on the developed fractional-order Gronwall inequality, a new criterion is derived to guarantee the finite-time synchronization of delayed fractional-order memristor-based neural networks in [4]. Under two different controllers, the synchronization of fractional-order competitive neural networks with reaction-diffusion terms and time delays is explored via a new method in [6]. Several sufficient conditions are deduced to ensure the global dissipativity and quasi-Mittag-Leffler synchronization of the considered FONNs in [8]. The non-decomposition method is employed to investigate the finite-time cluster synchronization of fractional-order complex-variable networks with nonlinear coupling in [10]. It is noted that the above researches are investigated in the real or complex domain. However, the real-valued neural networks (RVNNs) and the complex-valued neural networks (CVNNs) lose their advantages in dealing with multi-dimensional features.
In view of the powerful processing and generalization capabilities of quaternion neurons, QVNNs that can load more information are introduced to handle multi-dimensional feature problems. At present, the decomposition method (decomposing the system into two CVNNs or four RVNNs) and the Lyapunov direct method (considering the system as a whole) are proposed to explore the dynamic behaviors of QVNNs in [11,12,13]. For example, the exponential stability conditions for an impulsive disturbed delayed QVNNs are derived by utilizing the real-valued decomposition method and generalized norms in [11]. The global Mittag-Leffler stability of FOQVNNs with leakage and time-varying delays is studied directly in [13]. Nowadays, some researchers have concentrated on the synchronization of FOQVNNs in [14,15,16,17,18,19,20,21]. By using the Lyapunov direct method, some sufficient conditions are obtained to ensure the quasi-synchronization of fractional-order quaternion-valued discrete-time memristive neural networks in [14]. The projective synchronization of delayed FOQVNNs is studied based on the Lyapunov direct method and adaptive controllers in [16]. A vector ordering method is proposed to explore the stability and synchronization control of the fractional-order quaternion-valued fuzzy memristive neural networks in [18]. The FOQVNNs are separated into four real-valued systems to explore the adaptive impulsive synchronization in [20].
However, the synchronization of FOQVNNs is achieved in an infinite time in [14,15,16, 18,19,20,21], which brings a lot of time and economic consumption. Hence, finite-time synchronization which has the features of fast convergence and good robustness is proposed to shorten the synchronization time. Several great results on finite-time synchronization of FOQVNNs have been reported in [22,23,24,25,26,27]. Based on the quaternion-valued sign function, some lemmas are established to explore the finite-time projective synchronization of the established FOQVNNs in [22]. The non-separation method is used to investigate the robust finite-time synchronization of uncertain FOQVNNs in [23]. The problem of finite-time synchronization for delayed FOQVNNs is addressed by applying Lyapunov direct method in [24]. However, in [25,26,27], the decomposition method is employed to explore the finite-time synchronization of FOQVNNs, which inevitably leads to a large amount of calculations and complex analysis. It is quite tricky to separate multiple QVNNs in practical engineering. In [22, 23, 26], time delays are ignored in the established FOQVNNs, which is inconsistent with the actual situation, since the limited signal transmission speed between neurons inevitably leads to time delays. In addition, in [28,29,30,31], the problem of finite-time synchronization for the considered IONNs is analyzed via integral inequality method or maximum-value approach, instead of finite-time stability theorems. Although the integral inequality method and the maximum-value approach are valid for IONNs, these methods cannot be directly applied to FONNs.
Inspired by the above discussions, in this paper, we aim to directly explore the finite-time synchronization of delayed FOQVNNs through fractional finite-time stability theorems. The main difficulty is to directly explore the synchronization behavior of the system without decomposition. The main innovations are as follows:
-
(1)
Two inequalities about quaternion are developed to avoid using the decomposition method, which broaden the current achievements in the quaternion field.
-
(2)
A fractional differential inequality is established by using Laplace transform and applying the definition of Mittag-Leffler function. And the numerical results show that the setting time obtained by employing the established differential inequality is shorter than that obtained by the estimation method in [39, 40]. Obviously, a new way is provided to achieve stability and synchronization of FONNs in a shorter time.
-
(3)
Different from the decomposition method used in [19,20,21, 25,26,27], by applying the new inequalities, two different quaternion control strategies and fractional finite-time stability theorems, some conditions of finite-time synchronization for FOQVNNs are derived, which greatly simplifies the previous researches on synchronization for FOQVNNs.
The paper is organized as follows. In Sect. 2, some definitions and new inequalities are introduced, and a type of delayed FOQVNNs is established. In Sect. 3, some conditions are given to ensure the finite-time synchronization of the delayed FOQVNNs. In Sect. 4, the theoretical results are verified by two numerical simulations. Some useful conclusions are given in Sect. 5.
2 Preliminaries and model description
Notation: Let \({\mathbb {R}}\), \({\mathbb {R}}_{+}\), \({\mathbb {C}}\), \({\mathbb {Q}}\) and \({\mathbb {Q}}^n\) denote the set of real numbers, the set of nonnegative real numbers, the set of complex numbers, the set of quaternion numbers and n-dimensional quaternion space, respectively. For any \(z=z^R+iz^I+jz^J+kz^K\in {\mathbb {Q}}\), \({\overline{z}}=z^R-iz^I-jz^J-kz^K\) is the conjugate of z, where \(z^R\), \(z^I\), \(z^J\), \(z^K\in {\mathbb {R}}\), i, j, k are standard imaginary units and obey Hamilton rules: \(i^2=j^2=k^2=ijk=-1\), \(ij=-ji=k\), \(jk=-kj=i\), \(ki=-ik=j\). \(|z|_1=|z^R|+|z^I|+|z^J|+|z^K|\), \(|z|_2=\sqrt{{\overline{z}}z}\). For any \(Z=(z_1,z_2,\cdots ,z_n)^{T}\in {\mathbb {Q}}^{n}\), then \(||Z||_1=\sum \nolimits _{p=1}^n|z_p|_1\), \(||Z||_2=(\sum _{p=1}^n|z_p|_2^2)^{\frac{1}{2}}\).
2.1 Preliminaries
Some definitions, lemmas and new inequalities are introduced.
Definition 1
[32] The Caputo fractional derivative of order \(\alpha \in (0,1)\) for a function \(f(t)\in C^{1}([t_0,+\infty ), {\mathbb {R}})\) is defined by
where \(\Gamma (\alpha )\) is Euler’s gamma function defined by \(\Gamma (\alpha )=\int _{0}^{+\infty }t^{\alpha -1}e^{-t}dt\).
Definition 2
[32] The Mittag-Leffler functions with two parameters and one parameter are defined as
where \(\alpha >0\), \(\beta >0\), \(\upsilon \in {\mathbb {C}}\).
Lemma 1
[33] The Laplace transform of function \((t-t_0)^{\beta -1}E_{\alpha ,\beta }(\lambda (t-t_0)^\alpha )\) can be described by
where t, s are the variables in the time domain and Laplace domain, respectively. \(t\ge t_0\), \(\alpha >0\) , \(\lambda ,\beta \in {\mathbb {R}}\), and \(|\lambda s^{-\alpha }|<1\).
Lemma 2
[34] Let \(t\ge t_0\), \(0<\alpha <1\) , then \(E_\alpha (\varpi (t-t_0)^\alpha )\) is monotonically non-increasing, and \(0<E_\alpha (\varpi (t-t_0)^\alpha )\le 1\) and \(\lim \nolimits _{t\rightarrow +\infty }E_\alpha (\varpi (t-t_0)^\alpha )=0\) for \(\varpi \le 0\).
Lemma 3
[35] Assume that \(a_p\ge 0\) for all \(p=1,2,\ldots ,n\), then for any \(0<b\le 1\), one has
Lemma 4
[36] Let \(z(t)\in {\mathbb {Q}}\) is a continuously differentiable function, then for \(0<\alpha <1\), one has
Lemma 5
For any \(z\in {\mathbb {Q}}\) , the following inequality holds
Definition 3
[22] For any \(z\in {\mathbb {Q}}\), the sign function of z is defined by
Lemma 6
[22] For any \(z(t)\in {\mathbb {Q}}\), the following statements hold:
-
(i)
$$\begin{aligned} \overline{{\widehat{z}}(t)}{\widehat{z}}(t)=|{\widehat{z}}(t)|_1. \end{aligned}$$
-
(ii)
For \(0<\alpha <1\),
$$\begin{aligned} \begin{aligned}&_{t_0}^{C}D_{t}^\alpha \left( \overline{z(t)}{\widehat{z}}(t) +\overline{{\widehat{z}}(t)}z(t)\right) \\&\quad \le \left( _{t_0}^{C}D_{t}^\alpha \overline{z(t)}\right) {\widehat{z}}(t) +\overline{{\widehat{z}}(t)}~_{t_0}^{C}D_{t}^\alpha z(t). \end{aligned} \end{aligned}$$
Lemma 7
For any \(z(t), w(t), \delta \in {\mathbb {Q}}\), the following statements hold:
-
(i)
$$\begin{aligned} \overline{w(t)}{\widehat{z}}(t)+\overline{{\widehat{z}}(t)}w(t)\le 2|w(t)|_1. \end{aligned}$$
Particularly, if \(w(t)=z(t)\), then
$$\begin{aligned} \overline{z(t)}{\widehat{z}}(t)+\overline{{\widehat{z}}(t)}z(t)=2|z(t)|_1. \end{aligned}$$ -
(ii)
$$\begin{aligned} \begin{aligned}&-\overline{z(t)}~{\overline{\delta }}{\widehat{z}}(t) -\overline{{\widehat{z}}(t)}\delta z(t)\\&\quad \le 2(|\delta ^I|+|\delta ^J|+|\delta ^K|-\delta ^R)|z(t)|_1. \end{aligned} \end{aligned}$$
Proof
For any \(z(t)=z^R(t)+iz^I(t)+jz^J(t)+kz^K(t)\), \(w(t)=w^R(t)+iw^I(t)+jw^J(t)+kw^K(t)\) and \(\delta =\delta ^R+i\delta ^I+j\delta ^J+k\delta ^K \in {\mathbb {Q}}\), by Lemma 5, one has
Particularly, if \(w(t)=z(t)\), then
In addition,
The proof of Lemma 7 is completed.
Remark 1
In order to avoid using the decomposition method in [19,20,21, 25,26,27] to study FOQVNNs, some useful tools for quaternion-valued functions are given in this paper, which broaden the current research results in quaternion field. In particular, if \(w(t)=z(t)\in {\mathbb {Q}}\), Lemma 7(i) is reduced to Lemma 2 in [13] or Lemma 1 in [22]. If \(w(t)=z(t)\in {\mathbb {C}}\), Lemma 7(i) is reduced to Lemma 11 in [37]. Clearly, Lemma 7 is more general than the existing results [13, 22, 37] and supplements the non-decomposition method for FOQVNNs [14,15,16,17,18, 22,23,24].
Lemma 8
Let V(t) be a continuous and nonnegative function and satisfy
where \(0<\alpha <1\), \(t\ge t_0\), \(\lambda \ge 0\), \(\rho >0\), then the following statements hold:
-
(i)
If \(\lambda =0\), then
$$\begin{aligned} V(t)\le V(t_0)-\frac{\rho (t-t_0)^\alpha }{\Gamma (\alpha +1)} ,~V(t)\in {\mathbb {R}}_{+}\backslash \{0\}, \end{aligned}$$moreover, \(\lim \nolimits _{t\rightarrow t_1}V(t)=0\), and \(V(t)\equiv 0\) for \(\forall t\ge t_1\), the setting time \(t_1\) is estimated by
$$\begin{aligned} t_1\le t_0+\left( \frac{V(t_0)\Gamma (\alpha +1)}{\rho }\right) ^{\frac{1}{\alpha }}. \end{aligned}$$ -
(ii)
If \(\lambda >0\), then
$$\begin{aligned} V(t)\le & {} \left( V(t_0)+\frac{\rho }{\lambda }\right) E_\alpha (-\lambda (t-t_0)^\alpha )-\frac{\rho }{\lambda },\\&V(t)\in {\mathbb {R}}_{+}\backslash \{0\} \end{aligned}$$moreover, \(\lim \nolimits _{t\rightarrow t_2}V(t)=0\), and \(V(t)\equiv 0\) for \(\forall t\ge t_2\), the setting time \(t_2\) satisfies
$$\begin{aligned} E_\alpha (-\lambda (t_2-t_0)^\alpha )=\frac{\rho }{\lambda V(t_0)+\rho } \end{aligned}$$
Proof
If \(\lambda =0\), inequality (3) is reduced to
the proof is similar to Lemma 10 in [37] and Proposition 1 in [38], which is omitted here.
If \(\lambda >0\), there exists a \(H(t)\ge 0\), such that
Taking Laplace transform on both sides of equation (5), we have
where \(V(s)={\mathcal {L}}\{V(t)\}\), \(H(s)={\mathcal {L}}\{H(t)\}\), then
By Lemma 1, one has
According to \(H(t)\ge 0\), \((t-t_0)^{\alpha -1}\ge 0\) and \(E_{\alpha ,\alpha }(-\lambda (t-t_0)^\alpha )\ge 0\), then \(H(t)*[(t-t_0)^{\alpha -1}E_{\alpha ,\alpha }(-\lambda (t-t_0)^\alpha )]\ge 0\). Furthermore,
By Definition 2, one has
Hence,
Let \(\Phi (t)=\left( V(t_0)+\frac{\rho }{\lambda }\right) E_\alpha (-\lambda (t-t_0)^\alpha )-\frac{\rho }{\lambda }\), by Lemma 2, \(\Phi (t)\) is monotonically non-increasing, and \(\Phi (t_0)=V(t_0)>0\), \(\lim \nolimits _{t\rightarrow \infty }\Phi (t)=-\frac{\rho }{\lambda }<0\). Therefore, there exists a constant \(t_2>t_0\), such that \(\Phi (t_2)=0\), which implies \(\lim \nolimits _{t\rightarrow t_2}V(t)=0\), and \(V(t)\equiv 0\) for \(\forall t\ge t_2\), and the setting time \(t_2\) satisfies
If the above statements are wrong, then there exists a \(t^*_2>t_2\), such that \(V(t^*_2)>0\). From inequality (11), \(V(t^*_2)\le \Phi (t^*_2)\le \Phi (t_2)=0\), which contradicts \(V(t^*_2)>0\). Hence, \(V(t)\equiv 0\) for \(\forall t\ge t_2\). The proof of Lemma 8 is completed. \(\square \)
Remark 2
Under the condition of \(\lambda >0\) in inequality (3), in [39, 40], the researchers reduce inequality (3) to \(_{t_0}^{C}D_{t}^\alpha V(t)\le -\rho \) to estimate the setting time. Actually, the value of parameter \(\lambda \) is an important factor affecting the setting time. Hence, we introduce Lemma 8(ii) based on the Laplace transform and the definition of Mittag-Leffler function to explore the influence of \(\lambda \). And the numerical results show that the setting time obtained by using Lemma 8 is shorter than that given by the method used in [39, 40] (see Example 1). Obviously, a new way is provided to achieve stability and synchronization of FONNs in a shorter time. Besides, a novel proof idea is offered, which is different from Proposition 1 in [38].
Lemma 9
[37] Let V(t) be a continuous and nonnegative function and satisfy
where \(0<\alpha <1\), \(t\ge t_0\), \(\lambda >0\) and \(0<\gamma <\alpha \), then
moreover, \(\lim \nolimits _{t\rightarrow t_3}V(t)=0\), and \(V(t)\equiv 0\) for \(\forall t\ge t_3\), the setting time \(t_3\) is estimated by
2.2 Model description
In comparison with RVNNs and CVNNs, QVNNs load more information, and they can be directly used to encode 3D affine transformations. For example, in image compression, the three imaginary parts of a quaternion-valued neuron encode the three color channels to achieve color image transmission. Moreover, FOQVNNs have the ability to describe complex dynamics more accurately based on the infinite memory of fractional-order derivatives. Therefore, the following delayed FOQVNNs are established:
where \(0<\alpha <1\), \(x_p(t)\in {\mathbb {Q}}\) is the state variable. \(c_p\in {\mathbb {Q}}\) is the neuron self-inhibition and satisfies \(c^R_q>0\). \(a_{pq}\in {\mathbb {Q}}\) and \(b_{pq}\in {\mathbb {Q}}\) are connection weights, \(\tau >0\) is time delay, \(I_p(t)\in {\mathbb {Q}}\) is the external input. \(f_q(x_q(t))\), \(g_q(x_q(t-\tau ))\in {\mathbb {Q}}\) are activation functions.
System (12) is regarded as the drive system, and the response system is as follows
where \(u_p(t)\in {\mathbb {Q}}\) is a controller.
Assumption 1
For u, \(v\in {\mathbb {Q}}\), there exist positive constants \(F_{lq}\), \(G_{lq}\), such that
where \(q\in \{1,2,\ldots ,n\}\), and the symbol \(|\cdot |_l\) denotes l norm, \(l=1,2\).
3 Main results
In this section, the conditions for FOQVNNs to complete finite-time synchronization are derived by using the new inequalities and two different controllers.
First, the controller \(u_p(t)\in {\mathbb {Q}}\) is designed as follows:
where \(e_p(t)=y_p(t)-x_p(t)\), \(r_p>0\), \(\eta _p>0\).
Combining (12)-(14), the error system is given by
where \({\widetilde{f}}_q(e_q(t))=f_q(y_q(t))-f_q(x_q(t))\), \({\widetilde{g}}_q(e_q(t-\tau ))=g_q(y_q(t-\tau ))-g_q(x_q(t-\tau ))\).
Theorem 1
Under Assumption 1and controller (14), for some \(\mu >1\), if
where \(M_1=\min \nolimits _{p=1,2,\ldots ,n}\{c^R_p+r_p-(|c^I_p|+|c^J_p|+|c^K_p|+\sum _{q=1}^n|a_{qp}|_1F_{1p})\}\), \(M_2=\max \nolimits _{p=1,2,\ldots ,n}\{\sum _{q=1}^n|b_{qp}|_1G_{1p}\}\), then system (13) is synchronized with system (12) in a finite time.
Proof
Construct the following Lyapunov function
And it follows from Lemma 7 that
According to Lemma 7 and Assumption 1, we have
Similarly,
By Lemma 7, one has
Then, submitting (18)-(21) into (17) and combining the conditions of Theorem 1, for \(V_1(t)\in {\mathbb {R}}_{+}\backslash \{0\}\), we get
where \(\eta =\min \nolimits _{p=1,2,\ldots ,n}\{\eta _p\}\).
By fractional-order Razumikhin theorem [41], for some \(\mu >1\), one has
According to Lemma 6 and \(V_1(t)\in {\mathbb {R}}_{+}\backslash \{0\}\), then \(\overline{{\widehat{e}}_p(t)}{\widehat{e}}_p(t)\ge 1\), hence
When \(M=0\), inequality (24) is reduced to
and by Lemma 8, we have
moreover, \(\lim \nolimits _{t\rightarrow T_1}V_1(t)=0\), and \(V_1(t)\equiv 0\) for \(\forall t\ge T_1\). Therefore, under controller (14), system (13) is synchronized with system (12) in a finite time. And the setting time \(T_1\) is estimated by
When \(M>0\), according to Lemma 8,
moreover, \(\lim \nolimits _{t\rightarrow T_2}V_1(t)=0\), and \(V_1(t)\equiv 0\) for \(\forall t\ge T_2\). Therefore, under controller (14), system (13) is synchronized with system (12) in a finite time. And the setting time \(T_2\) satisfies
The proof of Theorem 1 is completed. \(\square \)
Remark 3
For controller (14), two control parameters are designed, and \(r_p\) is used to control the response system to synchronize with the drive system, see the conditions of Theorem 1. While \(\eta _p\) is used to estimate the setting time, see (27) and (29) in the proof of Theorem 1.
Then, the controller \(u_p(t)\in {\mathbb {Q}}\) is designed as follows:
where \(0<\beta <2\alpha -1\).
Meanwhile, the error system is given by
where \({\widetilde{f}}_q(e_q(t))=f_q(y_q(t))-f_q(x_q(t))\), \({\widetilde{g}}_q(e_q(t-\tau ))=g_q(y_q(t-\tau ))-g_q(x_q(t-\tau ))\).
Theorem 2
Under Assumption 1and controller (30), for some \(\nu >1\), if
where \(M^*_1=\min \nolimits _{p=1,2,\ldots ,n}\{2(c^R_p+r_p)-\sum _{q=1}^n(|a_{pq}|_2F_{2q}+|a_{qp}|_2F_{2p}+|b_{pq}|_2G_{2q})\}\) , \(M^*_2=\max \nolimits _{p=1,2,\ldots ,n}\{\sum _{q=1}^n|b_{qp}|_2G_{2p}\}\) , then system (13) is synchronized with system (12) in a finite time.
Proof
Construct the following Lyapunov function
By Lemma 4, one has
Similarly,
According to Lemma 3, Lemma 5 and Lemma 7,
where \(\eta =\min \nolimits _{p=1,2,\ldots ,n}\{\eta _p\}\).
Then, submitting (34)-(36) into (33) and combining the conditions of Theorem 2, for \(V_2(t)\in {\mathbb {R}}_{+}\backslash \{0\}\), we have
By fractional-order Razumikhin theorem [41], for some \(\nu >1\) and \(V_2(t)\in {\mathbb {R}}_{+}\backslash \{0\}\), one has
Due to \(0<\beta <2\alpha -1\), it follows that \(0<\frac{1+\beta }{2}<\alpha \). According to Lemma 9,
moreover, \(\lim \nolimits _{t\rightarrow T_3}V_2(t)=0\), and \(V_2(t)\equiv 0\) for \(\forall t\ge T_3\). Therefore, under controller (30), system (13) is synchronized with system (12) in a finite time. And the setting time \(T_3\) is estimated by
The proof of Theorem 2 is completed. \(\square \)
Remark 4
The decomposition method provided in [19,20,21, 25,26,27] is quite complicated since both the original system and the controller need to be decomposed. Therefore, in this paper, two inequalities about quaternion are established and two different quaternion-valued controllers are designed, which complements the direct exploration of synchronization of FOQVNNs and avoids the complex decomposition process. Especially for multiple multi-dimensional systems, our method has the advantages of simple operation, easy analysis and less calculation.
4 Numerical simulations
In this section, in order to verify the validity of the theoretical results, we simulate two examples based on the quaternion-valued recurrent neural networks model applied to image compression [42].
Example 1
Consider the following delayed FOQVNNs as the drive system:
where \(t\ge 0\), \(p=1,2\), \(\alpha =0.96\), \(\tau =1.8\), \(I_p(t)=0\), \(f_q(x_q(t))=tanh(x^R_q(t))+itanh(x^I_q(t))+jtanh(x^J_q(t))+ktanh(x^K_q(t))\) and \(g_q(x_q(t))=sin(x^R_q(t))+isin(x^I_q(t))+jsin(x^J_q(t))+ksin(x^K_q(t))\), the initial values \(\phi _{1}=2+i-j-2k\) and \(\phi _{2}=1.2-2.5i-j+3.5k\) for \(t\in [-1.8,0]\), and
The response system is described as follows
where the initial values \(\varphi _{1}=-0.5-1.4i+j-k\) and \(\varphi _{2}=-1+1.2j+2.3k\) for \(t\in [-1.8,0]\).
If \(u_p(t)=0\), the synchronization error evolution for four parts is depicted in Fig. 1, which indicates system (42) is not synchronized with system (41).
The parameters are set to satisfy the conditions of Theorem 1, as shown below. By calculation, for \(q=1,2\), we have \(F_{1q}=G_{1q}=1\). \(V_1(0)=16\), \(\sum _{q=1}^2|a_{q1}|_1F_{11}=4.8\), \(\sum _{q=1}^2|a_{q2}|_1F_{12}=5.6\), \(c^R_1-(|c^I_1|+|c^J_1|+|c^K_1|+\sum _{q=1}^2|a_{q1}|_1F_{11})=-4.2\), \(c^R_2-(|c^I_2|+|c^J_2|+|c^K_2|+\sum _{q=1}^2|a_{q2}|_1F_{12})=-4.5\), \(M_1=\min \{r_1-4.2,r_2-4.5\}\), \(\sum ^2_{q=1}|b_{q1}|_1G_{11}=5.5\), \(\sum _{q=1}^2|b_{q2}|_1G_{12}=5.1\), \(M_2=\max \{5.5,5.1\}=5.5\). Fixing \(\mu =1.1\), to ensure \(M=M_1-\mu M_2\ge 0\), we choose \(r_1=r_2=11\), then \(M_1=\min \{6.8,6.5\}=6.5\) and \(M=0.45\). According to the conditions of Theorem 1, at this time, we only need to ensure that the parameters \(\eta _1\) and \(\eta _2\) are greater than 0. Hence, we choose the special case of \(\eta _1=\eta _2=0.1\) and estimate the corresponding setting time \(T_2\approx 10.45\). Therefore, under controller (14), system (42) is synchronized with system (41) at \(T_2\approx 10.45\), which is shown in Fig. 2. However, when this set of parameters is fixed, the estimation method in [39, 40] is used, and the setting time is estimated as \(T^*_2\approx 94.4\). Obviously, our results are more accurate.
Example 2
Consider the following delayed FOQVNNs as the drive system:
where \(t\ge 0\), \(p=1,2\), \(\alpha =0.98\), \(\tau =1\), \(I_p(t)=0\), the initial values \(\phi _{1}=1-i+j+k\) and \(\phi _{2}=-1-i-k\) for \(t\in [-1,0]\), and
The response system is described as follows
where the initial values \(\varphi _{1}=-1+i-j\) and \(\varphi _{2}=1+i-j\) for \(t\in [-1,0]\).
The parameters are set to satisfy the conditions of Theorem 2, as shown below. By simple calculation, for \(q=1,2\), we have \(F_{2q}=G_{2q}=0.5\). \(V_2(0)=23\), \(2c^R_1-\sum _{q=1}^2(|a_{1q}|_2F_{2q}+|a_{q1}|_2F_{21}+|b_{1q}|_2G_{2q})\approx -5.84\), \(2c^R_2-\sum _{q=1}^2(|a_{2q}|_2F_{2q}+|a_{q2}|_2F_{22}+|b_{2q}|_2G_{2q})\approx -4.56\), \(M^*_1=\min \{2r_1-5.84,2r_2-4.56\}\), \(\sum _{q=1}^2|b_{q1}|_2G_{21}\approx 2.96\), \(\sum _{q=1}^2|b_{q2}|_2G_{22}\approx 2.89\), \(M^*_2=\max \{2.96,2.89\}=2.96\). Fixing \(\nu =2\), to ensure \(M^*=M^*_1-\nu M^*_2\ge 0\), we choose \(r_1=6\), \(r_2=5.5\), then \(M^*_1=\min \{6.16,6.44\}=6.16\) and \(M^*=0.24\). According to the conditions of Theorem 2, at this time, we only need to ensure that the parameters \(\eta _1>0\), \(\eta _2>0\) and \(0<\beta <0.96\). Hence, we choose the special case of \(\eta _1=\eta _2=0.5\) and \(\beta =0.4\), and estimate the corresponding setting time \(T_3\approx 8.27\). Therefore, under controller (30), system (44) is synchronized with system (43) at \(T_3\approx 8.27\), which is depicted in Fig. 3. Particularly, when fractional order \(\alpha \) and other parameters are fixed, the evolution of setting time \(T_3\) versus \(\beta \) is shown in Fig. 4. As shown in Fig. 4, the setting time \(T_3\) first decreases and then increases with the increase of \(\beta \). Hence, we can properly adjust parameter \(\beta \) to get a smaller setting time.
5 Conclusion
In this paper, the finite-time synchronization of delayed FOQVNNs is explored by using some new inequalities and control strategies. First, two inequalities about quaternion are developed and a fractional differential inequality is established by using Laplace transform and applying the definition of Mittag-Leffler function. Then, by applying new inequalities and two different controllers, some conditions are derived to guarantee the finite-time synchronization of the delayed FOQVNN. Finally, the theoretical results are verified by two numerical examples. The results of numerical example 1 show that the setting time is more accurate than that obtained by the estimation method in [39, 40]. The results of numerical example 2 suggest that if fractional order \(\alpha \) and other parameters are fixed, the setting time first decreases and then increases with the increase in fractional-order power law \(\beta \) in controller (30). Hence, the parameter \(\beta \) can be adjusted appropriately to obtain a smaller setting time. Regrettably, the estimation of the setting time is affected by the initial values of the system, and the initial values are difficult to know in advance. Therefore, discussing the fixed-time synchronization of delayed FOQVNNs that does not depend on the initial values will be our future research topic.
References
Chen LP, Yin H, Huang TW et al (2020) Chaos in fractional-order discrete neural networks with application to image encryption. Neural Netw 125:174–184
Roohi M, Zhang CQ, Chen YC (2020) Adaptive model-free synchronization of different fractional-order neural networks with an application in cryptography. Nonlinear Dyn 100(4):3979–4001
Song XN, Sun XL, Man JT et al (2021) Synchronization of fractional-order spatiotemporal complex-valued neural networks in finite-time interval and its application. J Franklin Instit 358(16):8207–8225
Du FF, Lu JG (2021) New criterion for finite-time synchronization of fractional order memristor-based neural networks with time delay. Appl Math Comput 389:125616–125631
Yao XQ, Liu XZ, Zhong SM (2021) Exponential stability and synchronization of Memristor-based fractional-order fuzzy cellular neural networks with multiple delays. Neurocomputing 419:239–250
Yang S, Jiang HJ, Hu C et al (2021) Synchronization for fractional-order reaction-diffusion competitive neural networks with leakage and discrete delays. Neurocomputing 436:47–57
Yang S, Jiang HJ, Hu C et al (2021) Exponential synchronization of fractional-order reaction-diffusion coupled neural networks with hybrid delay-dependent impulses. J Franklin Instit 358(6):3167–3192
Ding ZX, Zhang H, Zeng ZG, et al (2021) Global dissipativity and quasi-Mittag-Leffler synchronization of fractional-order discontinuous complex-valued neural networks. IEEE Trans Neural Netw Learn Syst 1–14. https://doi.org/10.1109/TNNLS.2021.3119647
Liu X, Yu YG (2021) Synchronization analysis for discrete fractional-order complex-valued neural networks with time delays. Neural Comput Appl 33(16):1–12
Yang S, Hu C, Yu J et al (2021) Finite-time cluster synchronization in complex-variable networks with fractional-order and nonlinear coupling. Neural Netw 135:212–224
Wang HM, Wei GL, Wen SP et al (2021) Impulsive disturbance on stability analysis of delayed quaternion-valued neural networks. Appl Math Comput 390:125680–125690
Xu CJ, Liao MX, Li PL et al (2021) New results on pseudo almost periodic solutions of quaternion-valued fuzzy cellular neural networks with delays. Fuzzy Sets Syst 411:25–47
Yan HY, Qiao YH, Duan LJ et al (2021) Novel methods to global Mittag-Leffler stability of delayed fractional-order quaternion-valued neural networks. Neural Networks 142:500–508
Li RX, Cao JD, Xue CF et al (2021) Quasi-stability and quasi-synchronization control of quaternion-valued fractional-order discrete-time memristive neural networks. Appl Math Comput 395:125851–125863
Xiao JY, Zhong SM, Wen SP (2021) Improved approach to the problem of the global Mittag-Leffler synchronization for fractional-order multidimension-valued BAM neural networks based on new inequalities. Neural Networks 133:87–100
Zhang WW, Sha CL, Cao JD et al (2021) Adaptive quaternion projective synchronization of fractional order delayed neural networks in quaternion field. Appl Math Comput 400:126045–126051
Xiao JY, Cheng J, Shi KB et al (2021) A general approach to fixed-time synchronization problem for fractional-order multi-dimension-valued fuzzy neural networks based on memristor. IEEE Trans Fuzzy Syst 1–11. https://doi.org/10.1109/TFUZZ.2021.3051308
Wei HZ, Li RX, Wu BW (2021) Dynamic analysis of fractional-order quaternion-valued fuzzy memristive neural networks: vector ordering approach. Fuzzy Sets Syst 411:1–24
Xiao JY, Cao JD, Cheng J et al (2020) Novel inequalities to global Mittag-Leffler synchronization and stability analysis of fractional-order quaternion-valued neural networks. IEEE Trans Neural Networks Learn Syst 1–10. https://doi.org/10.1109/TNNLS.2020.3015952
Pratap A, Raja R, Alzabut J et al (2020) Mittag-Leffler stability and adaptive impulsive synchronization of fractional order neural networks in quaternion field. Math Methods Appl Sci 43(10):6223–6253
Xiao JY, Wen SP, Yang XJ et al (2020) New approach to global Mittag-Leffler synchronization problem of fractional-order quaternion-valued BAM neural networks based on a new inequality. Neural Networks 122:320–337
Yang S, Hu C, Yu J et al (2021) Projective synchronization in finite-time for fully quaternion-valued memristive networks with fractional-order. Chaos Solit Fract 147:110911–110924
Li HL, Hu C, Zhang L et al (2021) Non-separation method-based robust finite-time synchronization of uncertain fractional-order quaternion-valued neural networks. Appl Math Comput 409:126377–126391
Zhang WW, Zhao HY, Sha CL et al (2021) Finite time synchronization of delayed quaternion valued neural networks with fractional order. Neural Process Lett 53(5):3607–3618
Narayanan G, Ali MS, Alam MI et al (2021) Adaptive fuzzy feedback controller design for finite-time Mittag-Leffler synchronization of fractional-order quaternion-valued reaction-diffusion fuzzy molecular modeling of delayed neural networks. IEEE Access 9:130862–130883
Xiao JY, Cao JD, Cheng J et al (2020) Novel methods to finite-time Mittag-Leffler synchronization problem of fractional-order quaternion-valued neural networks. Inf Sci 526:221–244
Ding DW, You ZR, Hu YB et al (2021) Finite-time synchronization of delayed fractional-order quaternion-valued memristor-based neural networks. Int J Mod Phys B 35(3):2150032–2150060
Zhang ZQ, Chen M, Li AL (2020) Further study on finite-time synchronization for delayed inertial neural networks via inequality skills. Neurocomputing 373:15–23
Zhang ZQ, Li AL, Yu SH (2018) Finite-time synchronization for delayed complex-valued neural networks via integrating inequality method. Neurocomputing 318:248–260
Zhang ZQ, Cao JD (2019) Novel finite-time synchronization criteria for inertial neural networks with time delays via integral inequality method. IEEE Trans Neural Networks Learn Syst 30(5):1476–1485
Zhang ZQ, Cao JD (2021) Finite-time synchronization for fuzzy inertial neural networks by maximum-value approach. IEEE Trans Fuzzy Syst 1–11. https://doi.org/10.1109/TFUZZ.2021.3059953
Podlubny I (1999) Fractional differential equations. Academic Press, San Diego
Kilbas AA, Srivastava HM, Trujillo JJ (2006) Theory and application of fractional differential equations. Elsevier, Amsterdam
Kilbas AA, Saigo M, Saxena RK (2004) Generalized mittag-leffler function and generalized fractional calculus operators. Integral Transf Spec Funct 15:31–49
Hardy GH, Littlewood JE, Pólya G (1988) Inequalities. Cambridge University Press, Cambridge
Li HL, Jiang HJ, Cao JD (2020) Global synchronization of fractional-order quaternion-valued neural networks with leakage and discrete delays. Neurocomputing 385:211–219
Zheng BB, Hu C, Yu J et al (2020) Finite-time synchronization of fully complex-valued neural networks with fractional-order. Neurocomputing 373:70–80
Yang S, Yu J, Hu C et al (2020) Finite-time synchronization of memristive neural networks with fractional-order. IEEE Trans Syst Man Cybernet Syst 1–12. https://doi.org/10.1109/TSMC.2019.2931046
Li HL, Cao JD, Jiang HJ et al (2019) Finite-time synchronization and parameter identification of uncertain fractional-order complex networks. Phys A 533:122027–122036
Li XF, Fang JA, Zhang WB et al (2018) Finite-time synchronization of fractional-order memristive recurrent neural networks with discontinuous activation functions. Neurocomputing 316:284–293
Liu S, Yang R, Zhou XF (2019) Stability analysis of fractional delayed equations and its applications on consensus of multi-agent systems. Commun Nonlinear Sci Numer Simul 73:351–362
Wang Y, Sha CL, Zhao HY (2021) Design and analysis of multi-valued auto-associative quaternion-valued recurrent neural networks based on external inputs. Neurocomputing 444:1–15
Acknowledgements
This research is supported by Beijing Municipal Natural Science Foundation (No.4202025), partially sponsored by the National Natural Science Foundation of China (No.61672070), Beijing Municipal Education Commission (No.KZ201910005008, KM201911232003) and the Research Fund from Beijing Innovation Center for Future Chips (No.KYJJ2018004).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Yan, H., Qiao, Y., Duan, L. et al. New inequalities to finite-time synchronization analysis of delayed fractional-order quaternion-valued neural networks. Neural Comput & Applic 34, 9919–9930 (2022). https://doi.org/10.1007/s00521-022-06976-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-022-06976-1