Next Article in Journal
IBA-VNS: A Logic-Based Machine Learning Algorithm and Its Application in Surgery
Previous Article in Journal
Intrusion Detection Based on Adaptive Sample Distribution Dual-Experience Replay Reinforcement Learning
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Synchronization Analysis for Quaternion-Valued Delayed Neural Networks with Impulse and Inertia via a Direct Technique

1
College of Mathematics and System Science, Xinjiang University, Urumqi 830017, China
2
Xinjiang Key Laboratory of Applied Mathematics, Urumqi 830017, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(7), 949; https://doi.org/10.3390/math12070949
Submission received: 19 February 2024 / Revised: 19 March 2024 / Accepted: 22 March 2024 / Published: 23 March 2024
(This article belongs to the Topic Advances in Artificial Neural Networks)

Abstract

:
The asymptotic synchronization of quaternion-valued delayed neural networks with impulses and inertia is studied in this article. Firstly, a convergence result on piecewise differentiable functions is developed, which is a generalization of the Barbalat lemma and provides a powerful tool for the convergence analysis of discontinuous systems. To achieve synchronization, a constant gain-based control scheme and an adaptive gain-based control strategy are directly proposed for response quaternion-valued models. In the convergence analysis, a direct analysis method is developed to discuss the synchronization without using the separation technique or reduced-order transformation. In particular, some Lyapunov functionals, composed of the state variables and their derivatives, are directly constructed and some synchronization criteria represented by matrix inequalities are obtained based on quaternion theory. Some numerical results are shown to further confirm the theoretical analysis.
MSC:
34A36; 34D20; 92B20; 93D05

1. Introduction

In recent decades, various types of real-valued neural networks (RV-NNs) have captured a lot of attention because of their distinctive structure, and they have been widely applied in various fields including neuroscience technology, artificial intelligence and natural language processing [1,2,3]. To process multi-dimensional data efficiently and tackle symmetry detection or XOR problems effectively, multi-valued neural networks have been proposed recently, such as complex-valued neural networks (CV-NNs) and quaternion-valued neural networks (QV-NNs) [4]. Compared with CV-NNs, QV-NNs have significant advantages in high-dimensional data processing like color image processing [5], 3D wind forecasting [6] and object recognition [7]. Currently, as a theoretical foundation, the dynamics and control of QV-NNs have drawn a great deal of attention and some valuable research has been published [8,9].
As we know, synchronization plays a vital role in complex systems since it has the function of regulating the rhythm of the entire system to achieve consistent behavior. Actually, synchronization can not only account for many phenomena in nature, but also has a wide range of applications such as image processing and secure communication [10]. Consequently, synchronization of neural network systems is an important research topic, and various types of synchronization, such as exponential synchronization [11], quasi-synchronization [12], projective synchronization [13] and finite-time synchronization [14], have been widely discussed by virtue of quantized intermittent control [11], event-triggered control [15] and adaptive control [16]. Meanwhile, delay is inevitable because of network parameter fluctuations during hardware operation, the limited speed of transmission of signals and the switching of amplifiers. Currently, various QV-NN models with different types of delays have been investigated, including mixed delay [17], leakage delay [18], proportional delay [9,19] and time-varying delay [20].
Note that the main method adopted in the above results is the separation technique; that is, the original QV-NNs are divided into two CV-NNs or four RV-NNs [17,21,22,23]. This method of separation is feasible, but it has some inevitable weaknesses. Firstly, the separation of QV-NNs is inherently challenging, and it may significantly compromise the overall system performance. In addition, the dimensions of the system obtained by separation are two or four times that of the original QV-NNs, which undoubtedly increases the difficulty of theoretical analysis and the complexity of the synchronization conditions. Moreover, two or four control inputs must be designed for subsystems after separation, which may pose a practical implementation challenge. To overcome these shortcomings, some non-decomposition methods have been developed to analyze the synchronization of QV-NNs. The authors investigated quasi-synchronization of fractional-order fuzzy memristive QV-NNs by using a vector ordering approach [24]. The fixed-time synchronization of QV-NNs with impulses was investigated in [25] by virtue of the non-decomposition method and the implicit Lyapunov function technique.
In addition to the NN model characterized by the first-order differential equations, the inertial neural network (INN) model has been widely studied since it was proposed in 1986 [26] due to its important practical background. For example, the charge on a capacitor, the transverse motion of an extensible beam and the vibrations of hinged bars can be modeled by second-order differential Equations [27], and the membrane behavior of hair cells and the axon of squid can be described more accurately by INN systems compared with first-order NN systems [28]. To date, many researchers have studied the synchronization of diverse INNs and achieved many valuable results [29,30,31,32]. In [31], the authors discussed asymptotic synchronization of memristive Cohen–Grossberg INNs with proportional delays via variable transformations. In [32], the synchronization of memristive INNs with time-varying delays and parameter disturbance was analyzed via variable transformations. Note that the above results were obtained by firstly converting the original INN into two first-order differential systems and then designing two controllers for each first-order system. In contrast to the cumbersome reduced-order transformation method, a direct analysis technique was initially developed to discuss the stability and synchronization of delayed INNs in [33] by creatively constructing a Lyapunov functional composed of the state variable and its derivative. At present, the method of non-reduction has been widely developed to study the synchronization of INNs [34,35,36,37,38,39]. In particular, an event triggering controller was designed to investigate the synchronization of QV-INNs, and several criteria were derived by making full use of the non-reduction method in [40]. In [41], a type of full quaternion-valued inertial neural network (QV-INN) with time-varying delays was considered, and based on the direct analysis method, the synchronization was studied via PD control and its adaptive scheme.
During circuit implementation, it has been discovered that artificial neural networks undergo mutations due to transient disturbances or voltage instabilities, which is known as the impulse effect [42]. Evidently, the impulse inevitably affects the dynamic changes of systems and it is valuable to investigate the dynamics and control of impulsive models. The approximate controllability of impulsive differential systems with the effect of hemivariational inequalities was investigated in [43], and some criteria for the existence and approximate controllability were derived by means of a multivalued map and a generalized Clarke subdifferential approach. In [44], impulsive CV-INNs with proportional delays were studied; exponential synchronization and lag synchronization were, respectively, discussed by directly constructing an appropriate Lyapunov functional to replace the standard order-reduction transformation. In [45], based on nonlinear feedback control and the method of order reduction, the synchronization problem of memristor-based QV-INNs with impulses was addressed. Nevertheless, it is still challenging and valuable to explore the synchronization of impulsive QV-INNs under the framework of direct analysis without utilizing reduced-order transformation and separation methods.
Taking the above as inspiration, this article will study the synchronization problem of QV-INNs with impulses and time delays by developing a direct analysis technique.
(1)
A type of fully quaternion-valued impulsive INN model with time delays is introduced, which extends the previous models of RV-INNs and CV-INNs [36,41,44,46,47]. In addition, a convergence result on piecewise differentiable functions is derived, which is a generalization of the Barbalat lemma [48] and provides a vital tool for the convergence analysis of impulsive models.
(2)
Under constant gain-based control and adaptive gain-based control, two kinds of quaternion-valued control schemes are directly developed for the response QV-INNs, which are distinct from the control designs on the reduced-order systems of inertial NNs in [31,32] and the control strategies on subsystems obtained by separation used in [17,21,22,23].
(3)
Without using the separation technique and reduced-order transformation proposed in [17,21,22,23,31,32], a direct analysis method is developed to discuss the synchronization of QV-INNs. In particular, some Lyapunov functionals, composed of the state variables and their derivatives, are directly constructed for the QV-INNs and some synchronization conditions represented by matrix inequalities are obtained based on quaternion theory and the established convergence result on piecewise differentiable functions.
The rest of this article is as follows. Section 2 introduces the models of QV-INNs and some preliminaries. The synchronization results are given in Section 3. Section 4 shows numerical examples. The conclusion is drawn in Section 5.
Notations: In what follows,  Θ = { 1 , 2 , , m } N +  is the set of all non-negative integers and  R +  and  R m  separately represent the set of all non-negative real numbers and the space consisting of m-dimensional real vectors.  Q m  is a set composed of all m-dimensional quaternion vectors.  G = C ( [ υ , 0 ] , Q m )  is a set composed of all continuous functions on  [ υ , 0 ] . The norm of quaternion a is defined as  a = a a * , where  a * = a R a I i a J j a K k  represents the conjugate of a ω = ( ω 1 , , ω m ) T Q m ω H  denotes its conjugate transpose and  ω T  represents its transpose.

2. Model Description and Preliminaries

A category of QV-INNs with time delays and impulses is discussed here, which is characterized as
w ¨ q ( s ) = ξ q w ˙ q ( s ) ς q w q ( s ) + r Θ z q r h r ( w r ( s ) ) + r Θ l q r p r ( w r ( s υ r ( s ) ) ) + J q ( s ) , s s n , w q ( s n + ) = N q w q ( s n ) , w ˙ q ( s n + ) = N q w ˙ q ( s n ) , q Θ , n N + ,
in which  w q ( s ) Q  is the state of the qth neuron in the time instant s, both  ξ q Q  and  ς q Q  are the feedback self-connection weights,  z q r Q l q r Q  are the weights, respectively, between neurons r and q without and with time delays,  h r ( · )  and  p r ( · ) : Q Q  are QV activation functions of the rth neuron and  υ r ( · )  is a differentiable time-varying delay satisfying  0 υ r ( s ) υ ^ r 0 < υ ˙ r ( s ) υ ˜ r < 1 , where  υ ^ r  and  υ ˜ r  are separately the supremum values of delay  υ r ( s )  and its derivative.  J q ( · ) : Q Q  is a continuous function and represents the external input of the qth neuron,  s n  represents the impulsive time instant and  N q R  represents the impulsive strength. Suppose  w q ( s )  and  w ˙ q ( s )  are right continuous at  s n , i.e.,  w q ( s n + ) = w q ( s n )  and  w ˙ q ( s n + ) = w ˙ q ( s n ) .
The initial conditions of system (1) are given as
w q ( t ) = q ( t ) , w ˙ q ( t ) = q ( t ) , υ t 0 , q Θ ,
where  ( t ) = ( 1 ( t ) , , m ( t ) ) T , ( t ) = ( 1 ( t ) , , m ( t ) ) T G υ = max r Θ { υ r } .
Taking system (1) as the driving system, the corresponding response system is represented as
θ ¨ q ( s ) = ξ q θ ˙ q ( s ) ς q θ q ( s ) + r Θ z q r h r ( θ r ( s ) ) + r Θ l q r p r ( θ r ( s υ r ( s ) ) ) + J q ( s ) + U q ( s ) , s s n , θ q ( s n + ) = N q θ q ( s n ) , θ ˙ q ( s n + ) = N q θ ˙ q ( s n ) , q Θ , n N + ,
where  θ q ( s ) Q  denotes the state variable of the response model,  U q ( s ) Q  is the external controller, and other parameters are defined in model (1).
The initial conditions of model (3) are given by
θ q ( s ) = ˜ q ( s ) , θ ˙ q ( s ) = ˜ q ( s ) , υ s 0 , q Θ ,
where  ˜ ( s ) = ( ˜ 1 ( s ) , ˜ 2 ( s ) , , ˜ m ( s ) ) T G ˜ ( s ) = ( ˜ 1 ( s ) , ˜ 2 ( s ) , , ˜ m ( s ) ) T G .
Defining  ϑ q ( s ) = θ q ( s ) w q ( s ) , which denotes the synchronization error, then
ϑ ¨ q ( s ) = ξ q ϑ ˙ q ( s ) ς q ϑ q ( s ) + r Θ z q r h ˜ r ( ϑ r ( s ) ) + r Θ l q r p ˜ r ( ϑ r ( s υ r ( s ) ) + U q ( s ) , s s n , ϑ q ( s n + ) = N q ϑ q ( s n ) , ϑ ˙ q ( s n + ) = N q ϑ ˙ q ( s n ) , q Θ , n N + ,
where  h ˜ r ( ϑ r ( s ) ) = h r ( θ r ( s ) ) h r ( w r ( s ) ) p ˜ r ( ϑ r ( s υ r ( s ) ) ) = p r ( θ r ( s υ r ( s ) ) ) p r ( w r ( s υ r ( s ) ) ) .
Assumption 1.
The activation functions  h r ( · ) p r ( · ) : Q Q  with  r Θ  are Lipschitz continuous; that is, there exist positive real numbers  H r > 0 P r > 0  such that for any  θ r , w r Q ,
h r ( θ r ) h r ( w r ) H r θ r w r , p r ( θ r ) p r ( w r ) P r θ r w r .
Assumption 2.
For  q Θ n N + , the impulsive weight of the qth neuron satisfies  1 N q 1 .
Assumption 3.
The impulse time series  { s n , n N + }  is strictly increasing,  lim n s n = +  and  κ = inf n N + { s n s n 1 } > 0 , where  s 0 = 0 .
Definition 1.
Let  w ( s ) = ( w 1 ( s ) , , w m ( s ) ) T θ ( s ) = ( θ 1 ( s ) , , θ m ( s ) ) T  be the solutions of the model (1) and system (3) with any different initial values of  ( s ) ˜ ( s ) ( s ) ˜ ( s ) G , respectively. If  lim s + θ ( s ) w ( s ) = 0 ,  then systems (1) and (3) are used to achieve synchronization.
Lemma 1.
Assume that the time series  { s n }  satisfies Assumption 3, the function  g ( s ) : R + R  is differentiable on each interval  [ s n 1 , s n ) . If  g ˙ ( s )  is uniform bounded for  n N +  and  s 0 + g ( υ ) d υ  is convergent, then  lim s + g ( s ) = 0 .
Proof. 
Note that if  g ˙ ( s )  is uniform bounded for  n N + , then there exists  M > 0  such that for any  s [ s n 1 , s n )  with  n N + , it holds that  | g ˙ ( s ) | M .
For any  ε > 0 , denote  η = min { κ 2 , ε 2 M } . According to the convergence of  s 0 + g ( υ ) d υ , there exists  G > 0  such that for any  s > s > G , one has
| s s g ( υ ) d υ | < η ε 2 .
For any  s > G + η , obviously there exists  n ^ N +  such that  s [ s n ^ 1 , s n ^ ) . Two cases are considered in the following.
If  s + η s n ^ , one has
s n ^ 1 < s n ^ κ s n ^ 2 η s η < s < s n ^ ,
that is,  [ s η , s ] [ s n ^ 1 , s n ^ ) . So,  g ( s )  is continuous on  [ s η , s ]  and differentiable on  ( s η , s )  by means of the differentiability of  g ( s )  on  [ s n ^ 1 , s n ^ ) . For  υ [ s η , s ] , based on Lagrange’s mean value theorem, there exists  ς ( υ , s )  such that  g ( s ) g ( υ ) = g ˙ ( ς ) ( s υ ) . Note that  s > G + η  and  s η > G ; it follows from inequality (6) that
| s η s g ( υ ) d υ | < η ε 2 .
Therefore,
| g ( s ) | = 1 η | s η s g ( s ) d υ | 1 η s η s | g ( s ) g ( υ ) | d υ + 1 η | s η s g ( υ ) d υ | < 1 η s η s | g ˙ ( ς ) ( υ s ) | d υ + ε 2 η M + ε 2 ε .
If  s + η < s n ^ , then
s n ^ 1 s < s + η < s n ^ ,
that is,  [ s , s + η ] [ s n ^ 1 , s n ^ ) . Similarly, there exists  ς ^ ( s , υ )  such that  g ( υ ) g ( s ) = g ˙ ( ς ^ ) ( υ s ) , and it holds that
| g ( s ) | 1 η s s + η | g ( s ) g ( υ ) | d υ + 1 η | s s + η g ( υ ) d υ | < 1 η s s + η | g ˙ ( ς ^ ) ( υ s ) | d υ + ε 2 ε .
In conclusion, for any  ε > 0 , there exists  G ^ G + η , such that  | f ( s ) | < ε  for any  s > G ^ . Hence,  lim s + g ( s ) = 0 . □
Remark 1.
At present, the Barbalat lemma has become an important method to discuss the convergence of nonlinear systems [33,41,48], in which the differentiability of the function over the interval  [ 0 , + )  is required. Evidently, it is not applicable to study impulsive models based on the traditional Barbalat lemma. To try to solve this problem, a generalized version of it is presented in Lemma 1 motivated by the work in [49]. Here, the function is not differentiable at time points  { s n } . The generalized lemma provides a feasible tool to investigate the convergence of discontinuous systems.
Lemma 2
([41]). For any  u , v Q ( u v ) * = v * u * ( u * ) * = u  and  u + u * = 2 u R 2 u .
Lemma 3
([41]). For any  a b c Q ,
| a b c * + c ( a b ) * a R ( b c * + c b * ) | ( | a I | + | a J | + | a K | ) ( b 2 + c 2 ) .
Lemma 4
([41]). The matrix  E = ( e i j ) m × m R m × m  is semi-negative definite, so  W H E W 0  for all  W = ( w 1 , , w m ) T Q m .

3. Synchronization with Constant Gain-Based Control

In this part, a type of control scheme with a constant gain will be developed to discuss the synchronization of models (1) and (3).

3.1. Main Results

The constant gain-based control strategy is designed as
U q ( s ) = η q ϑ q ( s ) ε q ϑ ˙ q ( s ) , q Θ ,
where  η q > 0 ε q > 0  are the control gains.
Theorem 1.
Under Assumptions 1–3 and the control input (9), systems (1) and (3) achieve synchronization if there exist constants  σ q > 0 ϰ q > 0 α q 0  and  β q 0  such that
B q = F q + ϰ q M q M q R q 0 ,
in which
F q = α q β q η q α q β q ς q R + 1 2 | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 β q 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ ( | α r β r | + β r 2 ) l r q 1 υ ˜ q P q + 1 2 r Θ ( | α r β r | + β r 2 ) z r q H q + 1 2 r Θ | α q β q | ( l q r P r + z q r H r ) , R q = α q β q β q 2 ε q β q 2 ξ q R + 1 2 | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 β q 2 ( | ς q I | + | ς q J | + | ς q K | ) + β q 2 2 r Θ ( z q r H r + l q r P r ) , M q = 1 2 σ q + 1 2 α q 2 1 2 α q β q ε q 1 2 β q 2 η q 1 2 α q β q ξ q R 1 2 β q 2 ς q R .
Proof. 
A Lyapunov functional is constructed as
V ( s ) = V 1 ( s ) + V 2 ( s ) + V 3 ( s ) ,
where
V 1 ( s ) = 1 2 q Θ σ q ϑ q ( s ) ( ϑ q ( s ) ) * ,
V 2 ( s ) = 1 2 q Θ r Θ ( | α q β q | + β q 2 ) l q r 1 υ ˜ r P r s υ r ( s ) s ϑ r ( μ ) ( ϑ r ( μ ) ) * d μ .
V 3 ( s ) = 1 2 q Θ ( α q ϑ q ( s ) + β q ϑ ˙ q ( s ) ) ( α q ϑ q ( s ) + β q ϑ ˙ q ( s ) ) * ,
When  s [ s n 1 , s n ) , after calculating the upper right-hand Dini derivative of  V 1 ( s ) , one has
D + V 1 ( s ) = 1 2 q Θ σ q ϑ ˙ q ( s ) ( ϑ q ( s ) ) * + ϑ q ( s ) ( ϑ ˙ q ( s ) ) * .
Similarly, when  s [ s n 1 , s n ) , it follows from the condition  0 < υ ˙ r ( s ) υ ˜ r < 1  that
D + V 2 ( s ) = 1 2 q Θ r Θ ( | α q β q | + β q 2 ) l q r 1 υ r ˜ P r { ϑ r ( s ) ( ϑ r ( s ) ) * ϑ r ( s υ r ( s ) ) ( ϑ r ( s υ r ( s ) ) ) * ( 1 υ ˙ r ( s ) ) } 1 2 q Θ r Θ ( | α r β r | + β r 2 ) l r q 1 υ ˜ q P q ϑ q ( s ) ( ϑ q ( s ) ) * 1 2 q Θ r Θ ( | α q β q | + β q 2 ) l q r P r ϑ r ( s υ r ( s ) ) ( ϑ r ( s υ r ( s ) ) ) * .
When  s [ s n 1 , s n ) , after calculating the upper right-hand Dini derivative of  V 3 ( s )  along with the solution of error system (5), one has
D + V 3 ( s ) = 1 2 q Θ { α q ϑ ˙ q ( s ) + β q ϑ ¨ q ( s ) α q ϑ q ( s ) + β q ϑ ˙ q ( s ) * + α q ϑ q ( s ) + β q ϑ ˙ q ( s ) α q ϑ ˙ q ( s ) + β q ϑ ¨ q ( s ) * } = 1 2 q Θ α q 2 α q β q ε q β q 2 η q ϑ ˙ q ( s ) ( ϑ q ( s ) ) * q Θ α q β q η q ϑ q ( s ) ( ϑ q ( s ) ) * + 1 2 q Θ α q 2 α q β q ε q β q 2 η q ϑ q ( s ) ( ϑ ˙ q ( s ) ) * + q Θ α q β q β q 2 ε q ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * 1 2 q Θ α q β q ξ q ϑ ˙ q ( s ) ( ϑ q ( s ) ) * 1 2 q Θ α q β q ϑ q ( s ) ( ξ q ϑ ˙ q ( s ) ) * 1 2 q Θ α q β q ς q ϑ q ( s ) ( ϑ q ( s ) ) * 1 2 q Θ α q β q ϑ q ( s ) ( ς q ϑ q ( s ) ) * 1 2 q Θ β q 2 ξ q ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * 1 2 q Θ β q 2 ϑ ˙ q ( s ) ( ξ q ϑ ˙ q ( s ) ) * 1 2 q Θ β q 2 ς q ϑ ˙ q ( s ) ( ϑ q ( s ) ) * 1 2 q Θ β q 2 ϑ q ( s ) ( ς q ϑ ˙ q ( s ) ) * + 1 2 q Θ r Θ α q β q z q r h ˜ r ( ϑ r ( s ) ) ( ϑ q ( s ) ) * + 1 2 q Θ r Θ α q β q ϑ q ( s ) z q r h ˜ r ( ϑ r ( s ) ) * + 1 2 q Θ r Θ α q β q l q r p ˜ r ( ϑ r ( s υ r ( s ) ) ) ( ϑ q ( s ) ) * + 1 2 q Θ r Θ α q β q ϑ q ( s ) l q r p ˜ r ( ϑ r ( s υ r ( s ) ) ) * + 1 2 q Θ r Θ β q 2 z q r h ˜ r ( ϑ r ( s ) ) ( ϑ ˙ q ( s ) ) * + 1 2 q Θ r Θ β q 2 ϑ ˙ q ( s ) z q r h ˜ r ( ϑ r ( s ) ) * + 1 2 q Θ r Θ β q 2 l q r p ˜ r ( ϑ r ( s υ r ( s ) ) ) ( ϑ ˙ q ( s ) ) *
+ 1 2 q Θ r Θ β q 2 ϑ ˙ q ( s ) l q r p ˜ r ( ϑ r ( s υ r ( s ) ) ) * .
According to Lemma 2,
1 2 q Θ α q β q ς q ϑ q ( s ) ( ϑ q ( s ) ) * 1 2 q Θ α q β q ϑ q ( s ) ( ς q ϑ q ( s ) ) * = q Θ α q β q ς q R ϑ q ( s ) ( ϑ q ( s ) ) * , 1 2 q Θ β q 2 ξ q ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * 1 2 q Θ β q 2 ϑ ˙ q ( s ) ( ξ q ϑ ˙ q ( s ) ) * = q Θ β q 2 ξ q R ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * .
According to Lemma 3,
1 2 q Θ α q β q ξ q ϑ ˙ q ( s ) ( ϑ q ( s ) ) * 1 2 q Θ α q β q ϑ q ( s ) ( ξ q ϑ ˙ q ( s ) ) * 1 2 q Θ α q β q ξ q R ϑ ˙ q ( s ) ( ϑ q ( s ) ) * + ϑ q ( s ) ( ϑ ˙ q ( s ) ) * + 1 2 q Θ | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * + ϑ q ( s ) ( ϑ q ( s ) ) * , 1 2 q Θ β q 2 ς q ϑ ˙ q ( s ) ( ϑ q ( s ) ) * 1 2 q Θ β q 2 ϑ q ( s ) ( ς q ϑ ˙ q ( s ) ) * 1 2 q Θ β q 2 ς q R ϑ q ( s ) ( ϑ ˙ q ( s ) ) * + ϑ ˙ q ( s ) ( ϑ q ( s ) ) * + 1 2 q Θ β q 2 | ς q I | + | ς q J | + | ς q K | ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * + ϑ q ( s ) ( ϑ q ( s ) ) * .
By using Lemma 2 and Assumption 1,
1 2 q Θ r Θ α q β q z q r h ˜ r ( ϑ r ( s ) ) ( ϑ q ( s ) ) * + ϑ q ( s ) z q r h ˜ r ( ϑ r ( s ) ) * = q Θ r Θ α q β q z q r h ˜ r ( ϑ r ( s ) ) ( ϑ q ( s ) ) * R q Θ r Θ | α q β q | z q r h ˜ r ( ϑ r ( s ) ) ( ϑ q ( s ) ) * q Θ r Θ | α q β q | z q r H r ϑ r ( s ) ( ϑ q ( s ) ) * 1 2 q Θ r Θ | α q β q | z q r H r ϑ r ( s ) ( ϑ r ( s ) ) * + 1 2 q Θ r Θ | α q β q | z q r H r ϑ q ( s ) ( ϑ q ( s ) ) * = 1 2 q Θ r Θ | α r β r | z r q H q + | α q β q | z q r H r ϑ q ( s ) ( ϑ q ( s ) ) * .
Similarly,
1 2 q Θ r Θ β q 2 z q r h ˜ r ( ϑ r ( s ) ) ( ϑ ˙ q ( s ) ) * + ϑ ˙ q ( s ) z q r h ˜ r ( ϑ r ( s ) ) * 1 2 q Θ r Θ β q 2 z q r H r ϑ r ( ϑ r ( s ) ) ( ϑ r ( s ) ) * + 1 2 q Θ r Θ β q 2 z q r H r ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * ,
1 2 q Θ r Θ α q β q l q r p ˜ r ( ϑ r ( s υ r ( s ) ) ( ϑ q ( s ) ) * + ϑ q ( s ) ( l q r p ˜ r ( ϑ r ( s υ r ( s ) ) * 1 2 q Θ r Θ | α q β q | l q r P r ϑ r ( s υ r ( s ) ) ϑ r ( s υ r ( s ) ) * + 1 2 q Θ r Θ | α q β q | l q r P r ϑ q ( s ) ( ϑ q ( s ) ) * ,
1 2 q Θ r Θ β q 2 l q r p ˜ r ( ϑ r ( s υ r ( s ) ) ( ϑ ˙ q ( s ) ) * + ϑ ˙ q ( s ) l q r p ˜ r ( ϑ r ( s υ r ( s ) ) * 1 2 q Θ r Θ β q 2 l q r P r ϑ r ( s υ r ( s ) ) ϑ r ( s υ r ( s ) ) * + 1 2 q Θ r Θ β q 2 l q r P r ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * .
By combining the formulas (11)–(20),
D + V ( s ) 1 2 q Θ σ q + α q 2 α q β q ε q β q 2 η q α q β q ξ q R β q 2 ς q R ϑ ˙ q ( s ) ( ϑ q ( s ) ) * + q Θ { α q β q η q α q β q ς q R + 1 2 | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 β q 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ ( | α r β r | + β r 2 ) l r q P q 1 υ ˜ q + 1 2 r Θ ( | α r β r | + β r 2 ) z r q H q + | α q β q | z q r H r + 1 2 r Θ | α q β q | ( l q r P r ) } ϑ q ( s ) ( ϑ q ( s ) ) * + 1 2 q Θ σ q + α q 2 α q β q ε q β q 2 η q α q β q ξ q R β q 2 ς q R ϑ q ( s ) ( ϑ ˙ q ( s ) ) * + q Θ { α q β q β q 2 ε q β q 2 ξ q R + 1 2 | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 β q 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ β q 2 z q r H r + 1 2 r Θ β q 2 l q r P r } ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * = q Θ ( ϑ q ( s ) , ϑ ˙ q ( s ) ) B q ( ϑ q ( s ) , ϑ ˙ q ( s ) ) H q Θ ϰ q ϑ q ( s ) ( ϑ q ( s ) ) * .
Note that  B q 0 , then for  s [ s n 1 , s n ) , one gets
D + V ( s ) ϰ q Θ ϑ q ( s ) ( ϑ q ( s ) ) * 0 ,
where  ϰ = min q Θ { ϰ q } . Integrating both sides of the inequality (22) from  s n 1 +  to  s n , one has
s n 1 + s n q Θ ϑ q ( s ) ( ϑ q ( s ) ) * 1 ϰ s n 1 + s n D + V ( s ) d s = 1 ϰ [ V ( s n 1 ) V ( s n ) ] ,
and for any  s [ s n 1 , s n ) ,
V ( s n ) V ( s ) V ( s n 1 ) .
In addition, when  s = s n ,
V s n = 1 2 q Θ σ q ϑ q ( s n ) ( ϑ q ( s n ) ) * + 1 2 q Θ ( α q ϑ q ( s n ) + β q ϑ ˙ q ( s n ) ) ( α q ϑ q ( s n ) + β q ϑ ˙ q ( s n ) ) * + 1 2 q Θ r Θ ( | α q β q | + β q 2 ) l q r 1 υ ˜ r P r s n υ r ( s n ) s n ϑ r ( μ ) ( ϑ r ( μ ) ) * d μ 1 2 q Θ σ q N q 2 ϑ q ( s n ) ( ϑ q ( s n ) ) * + 1 2 q Θ ( α q N q ϑ q ( s n ) + β q N q ϑ ˙ q ( s n ) ) ( α q N q ϑ q ( s n ) + β q N q ϑ ˙ q ( s n ) ) * + 1 2 q Θ r Θ ( | α q β q | + β q 2 ) l q r 1 υ ˜ r P r s n υ r ( s n ) s n ϑ r ( μ ) ( ϑ r ( μ ) ) * d μ 1 2 q Θ σ q ϑ q ( s n ) ( ϑ q ( s n ) ) * + 1 2 q Θ ( α q ϑ q ( s n ) + β q ϑ ˙ q ( s n ) ) ( α q ϑ q ( s n ) + β q ϑ ˙ q ( s n ) ) * + 1 2 q Θ r Θ ( | α q β q | + β q 2 ) l q r 1 υ ˜ r P r s n υ r ( s n ) s n ϑ r ( μ ) ( ϑ r ( μ ) ) * d μ = V ( s n ) .
From the inequities (24) and (25), it can be concluded that
V ( s n ) V ( s n ) V ( s n 1 ) V ( s n 1 ) V ( s 0 ) .
Note that for any  s R + , there exists a constant  n ˜ N +  such that  s [ s n ˜ 1 , s n ˜ ) . Then, according to (22),  V ( s ) V ( s n ˜ 1 )  and also  V ( s ) V ( s 0 ) . In addition, according to inequalities (23) and (25),
s 0 s q Θ ϑ q ( μ ) ( ϑ q ( μ ) ) * d μ = s 0 s 1 + s 1 + s 2 + + s n ˜ 1 + s q Θ ϑ q ( μ ) ( ϑ q ( μ ) ) * d μ 1 ϰ [ V ( s 0 ) V ( s 1 ) + V ( s 1 ) V ( s 2 ) + + V ( s n ˜ 1 ) V ( s ) ] 1 ϰ [ V ( s 0 ) V ( s ) ] 1 ϰ V ( s 0 ) ,
which shows that
s 0 + q Θ ϑ q ( μ ) ( ϑ q ( μ ) ) * d μ 1 ϰ V ( s 0 ) .
Furthermore, by the construction of  V ( s ) , for any  s [ s n 1 , s n )  with  n N + ,
q Θ ϑ q ( s ) ( ϑ q ( s ) ) * 2 min q Θ { σ q } V ( s 0 ) ,
and there exists a real constant  M > 0  such that
q Θ ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * M .
According to Lemma 1,
lim s + q Θ ϑ q ( s ) ( ϑ q ( s ) ) * = 0 ,
which implies that system (1) and system (3) realize synchronization under the feedback controller (9). □

3.2. Results for Some Spacial Cases

Particularly, if  υ r ( s ) = υ ˇ r  in models (1) and (3), then
F ^ q = α q β q η q α q β q ς q R + 1 2 | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 β q 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ ( | α r β r | + β r 2 ) l r q P q + 1 2 r Θ ( | α r β r | + β r 2 ) z r q H q + 1 2 r Θ | α q β q | ( l q r P r + z q r H r ) .
Corollary 1.
Under Assumptions 1–3 and the feedback control scheme (9), systems (1) and (3) realize synchronization if there are constants  σ q > 0 ϰ q > 0 α q 0 β q 0 , such that
B ^ q = F ^ q + ϰ q M q M q R q 0 .
Proof. 
Constructing the following Lyapunov functional
V ( s ) = V 1 ( s ) + V 3 ( s ) + 1 2 q Θ r Θ ( | α q β q | + β q 2 ) l q r P r s υ ˇ r s ϑ r ( v ) ( ϑ r ( v ) ) * d v .
Analogously, when  s [ s n 1 , s n ) ,
D + V ( s ) 1 2 q Θ σ q + α q 2 α q β q ε q β q 2 η q α q β q ξ q R β q 2 ς q R ϑ ˙ q ( s ) ( ϑ q ( s ) ) * + q Θ { α q β q η q α q β q ς q R + 1 2 | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 β q 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ ( | α r β r | + β r 2 ) l r q P q + 1 2 r Θ ( | α r β r | + β r 2 ) z r q H q + | α q β q | z q r | H r + 1 2 r Θ | α q β q | ( l q r P r ) } ϑ q ( s ) ( ϑ q ( s ) ) * + 1 2 q Θ σ q + α q 2 α q β q ε q β q 2 η q α q β q ξ q R β q 2 ς q R ϑ q ( s ) ( ϑ ˙ q ( s ) ) * + q Θ { α q β q β q 2 ε q β q 2 ξ q R + 1 2 | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 β q 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ β q 2 z q r H r + 1 2 r Θ β q 2 l q r P r } ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * = q Θ ( ϑ q ( s ) , ϑ ˙ q ( s ) ) B ^ q ( ϑ q ( s ) , ϑ ˙ q ( s ) ) H q Θ ϰ q ϑ q ( s ) ( ϑ q ( s ) ) * .
where  ϰ = min q Θ { ϰ q } . Since  B ^ q 0 , when  s [ s n 1 , s n ) , one gets
D + V ( s ) ϖ q Θ ϑ q ( s ) ( ϑ q ( s ) ) * 0 .
The rest is analogous to that of Theorem 1, which is omitted here. □
In what follows, consider a special case in which both system (1) and system (3) are defined in the real-valued domain. In this case, Assumption 1 is reduced to the following form.
Assumption 4.
The activation functions  h r ( · ) p r ( · ) : R R  are Lipschitz continuous; that is, there exist positive real numbers  H r > 0 P r > 0  such that for any  θ r , w r R ,
| h r ( θ r ) h r ( w r ) | H r | θ r w r | , | p r ( θ r ) p r ( w r ) | P r | θ r w r | .
In addition, denote
F ˇ q = α q β q ( ς q + η q ) + 1 2 r Θ [ | α q β q | ( | z q r | H r + | l q r | P r ) + ( | α r β r | | z r q | + β r 2 | z r q | ) H q + ( | α r β r | + β r 2 ) | l r q | 1 υ ˜ q P q ] , R ˇ q = α q β q β q 2 ( ξ q + ε q ) + 1 2 r Θ β q 2 ( | z q r | H r + | l q r | P r ) , M ˇ q = σ q + α q 2 α q β q ( ξ q + ε q ) β q 2 ( ς q + η q ) .
Theorem 2.
Under Assumptions 2–4 and the controller (9), real-valued systems (1) and (3) are synchronized if there exist a positive constant  σ q  and constants  α q 0 β q 0  such that  R ˇ q < 0 4 R ˇ q F ˇ q > M ˇ q 2 .
Proof. 
A Lyapunov functional is constructed as
V ( s ) = V ^ 1 ( s ) + V ^ 2 ( s ) ,
where
V ^ 1 ( s ) = 1 2 q Θ σ q ϑ q 2 ( s ) + 1 2 q Θ r Θ ( | α q β q | + β q 2 ) | l q r | 1 υ ˜ r P r s υ r ( s ) s ϑ r 2 ( v ) d v ,
V ^ 2 ( s ) = 1 2 q Θ ( α q ϑ q ( s ) + β q ϑ ˙ q ( s ) ) 2 .
When  s [ s n 1 , s n ) , after calculating the upper right-hand Dini derivative of  V ^ 1 ( s ) , one has
D + V ^ 1 ( s ) = q Θ σ q ϑ q ( s ) ϑ ˙ q ( s ) + 1 2 q Θ r Θ ( | α q β q | + β q 2 ) | l q r | 1 υ ˜ r P r ϑ r 2 ( s ) 1 2 q Θ r Θ ( | α q β q | + β q 2 ) | l q r | 1 υ ˜ r P r ϑ r 2 ( s υ r ( s ) ) ( 1 υ ˙ r ( s ) ) q Θ σ q ϑ q ( s ) ϑ ˙ q ( s ) + 1 2 q Θ r Θ ( | α q β q | + β q 2 ) | l q r | 1 υ ˜ r P r ϑ r 2 ( s ) 1 2 q Θ r Θ ( | α q β q | + β q 2 ) | l q r | P r ϑ r 2 ( s υ r ( s ) ) .
In addition, from the error system (5),
D + V ^ 2 ( s ) = q Θ ( α q ϑ q ( s ) + β q ϑ ˙ q ( s ) ) ( α q ϑ ˙ q ( s ) + β q ϑ ¨ q ( s ) ) = q Θ α q β q ( ς q + η q ) ϑ q 2 ( s ) + q Θ ( α q β q β q 2 ( ξ q + ε q ) ) ϑ ˙ q 2 ( s ) + q Θ α q 2 α q β q ( ξ q + ε q ) β q 2 ( ς q + η q ) ϑ q ( s ) ϑ ˙ q ( s ) + q Θ r Θ ( α q β q ϑ q ( s ) + β q 2 ϑ ˙ q ( s ) ) z q r h ˜ r ( ϑ r ( s ) ) + q Θ r Θ ( α q β q ϑ q ( s ) + β q 2 ϑ ˙ q ( s ) ) l q r p ˜ r ( ϑ r ( s υ r ( s ) ) ) .
According to Assumption 4 and the mean-value inequality,
q Θ r Θ α q β q ϑ q ( s ) z q r h ˜ r ( ϑ r ( s ) ) q Θ r Θ | α q β q | | z q r | H r | ϑ q ( s ) | | ϑ r ( s ) | q Θ r Θ | α q β q | | z q r | H r ( 1 2 ϑ q 2 ( s ) + 1 2 ϑ r 2 ( s ) ) = 1 2 q Θ r Θ ( | α q β q | | z q r | H r + | α r β r | | z r q | H p ) ϑ q 2 ( s ) .
By using a similar method,
q Θ r Θ β q 2 ϑ ˙ q ( s ) ) z q r h ˜ r ( ϑ r ( s ) ) q Θ r Θ β q 2 | z q r | H r ( 1 2 ϑ ˙ q 2 ( s ) + 1 2 ϑ r 2 ( s ) ) = 1 2 q Θ r Θ β q 2 | z q r | H r ϑ ˙ q 2 ( s ) + 1 2 q Θ r Θ β r 2 | z r q | H q ϑ q 2 ( s ) ,
q Θ r Θ α q β q ϑ q ( s ) l q r p ˜ r ( ϑ r ( s υ r ( s ) ) q Θ r Θ | α q β q | | l q r | P r ( 1 2 ( ϑ q 2 ( s ) ) + ϑ r 2 ( s υ r ( s ) ) ) = 1 2 q Θ r Θ | α q β q | | l q r | P r ϑ q 2 ( s ) + 1 2 q Θ r Θ | α q β q | | l q r | P r ϑ r 2 ( s υ r ( s ) ) ,
q Θ r Θ β q 2 ϑ ˙ q ( s ) l q r p ˜ r ( ϑ r ( s υ r ( s ) ) q Θ r Θ 1 2 β q 2 | l q r | P r ( ϑ ˙ q 2 ( s ) + ϑ r 2 ( s υ r ( s ) ) ) = 1 2 q Θ r Θ β q 2 | l q r | P r ϑ ˙ q 2 ( s ) + 1 2 q Θ r Θ β q 2 | l q r | P r ϑ r 2 ( s υ r ( s ) ) .
From (30)–(35), we have
D + V ( s ) q Θ { α q β q ( ς q + η q ) + 1 2 r Θ [ | α q β q | ( | z q r | H r + | l q r | P r ) + ( | α r β r | | z r q | + β r 2 | z r q | ) H q + ( α r β r | + β r 2 ) | l r q | P q 1 υ ˜ q ] } ϑ q 2 ( s ) + q Θ ( σ q + α q 2 α q β q ( ξ q + ε q ) β q 2 ( ς q + η q ) ) ϑ q ( s ) ϑ ˙ q ( s ) + q Θ α q β q β q 2 ( ξ q + ε q ) + 1 2 r Θ β q 2 ( | z q r | H r + | l q r | P r ) ϑ ˙ q 2 ( s ) = q Θ R ˇ q ϑ ˙ q 2 ( s ) + q Θ M ˇ q ϑ ˙ q ( s ) ϑ q ( s ) + q Θ F ˇ q ϑ q 2 ( s ) = q Θ R ˇ q ϑ ˙ q ( s ) + M ˇ q 2 R ˇ q ϑ q ( s ) 2 + q Θ ( F ˇ q M ˇ q 2 4 R ˇ q ) ϑ q 2 ( s ) ,
where  ˜ = min q Θ { M ˇ q 2 4 R ˇ q F ˇ q } , and thus it can be seen that  ˜ > 0 . So, when  s [ s n 1 , s n ) ,
D + V ( s ) ˜ q Θ ϑ q 2 ( s ) 0 .
The rest is analogous to that of Theorem 1. □

4. Synchronization with Adaptive Gain-Based Control

In what follows, a quaternion-variable adaptive control protocol is designed to realize synchronization of the addressed systems (1) and (3).

4.1. Main Results

The quaternion-variable adaptive control strategy is depicted as
U q ( s ) = η q ( s ) ϑ q ( s ) ε q ( s ) ϑ ˙ q ( s ) , η ˙ q ( s ) = ζ q ( ϑ q ( s ) ( ϑ q ( s ) ) * + ( ϑ q ( s ) ( ϑ ˙ q ( s ) ) * ) R ) , ε ˙ q ( s ) = o q ( ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * + ( ϑ q ( s ) ( ϑ ˙ q ( s ) ) * ) R ) ,
where  q Θ ζ q > 0 o q > 0 .
Theorem 3.
Based on Assumptions 1–3 and the adaptive controller (38), system (1) and system (3) achieve synchronization.
Proof. 
The Lyapunov functional is constructed as
V ( s ) = V 1 ( s ) + V 2 ( s ) + V 3 ( s ) + V 4 ( s ) ,
where
V 4 ( s ) = 1 2 q Θ | α q β q | ζ q ( η ¯ q η q ( s ) ) 2 + 1 2 q Θ | α q β q | o q ( ε ¯ q ε q ( s ) ) 2 ,
where  η ¯ q ε ¯ q α q β q  are undetermined parameters.
It follows from the adaptive scheme (38) that
D + V 4 ( s ) = q Θ | α q β q | ( η ¯ q η q ( s ) ) ( ϑ q ( s ) ( ϑ q ( s ) ) * + ( ϑ q ( s ) ( ϑ ˙ q ( s ) ) * ) R ) q Θ | α q β q | ( ε ¯ q ε q ( s ) ) ( ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * + ( ϑ q ( s ) ( ϑ ˙ q ( s ) ) * ) R ) .
Similar to the derivation of the formula (21), and combined with formula (39), one has
D + V ( s ) 1 2 q Θ σ q + α q 2 α q β q ε q ( s ) β q 2 η q ( s ) α q β q ξ q R β q 2 ς q R ϑ ˙ q ( s ) ( ϑ q ( s ) ) * + q Θ { α q β q η q ( s ) α q β q ς q R + 1 2 | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 β q 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ ( | α r β r | + β r 2 ) l r q P q 1 υ ˜ q + 1 2 r Θ ( | α r β r | + β r 2 ) z r q H q + | α q β q | z q r H r + 1 2 r Θ | α q β q | ( l q r P r ) } ϑ q ( s ) ( ϑ q ( s ) ) * + 1 2 q Θ σ q + α q 2 α q β q ε q ( s ) β q 2 η q ( s ) α q β q ξ q R β q 2 ς q R ϑ q ( s ) ( ϑ ˙ q ( s ) ) * + q Θ { α q β q β q 2 ε q ( s ) β q 2 ξ q R + 1 2 | α q β q | ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 β q 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ β q 2 z q r H r + 1 2 r Θ β q 2 l q r P r } ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * q Θ | α q β q | ( η ¯ q η q ( s ) ) ( ϑ q ( s ) ( ϑ q ( s ) ) * + ( ϑ q ( s ) ( ϑ ˙ q ( s ) ) * ) R ) q Θ | α q β q | ( ε ¯ q ε q ( s ) ) ( ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * + ( ϑ q ( s ) ( ϑ ˙ q ( s ) ) * ) R ) .
Set  α q = β q > 0 . Then,
D + V ( s ) 1 2 q Θ σ q + α q 2 α q 2 ε ¯ q α q 2 η ¯ q α q 2 ξ q R α q 2 ς q R ϑ ˙ q ( s ) ( ϑ q ( s ) ) * + q Θ { α q 2 η ¯ q α q 2 ς q R + 1 2 α q 2 ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 α q 2 ( | ς q I | + | ς q J | + | ς q K | ) + r Θ α r 2 l r q 1 υ ˜ q P q + r Θ α r 2 z r q H q + 1 2 r Θ α q 2 ( l q r P r + z q r H r ) } ϑ q ( s ) ( ϑ q ( s ) ) * + 1 2 q Θ σ q + α q 2 α q 2 ε ¯ q α q 2 η ¯ q α q 2 ξ q R α q 2 ς q R ϑ q ( s ) ( ϑ ˙ q ( s ) ) * + q Θ { α q 2 α q 2 ε ¯ q α q 2 ξ q R + 1 2 α q 2 ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 α q 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ α q 2 ( z q r H r + l q r P r ) } ϑ ˙ q ( s ) ( ϑ ˙ q ( s ) ) * .
For  q Θ , let
η ¯ q = ς q R + 1 2 ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 ( | ς q I | + | ς q J | + | ς q K | ) + r Θ α r 2 α q 2 l r q 1 υ ˜ q P q + r Θ α r 2 α q 2 z r q H q + 1 2 r Θ ( l q r P r + z q r H r ) + 1 α q 2 , ε ¯ q = 1 ξ q R + 1 2 ( | ξ q I | + | ξ q J | + | ξ q K | ) + 1 2 ( | ς q I | + | ς q J | + | ς q K | ) + 1 2 r Θ ( z q r H r + l q r P r ) , σ q = α q 2 ( ε ¯ q + η ¯ q + ξ q R + ς q R 1 ) .
Evidently,  σ q > 0 , and for  s [ s n 1 , s n ) , one has
D + V ( s ) q Θ ϑ q ( s ) ( ϑ q ( s ) ) * .
By using a similar analysis to Theorem 1, it can be obtained that
lim s + q Θ ϑ q ( s ) ( ϑ q ( s ) ) * = 0 .
Hence, system (1) and system (3) are synchronized under the adaptive controller (38). □

4.2. Results for Some Special Cases

Similar to Corollary 1 and Theorem 2, the following results can be obtained from Theorem 3.
Corollary 2.
Based on Assumptions 1–3 and the adaptive controller (38), systems (1) and (3) with  υ r ( s ) = υ ˇ r  are synchronized.
Theorem 4.
Under Assumptions 2–4 and the adaptive controller (38), the real-valued systems (1) and (3) are synchronized.
Proof. 
The Lyapunov functional is constructed as
V ( s ) = V ^ 1 ( s ) + V ^ 2 ( s ) + V ^ 3 ( s ) ,
Here,
V ^ 3 ( s ) = 1 2 q Θ | α q β q | ζ q ( η ¯ q η q ( s ) ) 2 + 1 2 q Θ | α q β q | o q ( ε ¯ q ε q ( s ) ) 2 ,
where  η ¯ q ε ¯ q α q β q  are undetermined parameters.
Similar to the derivation of the Formula (36), when  s [ s n 1 , s n ) ,
D + V ( s ) q Θ { α q β q ( ς q + η q ( s ) ) + 1 2 r Θ [ | α q β q | ( | z q r | H r + | l q r | P r ) + ( | α r β r | | z r q | + β r 2 | z r q | ) H q + ( α r β r | + β r 2 ) | l r q | P q 1 υ ˜ q ] } ϑ q 2 ( s ) + q Θ ( σ q + α q 2 α q β q ( ξ q + ε q ( s ) ) β q 2 ( ς q + η q ( s ) ) ) ϑ q ( s ) ϑ ˙ q ( s ) + q Θ α q β q β q 2 ( ξ q + ε q ( s ) ) + 1 2 r Θ β q 2 ( | z q r | H r + | l q r | P r ) ϑ ˙ q 2 ( s ) q Θ | α q β q | ( η ¯ q η q ( s ) ) ( ϑ q 2 ( s ) + ϑ q ( s ) ϑ ˙ q ( s ) ) q Θ | α q β q | ( ε ¯ q ε q ( s ) ) ( ϑ ˙ q 2 ( s ) + ϑ ˙ q ( s ) ϑ q ( s ) ) .
Set  α q = β q . Then, when  s [ s n 1 , s n ) ,
D + V ( s ) q Θ { α q 2 ( ς q + η ¯ q ) + 1 2 r Θ [ α q 2 ( | z q r | H r + | l q r | P r ) + 2 α r 2 | z r q | H q + 2 α r 2 | l r q | P q 1 υ ˜ q ] } ϑ q 2 ( s ) + q Θ ( σ q + α q 2 α q 2 ( ξ q + ε ¯ q ) α q 2 ( ς q + η ¯ q ) ) ϑ q ( s ) ϑ ˙ q ( s ) + q Θ α q 2 1 ( ξ q + ε ¯ q ) + 1 2 r Θ ( | z q r | H r + | l q r | P r ) ϑ ˙ q 2 ( s ) .
Set
η ¯ q = ς q + 1 2 r Θ | z q r | H r + | l q r | P r + 2 ( α r α q ) 2 | z r q | H q + | l r q | P q 1 υ ˜ q + 1 α q 2 , ε ¯ q = 1 ξ q + 1 2 r Θ ( | z q r | H r + | l q r | P r ) , σ q = ( ξ q + ς q + ε ¯ q + η ¯ q 1 ) α q 2 .
It can be concluded that for  s [ s n 1 , s n ) ,
D + V ( s ) q Θ ϑ q 2 ( s ) .
The rest is analogous to that of Theorem 1. □
Remark 2.
In [17,21,22,23], the synchronization of QV-NNs has been discussed, in which the models of QV-NNs were rewritten as real-valued or complex-valued submodels via the separation method, and then each submodel was controlled to achieve synchronization. Different from the analysis method of separation before control, two types of quaternion-valued control schemes are directly proposed for the response QV-NNs in this article, and convergence analysis is achieved without using the separation technique.
Remark 3.
In this paper, a direct analysis method is developed to discuss the synchronization of QV-INNs without using the previous reduced-order transformation proposed in [31,32]. In particular, some Lyapunov functionals, composed of the state variables and their derivatives, are directly constructed for the QV-INNs and some synchronization conditions represented by matrix inequalities are obtained based on the quaternion theory and Lemma 1.
Remark 4.
In this paper, if the impulsive strength  N q = 1 , then the impulse is invalid and the obtained results here can be used to determine the synchronization of continuous QV-INNs. Particularly, Theorem 1 in this paper is consistent with the conclusion of Theorem 2 in [41] when  N q = 1  and  α q = β q = η q 2 ; Theorem 2 in [33] is consistent with Theorem 2 in this paper if  N q = 1  and  υ ( s ) = υ ˇ  and  J q ( s ) = J q . Hence, our results can be regarded as some generalizations of previous synchronization results given in [33,41].

5. Numerical Simulation

A numerical example is used in this section to verify the obtained results by means of Matlab R2014b (The MathWorks, Inc., Natick, MA, USA).
Consider the drive model (1) and the response system (3), where  Θ = { 1 , 2 } ξ 1 = 3.8 2.8 i 3.5 j 3.5 k ξ 2 = 2.5 3.5 i 3.5 j 2.8 k ς 1 = 1.5 3.8 i 4.8 j 2.5 k ς 2 = 2.8 2.8 i 2.5 j 2.5 k J 1 ( s ) = J 2 ( s ) = 0 , N 1 = N 2 = 0.55 h 1 ( e ) = h 2 ( e ) = tanh ( e R ) + i sin ( e I ) + j tanh ( e J ) + k sin ( e K ) p 1 ( e ) = p 2 ( e ) = tanh ( e R ) + i tanh ( e I ) + j sin ( e J ) + k tanh ( e K ) ,
Z = ( z q r ) 2 × 2 = 1.85 + 1.5 i + 2.2 j + 5.2 k 2.6 + 2.8 i + 2 j + 1.2 k 1.25 + 1.5 i + j + 1.5 k 1.95 + 2.9 i + 1.4 j + 1.5 k ,
L = ( l q r ) 2 × 2 = 2.5 + 1.5 i + 2.6 j + 2.6 k 1.8 + 2.5 i + 2.6 j + 2.5 k 0.9 + 0.8 i + 2.6 j + 0.8 k 2.8 + 1.8 i + 3.8 j + 2.8 k .
The dynamic evolution of the drive model (1) is given in Figure 1, Figure 2, Figure 3 and Figure 4, in which the initial values  1 ( t ) = 1 1 i 2.2 j 0.2 k , 1 ( t ) = 0.5 1.3 i 0.2 j 0.1 k 2 ( t ) = 0.3 0.4 i + 0.8 j 0.25 k , 2 ( t ) = 0.39 0.2 i + 0.75 j 0.5 k  for  t [ 1 , 0 ] .
Firstly, the synchronization between systems (1) and (3) is verified based on the control protocol (9). By simple calculation,  P 1 = P 2 = H 1 = H 2 = 1 υ = 1 υ ˜ 1 = υ ˜ 2 = 0.25 . Set  α 1 = 1.85 , α 2 = 4.75 β 1 = β 2 = 1 , and  σ 1 = 0.3 , σ 2 = 8 ; then, by using the LMI toolbox in Matlab software,  B q < 0  when  η 1 = 95.319 η 2 = 32.0226 ε 1 = 40.2984  and  ε 2 = 5.8706 . So, by Theorem 1, systems (1) and (3) realize synchronization, which is revealed in Figure 5.
Next, adaptive synchronization will be verified. Choose  α 1 = 1.85 , α 2 = 4.75 β 1 = β 2 = 1 σ 1 = 0.3 , σ 2 = 8  and  η 1 ( 0 ) = η 2 ( 0 ) = ε 1 ( 0 ) = ε 2 ( 0 ) = 0 . By Theorem 3, systems (1) and (3) achieve adaptive synchronization via the adaptive control law (38), which is demonstrated by Figure 6 and Figure 7.

6. Conclusions

The synchronization problem of quaternion-valued delayed neural networks with impulse and inertia was studied in this paper. In all, a direct analysis method was developed to ensure synchronization, which is mainly reflected in two aspects. First of all, the control design is straightforward; that is, a kind of linear control scheme and its adaptive form were directly designed in the quaternion domain for the response quaternion-valued inertial systems, which are distinct from the control schemes for the reduced-order systems of inertial neural networks in [31,32] and the control strategies for subsystems obtained by separation used in [17,21,22,23]. Secondly, a convergence analysis is performed directly, that is, without separating the quaternion-valued systems into real-valued systems or transforming the inertial networks into first-order models, and some Lyapunov functionals are constructed directly based on the quaternion-valued error states and their derivatives to analyze the synchronization. In addition to developing a direct analysis technique, a generalization result of the Barbalat lemma is derived in Lemma 1. Here, the function is not necessarily differentiable everywhere; it provides a feasible method to investigate the stability of discontinuous models.
In addition to asymptotic synchronization, the fixed-time synchronization of INNs is also a hot issue at present [35,47,50]. However, there seems to be only a few reports on the fixed-time synchronization of QV-INNs with impulses based on the direct analysis approach. Moreover, as indicated in [10,27], the stochastic feature is universal in diverse fields including ecology, engineering and electrical systems, so it would be valuable to investigate the synchronization of stochastic QV-INNs with impulses. These interesting problems will be explored in a future study.

Author Contributions

Methodology, K.X. and C.H.; software, K.X.; validation, C.H.; formal analysis, J.Y.; writing—original draft, J.Y.; writing—review & editing, C.H.; supervision, C.H.; funding acquisition, C.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (Grant Nos. 62263029 and 62373317), the Tianshan Talent Training Program (2022TSYCCX0013), the Key Project of Natural Science Foundation of Xinjiang (2021D01D10), Basic Research Foundation for Universities of Xinjiang (XJEDU2023P023) and the Intelligent Control and Optimization Research Platform at Xinjiang University.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Suissa, O.; Elmalech, A.; Zhitomirsky-Geffet, M. Text analysis using deep neural networks in digital humanities and information science. J. Assoc. Inf. Sci. Technol. 2022, 73, 268–287. [Google Scholar] [CrossRef]
  2. Shanmugam, L.; Mani, P.; Rajan, R.; Joo, Y. Adaptive synchronization of reaction-diffusion neural networks and its application to secure communication. IEEE Trans. Cybern. 2020, 50, 911–922. [Google Scholar] [CrossRef]
  3. Ullah, W.; Ullah, A.; Hussain, T.; Muhammad, K.; Heidari, A.; Ser, J.; Baik, S.; Albuquerque, V. Artificial intelligence of things-assisted two-stream neural network for anomaly detection in surveillance big video data. Future Gener. Comput. Syst. 2022, 129, 286–297. [Google Scholar] [CrossRef]
  4. Bill, J.; Champagne, L.; Cox, B.; Bihl, T. Meta-heuristic optimization methods for quaternion-valued neural networks. Mathematics 2021, 9, 938. [Google Scholar] [CrossRef]
  5. Zou, C.; Kou, K.; Wang, Y. Quaternion collaborative and sparse representation with application to color face recognition. IEEE Trans. Image Process. 2016, 25, 3287–3302. [Google Scholar] [CrossRef] [PubMed]
  6. Took, C.; Strba, G.; Aihara, K.; Mandic, D. Quaternion-valued short-term joint forecasting of three-dimensional wind and atmospheric parameters. Renew. Energy 2011, 36, 1754–1760. [Google Scholar] [CrossRef]
  7. Lin, Y.; Ling, B.; Hu, L.; Zheng, Y.; Xu, N.; Zhou, X.; Wang, X. Hyperspectral image enhancement by two dimensional quaternion valued singular spectrum analysis for object recognition. Remote Sens. 2021, 13, 405. [Google Scholar] [CrossRef]
  8. Wei, W.; Hu, C.; Yu, J.; Jiang, H. Fixed/preassinged-time synchronization of quaternion-valued neural networks involving delays and discontinuous activations: A direct approach. Acta Math. Sci. 2023, 43, 1439–1461. [Google Scholar] [CrossRef]
  9. Song, Q.; Yang, L.; Liu, Y.; Alsaadi, F. Stability of quaternion-valued neutral-type neural networks with leakage delay and proportional delays. Neurocomputing 2023, 521, 191–198. [Google Scholar] [CrossRef]
  10. Sathiyaraj, T.; Fečkan, M.; Wang, J. Synchronization of: Fractional Stochastic Chaotic Systems via Mittag–Leffler Function. Fractal Fract. 2022, 6, 192. [Google Scholar] [CrossRef]
  11. Zhang, T.; Jian, J. Quantized intermittent control tactics for exponential synchronization of quaternion-valued memristive delayed neural networks. ISA Trans. 2022, 126, 288–299. [Google Scholar] [CrossRef]
  12. Li, R.; Cao, J.; Xue, C.; Manivannan, R. Quasi-stability and quasi-synchronization control of quaternion-valued fractional-order discrete-time memristive neural networks. Appl. Math. Comput. 2021, 395, 125851. [Google Scholar] [CrossRef]
  13. Pu, H.; Li, F.; Wang, Q.; Li, P. Preassigned-time projective synchronization of delayed fully quaternion-valued discontinuous neural networks with parameter uncertainties. Neural Netw. 2023, 165, 740–754. [Google Scholar] [CrossRef] [PubMed]
  14. Peng, T.; Zhong, J.; Tu, Z.; Lu, J.; Lou, J. Finite-time synchronization of quaternion-valued neural networks with delays: A switching control method without decomposition. Neural Netw. 2022, 148, 37–47. [Google Scholar] [CrossRef] [PubMed]
  15. Wei, R.; Cao, J. Synchronization control of quaternion-valued memristive neural networks with and without event-triggered scheme. Cogn. Neurodyn. 2019, 13, 489–502. [Google Scholar] [CrossRef] [PubMed]
  16. Guo, J.; Shi, Y.; Luo, W.; Cheng, Y.; Wang, S. Adaptive global synchronization for a class of quaternion-valued cohen-grossberg neural networks with known or unknown parameters. Mathematics 2023, 11, 3553. [Google Scholar] [CrossRef]
  17. Zhang, Y.; Yang, L.; Kou, K.; Liu, Y. Fixed-time synchronization for quaternion-valued memristor-based neural networks with mixed delays. Neural Netw. 2023, 165, 274–289. [Google Scholar] [CrossRef] [PubMed]
  18. Wang, P.; Li, X.; Wang, N.; Li, Y.; Shi, K.; Lu, J. Almost periodic synchronization of quaternion-valued fuzzy cellular neural networks with leakage delays. Fuzzy Setsand Syst. 2022, 426, 46–65. [Google Scholar] [CrossRef]
  19. Mao, X.; Wang, X.; Qin, H. Stability analysis of quaternion-valued BAM neural networks fractional-order model with impulses and proportional delays. Neurocomputing 2022, 509, 206–220. [Google Scholar] [CrossRef]
  20. Shu, J.; Xiong, L.; Wu, T.; Liu, Z. Stability analysis of quaternion-valued neutral-type neural networks with time-varying delay. Mathematics 2019, 7, 101. [Google Scholar] [CrossRef]
  21. Wei, W.; Yu, J.; Wang, L.; Hu, C.; Jiang, H. Fixed/Preassigned-time synchronization of quaternion-valued neural networks via pure power-law control. Neural Netw. 2022, 146, 341–349. [Google Scholar] [CrossRef]
  22. Deng, H.; Bao, H. Fixed-time synchronization of quaternion-valued neural networks. Phys. A Stat. Mech. Its Appl. 2019, 527, 121351. [Google Scholar] [CrossRef]
  23. Qi, X.; Bao, H.; Cao, J. Synchronization criteria for quaternion-valued coupled neural networks with impulses. Neural Netw. 2020, 128, 150–157. [Google Scholar] [CrossRef] [PubMed]
  24. Li, R.; Gao, X.; Cao, J. Quasi-state estimation and quasi-synchronization control of quaternion-valued fractional-order fuzzy memristive neural networks: Vector ordering approach. Appl. Math. Comput. 2019, 362, 124572. [Google Scholar] [CrossRef]
  25. Peng, T.; Lu, J.; Xiong, J.; Tu, Z.; Liu, Y.; Lou, J. Fixed-time synchronization of quaternion-valued neural networks with impulsive effects: A non-decomposition method. Commun. Nonlinear Sci. Numer. Simul. 2024, 132, 107865. [Google Scholar] [CrossRef]
  26. Babcock, K.; Westervelt, R. Stability and dynamics of simple electronic neural networks with added inertia. Phys. D Nonlinear Phenom. 1986, 23, 464–469. [Google Scholar] [CrossRef]
  27. Dhayal, R.; Malik, M.; Abbas, S.; Debbouche, A. Optimal controls for second-order stochastic differential equations driven by mixed-fractional Brownian motion with impulses. Math. Methods Appl. Sci. 2020, 43, 4107–4124. [Google Scholar] [CrossRef]
  28. Chang, S.; Wang, Y.; Zhang, X.; Wang, X. A new method to study global exponential stability of inertial neural networks with multiple time-varying transmission delays. Math. Comput. Simul. 2023, 211, 329–340. [Google Scholar] [CrossRef]
  29. Duan, L.; Li, J. Global exponential bipartite synchronization for neutral memristive inertial coupling mixed time-varying delays neural networks with antagonistic interactions. Commun. Nonlinear Sci. Numer. Simul. 2023, 119, 107071. [Google Scholar] [CrossRef]
  30. Yao, Y.; Zhang, G.; Li, Y. Fixed/Preassigned-time stabilization for complex-valued inertial neural networks with distributed delays: A non-separation approach. Mathematics 2023, 11, 2275. [Google Scholar] [CrossRef]
  31. Li, Q.; Zhou, L. Global asymptotic synchronization of inertial memristive Cohen–Grossberg neural networks with proportional delays. Commun. Nonlinear Sci. Numer. Simul. 2023, 123, 107295. [Google Scholar] [CrossRef]
  32. Yao, W.; Wang, C.; Sun, Y.; Gong, S.; Lin, H. Event-triggered control for robust exponential synchronization of inertial memristive neural networks under parameter disturbance. Neural Netw. 2023, 164, 67–80. [Google Scholar] [CrossRef]
  33. Li, X.; Li, X.; Hu, C. Some new results on stability and synchronization for delayed inertial neural networks based on non-reduced order method. Neural Netw. 2017, 96, 91–100. [Google Scholar] [CrossRef]
  34. Chen, S.; Jiang, H.; Hu, C.; Li, L. Cluster synchronization for directed coupled inertial reaction-diffusion neural networks with nonidentical nodes via non-reduced order method. J. Frankl. Inst. 2023, 360, 3208–3240. [Google Scholar] [CrossRef]
  35. Han, J.; Chen, G.; Wang, L.; Zhang, G.; Hu, J. Direct approach on fixed-time stabilization and projective synchronization of inertial neural networks with mixed delays. Neurocomputing 2023, 535, 97–106. [Google Scholar] [CrossRef]
  36. Wang, J.; Tian, Y.; Hua, L.; Shi, K.; Zhong, S.; Wen, S. New results on finite-time synchronization control of chaotic memristor-based inertial neural networks with time-varying delays. Mathematics 2023, 11, 684. [Google Scholar] [CrossRef]
  37. Shanmugasundaram, S.; Kashkynbayev, A.; Udhayakumar, K.; Rakkiyappan, R. Centralized and decentralized controller design for synchronization of coupled delayed inertial neural networks via reduced and non-reduced orders. Neurocomputing 2022, 469, 91–104. [Google Scholar] [CrossRef]
  38. Shi, J.; Zeng, Z. Global exponential stabilization and lag synchronization control of inertial neural networks with time delays. Neural Netw. 2020, 126, 11–20. [Google Scholar] [CrossRef] [PubMed]
  39. Wei, R.; Cao, J.; Abdel-Aty, M. Fixed-time synchronization of second-order MNNs in quaternion field. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 3587–3598. [Google Scholar] [CrossRef]
  40. Zhang, Z.; Wang, S.; Wang, X.; Wang, Z.; Lin, C. Event-triggered synchronization for delayed quaternion-valued inertial fuzzy neural networks via non-reduced order approach. IEEE Trans. Fuzzy Syst. 2023, 31, 3000–3014. [Google Scholar] [CrossRef]
  41. Xiong, K.; Hu, C.; Yu, J. Direct approach-based synchronization of fully quaternion-valued neural networks with inertial term and time-varying delay. Chaos Solitons Fractals 2023, 172, 113556. [Google Scholar] [CrossRef]
  42. Yang, Y.; Cao, J. Stability and periodicity in delayed cellular neural networks with impulsive effects. Nonlinear Anal. Real World Appl. 2007, 8, 362–374. [Google Scholar] [CrossRef]
  43. Vivek, S.; Vijayakumar, V. An analysis on the approximate controllability of neutral functional hemivariational inequalities with impulses. Optimization 2023. [Google Scholar] [CrossRef]
  44. Zhang, Y.; Zhou, L. Stabilization and lag synchronization of proportional delayed impulsive complex-valued inertial neural networks. Neurocomputing 2022, 507, 428–440. [Google Scholar] [CrossRef]
  45. Lin, D.; Chen, X.; Yu, G.; Li, Z.; Xia, Y. Global exponential synchronization via nonlinear feedback control for delayed inertial memristor-based quaternion-valued neural networks with impulses. Appl. Math. Comput. 2021, 401, 126093. [Google Scholar] [CrossRef]
  46. Wei, X.; Zhang, Z.; Lin, C.; Chen, J. Synchronization and anti-synchronization for complex-valued inertial neural networks with time-varying delays. Appl. Math. Comput. 2021, 403, 126194. [Google Scholar] [CrossRef]
  47. Long, C.; Zhang, G.; Hu, J. Fixed-time synchronization for delayed inertial complex-valued neural networks. Appl. Math. Comput. 2021, 405, 126272. [Google Scholar] [CrossRef]
  48. Popov, V. Hyperstability of Control Systems; Springer: New York, NY, USA, 1973. [Google Scholar]
  49. Jiang, H. Hybrid adaptive and impulsive synchronisation of uncertain complex dynamical networks by the generalised Barbalat’s lemma. IET Control Theory Appl. 2009, 3, 1330–1340. [Google Scholar] [CrossRef]
  50. Wei, F.; Chen, G.; Zeng, Z.; Gunasekaran, N. Finite/fixed-time synchronization of inertial memristive neuralnetworks by interval matrix method for secure communication. Neural Netw. 2023, 167, 168–182. [Google Scholar] [CrossRef]
Figure 1. Dynamic evolution of  w 1 R ( s )  and  w 2 R ( s ) .
Figure 1. Dynamic evolution of  w 1 R ( s )  and  w 2 R ( s ) .
Mathematics 12 00949 g001
Figure 2. Dynamic evolution of  w 1 I ( s )  and  w 2 I ( s ) .
Figure 2. Dynamic evolution of  w 1 I ( s )  and  w 2 I ( s ) .
Mathematics 12 00949 g002
Figure 3. Dynamic evolution of  w 1 J ( s )  and  w 2 J ( s ) .
Figure 3. Dynamic evolution of  w 1 J ( s )  and  w 2 J ( s ) .
Mathematics 12 00949 g003
Figure 4. Dynamic evolution of  w 1 K ( s )  and  w 2 K ( s ) .
Figure 4. Dynamic evolution of  w 1 K ( s )  and  w 2 K ( s ) .
Mathematics 12 00949 g004
Figure 5. The evolution of synchronization errors  ϑ q ( s ) .
Figure 5. The evolution of synchronization errors  ϑ q ( s ) .
Mathematics 12 00949 g005
Figure 6. The evolution of synchronization errors  ϑ q ( s ) .
Figure 6. The evolution of synchronization errors  ϑ q ( s ) .
Mathematics 12 00949 g006
Figure 7. The evolution of control gains  η q ( s )  and  ε q ( s ) .
Figure 7. The evolution of control gains  η q ( s )  and  ε q ( s ) .
Mathematics 12 00949 g007
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yu, J.; Xiong, K.; Hu, C. Synchronization Analysis for Quaternion-Valued Delayed Neural Networks with Impulse and Inertia via a Direct Technique. Mathematics 2024, 12, 949. https://doi.org/10.3390/math12070949

AMA Style

Yu J, Xiong K, Hu C. Synchronization Analysis for Quaternion-Valued Delayed Neural Networks with Impulse and Inertia via a Direct Technique. Mathematics. 2024; 12(7):949. https://doi.org/10.3390/math12070949

Chicago/Turabian Style

Yu, Juan, Kailong Xiong, and Cheng Hu. 2024. "Synchronization Analysis for Quaternion-Valued Delayed Neural Networks with Impulse and Inertia via a Direct Technique" Mathematics 12, no. 7: 949. https://doi.org/10.3390/math12070949

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop