Next Article in Journal
Causality in Scalar-Einstein Waves
Previous Article in Journal
New Results for the Investigation of the Asymptotic Behavior of Solutions of Nonlinear Perturbed Differential Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Nonseparation Approach to General-Decay Synchronization of Quaternion-Valued Neural Networks with Mixed Time Delays

College of Mathematics and System Sciences, Xinjiang University, Urumqi 830017, China
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(9), 842; https://doi.org/10.3390/axioms12090842
Submission received: 25 June 2023 / Revised: 19 August 2023 / Accepted: 22 August 2023 / Published: 30 August 2023

Abstract

:
In this paper, the general-decay synchronization issue of a class of quaternion-valued neural networks with mixed time delays is investigated. Firstly, unlike some previous works where the quaternion-valued model is separated into four real-valued networks or two complex-valued networks, we consider the mixed-delayed quaternion-valued neural network model as a whole and introduce a novel nonlinear feedback controller for the corresponding response system. Then, by introducing a suitable Lyapunov–Krasovskii functional and employing a novel inequality technique, some easily verifiable sufficient conditions are obtained to ensure the general-decay synchronization for the considered drive-response networks. Finally, the feasibility of the established theoretical results is verified by carrying out Matlab numerical simulations.

1. Introduction

Synchronization, as an important dynamic characteristic of neural networks (NNs), has been widely studied by scholars during the past three decades. Roughly speaking, synchronization is the realization of the same dynamic behavior between two or more dynamical systems through mutual coupling or external forces [1,2,3]. Also it has been found that the synchronization is a widespread phenomenon in nature and manmade systems, such as the synchronous glow of fireflies, the homophony of various instruments in an orchestra, and the relative stationarity of communication satellites and the Earth in space. Both from theoretical and application aspect, various types of synchronization have been introduced and extensively studied in recent decades. For example, finite-time synchronization [4], fixed-time synchronization [5,6], exponential synchronization [7], asymptotic synchronization [8], partial synchronization [9] and multiclustering [10].
It is inevitable to encounter time delay in the implementation of NNs, which will lead to some unexpected dynamic behavior. For example, in hardware implementation of NNs, time delay usually leads to bad characteristics such as oscillation, instability, divergence and chaos. In theoretically, time delay is usually divided into two categories: discrete time delay and distributed time delay. So the synchronization and stability of NNs with delays, especially those with both discrete and distributed time delays have been studied extensively [11,12,13].
In the study of synchronization, estimating the convergence rate of synchronization error approaching to zero solution is an interesting and meaningful task. However, in some cases, the convergence rate of synchronization is very difficult to evaluate or it can not be obtained by traditional means of stability concept. Therefore some scholars tried to solve this challenging issue by introducing new concept of stability, such as general decay stability, which provides a wider convergence rate compared to asymptotic stability and exponential stability. In [14], the authors studied the general decay synchronization of delayed NNs with mismatched coefficients by designing a hybrid switching controller which composed of linear and nonlinear terms. In [15], the authors considered the general decay synchronization issue of chaotic NNs with discontinuous activation functions. After that general decay stability and synchronization of various types of nonlinear systems have been studied, and some interesting results were established [16,17,18,19]. Ref. [16] investigated general decay synchronization of a class of chaotic NNs with general activation functions via improving the controllers of [14,15]. The authors in [17] investigated the general decay synchronization and H synchronization issue of multi-weighted coupled NNs with reaction-diffusion terms. The general decay stability of inverse Euler-Maruyama method for nonlinear stochastic integral-differential equations was investigated in [18]. The authors in [19] studied the general decay stability analysis of impulsive NNs with mixed time delays.
It’s worth nothing that all of the above results are obtained for real-valued or complex-valued NNs. However, in practical applications, some data need to be processed are usually high-dimensional, and the correlation within the data may be lost when using real-valued or complex-valued NNs to process these multidimensional data. It is well known that quaternion-valued systems can effectively handle multi-dimensional data and can improve computational efficiency and accuracy. Therefore, its applications such as 3D rotation, pose estimation, signal processing and multimodal data fusion have received extensive attention from many researchers [20,21]. In recent years, scholars introduced quaternion-valued numbers into NNs to construct quaternion-valued neural netwoks (QVNNs). Due to the non-exchangeability of quaternion-valued numbers, the methods used to deal with the synchronization of real-valued or complex-valued NNs cannot be directly extended to synchronization study of QVNNs. Thus, most of the existing research results on the stability and synchronization of QVNNs are based on the quaternion-valued decomposition method, which equivalently decomposes the QVNN into two complex-valued NNs or four real-valued NNs [22,23,24,25]. For example, ref. [22] analyzed the stability of continuous time and discrete-time quaternion NNs with linear threshold neurons by decomposition method. By using the same method, in [23], the authors considered the global μ -stability of QVNNs with non-differentiable time-varying delays. Again, in [24,25], the authors analyzed the global exponential stability and μ -stability of quaternion-valued recursive NNs with time-varying delays respectively by using decomposition method. Because the decomposition method is complex and computationally heavy, it brings great inconvenience to theoretical analysis and practical application. Up to now, there are few results on the synchronization of QVNNs which not uses the decomposition approach. Therefore, it is an interesting and challenging task to study the general decay synchronization QVNNs by direct analysis method.
Inspired by the above analysis, this paper tries the cope the general decay synchronization issue of QVNNs with mixed delays. The main contribution of of this paper are as follows:
1. In this paper, the problem of general decay synchronization of QVNNs with mixed delays is discussed by using the concept of ψ type function.
2. By designing a new nonlinear feedback controller, some sufficient conditions for general decay synchronization of QVNNs with mixed delays is obtained. The classical exponential synchronization, polynomial synchronization and logarithmic synchronization can be seen as the special forms of general decay synchronization.
3. In this paper, nonseperation method is used to analyse the synchronization performance of QVNNs, which is more natural and compact than the decomposition method.
The rest of the article is structured as follows. Section 2 provides the system model and some preliminary knowledge. In Section 3, the sufficient conditions for determining general decay synchronization of QVNNs are given. Section 4 carries on the numerical simulations using Matlab 2020A (Appendix A).

2. Preliminaries

In order to enhance the readability of this paper, some definitions and symbols are briefly described. A quaternion-valued number is a hypercomplex number with one real part and three imaginary parts denoted as i , j , and k. A quaternion-valued z can be denoted as
z = z ( r ) + z ( i ) i + z ( j ) j + z ( k ) k ,
where z ( r ) , z ( i ) , z ( j ) , z ( k ) R , i , j , k satisfies the H a m i l t o n rule, i.e.,
i 2 = j 2 = k 2 = ijk = 1 , ij = ji = k , jk = kj = i , ki = ik = j .
For a quaternion-valued number z, z ¯ denotes the conjugate of z, and it is defined as z ¯ = z ( r ) z ( i ) i z ( j ) j z ( k ) k . The modulus of z is denoted as | z |
| z | = z z ¯ = z ( r ) 2 + z ( i ) 2 + z ( j ) 2 + z ( k ) 2 .
For z = ( z 1 , z 2 , , z n ) T Q n , z = ( i = 1 n | z i | 2 ) 1 / 2 is the norm of z.
In this paper, the following QVNN model with time delays is considered:
z ˙ i ( t ) = c i z i ( t ) + j = 1 n a i j f j ( z j ( t ) ) + j = 1 n b i j f j ( z j ( t τ i j ( t ) ) ) + j = 1 n d i j t σ i j ( t ) t f j ( z j ( s ) ) d s + I i ,
where i , j J { 1 , 2 , , n } , n 2 represents the number of neurons in the NN; z i ( t ) Q represents the state variables of the ith neurons at time t; c i > 0 is the passive decay rate of the ith neuron; a i j Q , b i j Q , and d i j Q represent the connection strength, discrete delayed connection strength, and distributed delayed connection strength between neurons j and i, respectively; f j ( z j ( t ) ) Q is a neuron activation function; τ i j ( t ) represents the discrete delay of the ith neuron along the axon of the j neuron and satisfies 0 τ i j ( t ) τ i j ; σ i j ( t ) represents the distributed delay and satisfies 0 σ i j ( t ) σ i j ; and I i Q corresponds to the external input on neuron i.
The initial condition of the drive system (1) is
z i ( s ) = φ i ( s ) , s [ τ , 0 ] , i J ,
where τ = max 1 i , j n { τ i j , σ i j } , φ ( s ) = ( φ 1 ( s ) , , φ n ( s ) ) T M = C ( [ τ , 0 ] , Q n ) , M represents the set of all continuous functions from [ τ , 0 ] to Q n .
The response system of the drive system (1) is expressed as follows:
r ˙ i ( t ) = c i r i ( t ) + j = 1 n a i j f j ( r j ( t ) ) + j = 1 n b i j f j ( r j ( t τ i j ( t ) ) ) + j = 1 n d i j t σ i j ( t ) t f j ( r j ( s ) ) d s + I i + u i ( t ) ,
where i J ; r i Q represents the state variable of the responding system; u i ( t ) is the controller that needs to be designed; and the other parameters are defined in the drive system (1).
The initial value of the drive system (2) is expressed as
r i ( s ) = ϕ i ( s ) , s [ τ , 0 ] , i J ,
where ϕ ( s ) = ( ϕ 1 ( s ) , , ϕ n ( s ) ) T M .
Let ω i ( t ) = r i ( t ) z i ( t ) be the corresponding synchronization error. Then, we have the following error system
ω ˙ i ( t ) = c i ω i ( t ) + j = 1 n a i j f ˜ j ( ω j ( t ) ) + j = 1 n b i j f ˜ j ( ω j ( t τ i j ( t ) ) ) + j = 1 n d i j t σ i j ( t ) t f ˜ j ( ω j ( s ) ) d s + u i ( t ) ,
where f ˜ j ( ω j ( t ) ) = f j ( ω j ( t ) + z j ( t ) ) f j ( z j ( t ) ) and f ˜ j ( ω j ( t τ i j ( t ) ) ) = f j ( ω j ( t τ i j ( t ) ) + z j ( t τ i j ( t ) ) ) f j ( z j ( t τ i j ( t ) ) ) .
We need the following assumptions in later study.
Assumption 1.
There exists a positive real number L j such that the activation function f j ( · ) satisfies the following inequality
| f j ( r j ( t ) ) f j ( z j ( t ) ) | L j | r j ( t ) z j ( t ) | .
Assumption 2.
τ i j ( t ) and σ i j ( t ) are differentiable, and there are real numbers 0 κ i j < 1 and 0 υ i j 0.5 such that
τ ˙ i j ( t ) κ i j , σ ˙ i j ( t ) υ i j .
Definition 1
([16]). The function Ψ: R + [ 1 , + ) is called the Ψ-function if it satisfies the following four conditions:
(1) Ψ is non-decreasing and differentiable;
(2) Ψ ( 0 ) = 1 and Ψ ( + ) = + ;
(3) Ψ ˜ ( t ) = Ψ ˙ ( t ) / Ψ ( t ) 0 and Ψ * = sup t 0 Ψ ˜ ( t ) < + ;
(4) For any t, s 0 , Ψ ( t + s ) Ψ ( t ) Ψ ( s ) .
Definition 2
([16]). If there is a constant ε > 0 , such that
lim sup t + log ω ( t ) log Ψ ( t ) ε ,
then the error system (3) can be general decay stable with the convergence rate of ε > 0 .
Assumption 3
([16]). For the functions Ψ and Ψ ˜ given in Definition 1, there exists a positive function ϱ C ( R , R + ) and a real number θ > 0 such that
Ψ ˜ ( t ) 1 , sup t [ 0 , + ) 0 t Ψ θ ( s ) ϱ ( s ) d s < + , t 0 .
Lemma 1
([16]). Suppose that the Assumption 3 hold true, and real-valued function υ ( t ) R n satisfies υ ˙ ( t ) = H ( t , υ t ) , where υ t ( s ) = υ ( t + s ) for s [ τ , 0 ] , where H ( t , υ t ) is a locally bounded function. If there exist a differential functional V ( · , υ t ) : R + × R n R + , and positive scalers χ 1 , χ 2 such that for any ( t , υ t ) R + × R n
( χ 1 υ ( t ) ) 2 V ( t , υ t ) ,
d V ( t , υ t ) d t θ V ( t , υ t ) + χ 2 ϱ ( t ) ,
where θ > 0 and ϱ ( t ) are introduced in above Assumption 3. Then υ ( t ) will be decay stable in the sense of Definition 2, and its convergence rate of approaching zero is θ / 2 .
Lemma 2
([26]). For any x , y Q , the following equation holds:
x + y ¯ = x ¯ + y ¯ , x y ¯ = y ¯ x ¯ .
Lemma 3
([26]). For any x , y Q , ε R is the normal number, then y x + x ¯ y ¯ ε x ¯ x + 1 ε y y ¯ .

3. Analysis Process

In this section, we will derive some sufficient criteria for general decay synchronization of (1) and (2) for driver-response systems. First the controller u i ( t ) is designed as follows:
u i ( t ) = η i ω ( t ) 2 ω i ( t ) ω ( t ) 2 + ϱ ( t ) ,
where η i is positive control gain and satisfies:
2 c i + η i j = 1 n ε j i 1 L i 2 + 1 ε i j 1 a i j a i j ¯ + 1 ε i j 2 b i j b i j ¯ + 1 ε i j 3 d i j d i j ¯ + ζ j i 1 κ j i + ζ j i τ j i + 2 π j i σ j i + 1 2 π j i σ j i 2 > 0 .
Theorem 1.
Suppose that the basic Assumptions 1–3 hold true. If the control gain η i satisfies inequality (8), then the systems (1) and (2) realize general decay synchronization via the nonlinear feedback controller (7).
Proof. 
Construct the following type Lyapunov-Krasovskii functional:
V ( t ) = i = 1 n ω i ( t ) ¯ ω i ( t ) + i = 1 n j = 1 n ζ i j 1 κ i j t τ i j ( t ) t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n ζ i j τ i j 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s + 2 i = 1 n j = 1 n π i j σ i j ( t ) 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s + i = 1 n j = 1 n π i j σ i j 0 ϵ 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s d ϵ ,
where ζ i j and π i j are positive real numbers. Therefore, it is not difficult to find that there exists a positive scalar γ > 1 such that
i = 1 n ω i ( t ) ¯ ω i ( t ) V ( t ) γ i = 1 n ω i ( t ) ¯ ω i ( t ) + γ h ( i = 1 n j = 1 n ζ i j t τ i j t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n π i j σ i j t t + s 0 ω j ( ς ) ¯ ω j ( ς ) d ς d s ) ,
where h = min i J { h i } and
h i 2 c i + η i j = 1 n ε j i 1 L i 2 + 1 ε i j 1 a i j a i j ¯ + 1 ε i j 2 b i j b i j ¯ + 1 ε i j 3 d i j d i j ¯ + ζ j i 1 κ j i + ζ j i τ j i + 2 π j i σ j i + 1 2 π j i σ j i 2 .
Calculate the time derivative of V ( t ) yields
V ˙ ( t ) = i = 1 n ω ˙ i ( t ) ¯ ω i ( t ) + i = 1 n ω i ( t ) ¯ ω ˙ i ( t ) + i = 1 n j = 1 n ζ i j 1 κ i j ω j ( t ) ¯ ω j ( t ) ( 1 τ ˙ i j ( t ) ) ω j ( t τ i j ( t ) ) ¯ ω j ( t τ i j ( t ) ) + i = 1 n j = 1 n ζ i j τ i j ω j ( t ) ¯ ω j ( t ) t τ i j t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n 2 π i j σ i j ( t ) ω j ( t ) ¯ ω j ( t ) ( 1 σ ˙ i j ( t ) ) t σ i j ( t ) t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n π i j 1 2 σ i j 2 ω j ( t ) ¯ ω j ( t ) σ i j 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s = i = 1 n ( c i ω i ( t ) ¯ + j = 1 n a i j f ˜ j ( ω j ( t ) ) ¯ + j = 1 n b i j f ˜ j ( ω j ( t τ i j ( t ) ) ) ¯ + j = 1 n d i j t σ i j ( t ) t f ˜ j ( ω j ( s ) ) d s ¯ + u i ( t ) ¯ ) ω i ( t ) + i = 1 n ω i ( t ) ¯ ( c i ω i ( t ) + j = 1 n a i j f ˜ j ( ω j ( t ) ) + j = 1 n b i j f ˜ j ( ω j ( t τ i j ( t ) ) ) + j = 1 n d i j t σ i j ( t ) t f ˜ j ( ω j ( s ) ) d s + u i ( t ) ) + i = 1 n j = 1 n ζ i j 1 κ i j ω j ( t ) ¯ ω j ( t ) ( 1 τ ˙ i j ( t ) ) ω j ( t τ i j ( t ) ) ¯ ω j ( t τ i j ( t ) ) + i = 1 n j = 1 n ζ i j τ i j ω j ( t ) ¯ ω j ( t ) t τ i j t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n 2 π i j σ i j ( t ) ω j ( t ) ¯ ω j ( t ) ( 1 σ ˙ i j ( t ) ) t σ i j ( t ) t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n π i j 1 2 σ i j 2 ω j ( t ) ¯ ω j ( t ) σ i j 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s
According to the Assumption 1, it follows from Lemma 3 that
f ˜ j ( ω j ( t ) ) ¯ a i j ¯ ω i ( t ) + ω i ( t ) ¯ a i j f ˜ j ( ω j ( t ) ) ε i j 1 f ˜ j ( ω j ( t ) ) ¯ f ˜ j ( ω j ( t ) ) + 1 ε i j 1 ω i ( t ) ¯ a i j a i j ¯ ω i ( t ) ε i j 1 L j 2 ω j ( t ) ¯ ω j ( t ) + 1 ε i j 1 ω i ( t ) ¯ a i j a i j ¯ ω i ( t ) ,
f ˜ j ( ω j ( t τ i j ( t ) ) ) ¯ b i j ¯ ω i ( t ) + ω i ( t ) ¯ b i j f ˜ j ( ω j ( t τ i j ( t ) ) ) ε i j 2 f ˜ j ( ω j ( t τ i j ( t ) ) ) ¯ f ˜ j ( ω j ( t τ i j ( t ) ) ) + 1 ε i j 2 ω i ( t ) ¯ b i j b i j ¯ ω i ( t ) ε i j 2 L j 2 ω j ( t τ i j ( t ) ) ¯ ω j ( t τ i j ( t ) ) + 1 ε i j 2 ω i ( t ) ¯ b i j b i j ¯ ω i ( t ) ,
t σ i j ( t ) t f ˜ j ( ω j ( s ) ) d s ¯ d i j ¯ ω i ( t ) + ω i ( t ) ¯ d i j t σ i j ( t ) t f ˜ j ( ω j ( s ) ) d s = t σ i j ( t ) t f ˜ j ( ω j ( s ) ) d i j ¯ ω i ( t ) + ω i ( t ) ¯ d i j f ˜ j ( ω j ( s ) ) d s ε i j 3 t σ i j ( t ) t f ˜ j ( ω j ( t ) ) ¯ f ˜ j ( ω j ( t ) ) d s + σ i j ( t ) ε i j 3 ω i ( t ) ¯ d i j d i j ¯ ω i ( t ) L j 2 ε i j 3 t σ i j ( t ) t ω j ( s ) ¯ ω j ( s ) d s + σ i j ε i j 3 ω i ( t ) ¯ d i j d i j ¯ ω i ( t ) ,
i = 1 n u i ( t ) ¯ ω i ( t ) + ω i ( t ) ¯ u i ( t ) = i = 1 n η i ω ( t ) 2 ω ( t ) 2 + ϱ ( t ) ω i ( t ) ¯ ω i ( t ) + ω i ( t ) ¯ ω i ( t ) = i = 1 n 2 η i ω ( t ) 2 ω ( t ) 2 + ϱ ( t ) ω i ( t ) ω i ( t ) ¯ + 2 i = 1 n η i ω i ( t ) ω i ( t ) ¯ 2 i = 1 n η i ω i ( t ) ω i ( t ) ¯ = i = 1 n 2 η i ϱ ( t ) ω ( t ) 2 + ϱ ( t ) ω i ( t ) ω i ( t ) ¯ 2 i = 1 n η i ω i ( t ) ω i ( t ) ¯ 2 max 1 i n { η i } ϱ ( t ) ω ( t ) 2 ω ( t ) 2 + ϱ ( t ) 2 i = 1 n η i ω i ( t ) ω i ( t ) ¯ 2 max 1 i n { η i } ϱ ( t ) 2 i = 1 n η i ω i ( t ) ω i ( t ) ¯ ,
where ε i j 1 , ε i j 2 and ε i j 3 are the positive numbers.
Based on the inequality (11)–(12), the following relation can be obtained:
V ˙ ( t ) i = 1 n 2 c i ω i ( t ) ¯ ω i ( t ) + i = 1 n j = 1 n ε i j 1 L j 2 ω j ( t ) ¯ ω j ( t ) + i = 1 n j = 1 n 1 ε i j 1 ω i ( t ) ¯ a i j a i j ¯ ω i ( t ) + i = 1 n j = 1 n ε i j 2 L j 2 ω j ( t τ i j ( t ) ) ¯ ω j ( t τ i j ( t ) ) + i = 1 n j = 1 n 1 ε i j 2 ω i ( t ) ¯ b i j b i j ¯ ω i ( t ) + i = 1 n j = 1 n L j 2 ε i j 3 t σ i j ( t ) t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n 1 ε i j 3 ω i ( t ) ¯ d i j d i j ¯ ω i ( t ) + 2 max 1 i n { η i } ϱ ( t ) 2 i = 1 n η i ω i ( t ) ω i ( t ) ¯ + i = 1 n j = 1 n ζ i j 1 κ i j ω j ( t ) ¯ ω j ( t ) i = 1 n j = 1 n ζ i j 1 κ i j ( 1 τ ˙ i j ( t ) ) ω j ( t τ i j ( t ) ) ¯ ω j ( t τ i j ( t ) ) + i = 1 n j = 1 n ζ i j τ i j ω j ( t ) ¯ ω j ( t ) i = 1 n j = 1 n ζ i j t τ i j t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n 2 π i j σ i j ω j ( t ) ¯ ω j ( t ) i = 1 n j = 1 n 2 π i j ( 1 σ ˙ i j ( t ) ) t σ i j ( t ) t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n π i j 1 2 σ i j 2 ω j ( t ) ¯ ω j ( t ) i = 1 n j = 1 n π i j σ i j 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s .
According to the assumption 2, the inequality (14) can be further written as:
V ˙ ( t ) ( 2 c i η i + j = 1 n ( ε j i 1 L i 2 + 1 ε i j 1 a i j a i j ¯ + 1 ε i j 2 b i j b i j ¯ + 1 ε i j 3 d i j d i j ¯ + ζ j i 1 κ j i + ζ j i τ j i + 2 π j i σ j i + 1 2 π j i σ j i 2 ) ) ω i ( t ) ¯ ω i ( t ) + 2 max 1 i n { η i } ϱ ( t ) + i = 1 n j = 1 n ε i j 2 L j 2 ω j ( t τ i j ( t ) ) ¯ ω j ( t τ i j ( t ) ) + i = 1 n j = 1 n ε i j 3 L j 2 t σ i j ( t ) t ω j ( s ) ¯ ω j ( s ) d s i = 1 n j = 1 n ζ i j ω j ( t τ i j ( t ) ) ¯ ω j ( t τ i j ( t ) ) i = 1 n j = 1 n ζ i j t τ i j t ω j ( s ) ¯ ω j ( s ) d s i = 1 n j = 1 n π i j t σ i j ( t ) t ω j ( s ) ¯ ω j ( s ) d s i = 1 n j = 1 n π i j σ i j 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s h i ω i ( t ) ¯ ω i ( t ) + 2 max 1 i n { η i } ϱ ( t ) i = 1 n j = 1 n ζ i j t τ i j t ω j ( s ) ¯ ω j ( s ) d s i = 1 n j = 1 n π i j σ i j 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s h i ω i ( t ) ¯ ω i ( t ) + η ϱ ( t ) i = 1 n j = 1 n ζ i j t τ i j t ω j ( s ) ¯ ω j ( s ) d s i = 1 n j = 1 n π i j σ i j 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s ,
where η = 2 max 1 i n { η i } > 0 and we take ζ i j and π i j as ζ i j = ε i j 2 L j 2 and π i j = ε i j 3 L j 2 , respectively.
Taking a small enough α such that α γ < d and using the inequality (10) and (15) one get
V ˙ ( t ) + α V ( t ) i = 1 n h i ω i ( t ) ¯ ω i ( t ) + η ϱ ( t ) i = 1 n j = 1 n ζ i j t τ i j t ω j ( s ) ¯ ω j ( s ) d s i = 1 n j = 1 n π i j σ i j t t + s t ω j ( s ) ¯ ω j ( s ) d s d ς + α [ γ i = 1 n ω i ( t ) ¯ ω i ( t ) + γ h ( i = 1 n j = 1 n ζ i j t τ i j t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n π i j σ i j 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s ) ] α γ h i = 1 n ω i ( t ) ¯ ω i ( t ) + α γ h 1 ( i = 1 n j = 1 n ζ i j t τ i j t ω j ( s ) ¯ ω j ( s ) d s + i = 1 n j = 1 n π i j σ i j 0 t + s t ω j ( ς ) ¯ ω j ( ς ) d ς d s ) + η ϱ ( t ) η ϱ ( t ) .
That is
V ˙ ( t ) + α V ( t ) η ϱ ( t ) .
Therefore, from Lemma 1, the drive-response systems (1) and (2) achieve general decay synchronization under nonlinear feedback controller (7). The convergence rate of ω ( t ) to zero is α / 2 . The certificate is completed.    □
Remark 1.
As we can see from the Lyapunov-Krasovskii functional (9) and proof of the theorem 1, the first term of (9) is used to achieve the asymptotic stability of the error system (3) while the second and third terms are designed to counteract the discrete time delay, and the fourth and fifth terms are designed to counteract the distributed time delay.
If system (1) has no distributed time delay, then system (1) degenerates into the following form:
z ˙ i ( t ) = c i z i ( t ) + j = 1 n a i j f j ( z j ( t ) ) + j = 1 n b i j f j ( z j ( t τ i j ( t ) ) ) + I i .
The corresponding response system of drive system (17) is given as follows:
r ˙ i ( t ) = c i r i ( t ) + j = 1 n a i j f j ( r j ( t ) ) + j = 1 n b i j f j ( r j ( t τ i j ( t ) ) ) + I i + u i ( t ) .
In this case, the following Corollary can be obtained from Theorem 1.
Corollary 1.
Under the Assumptions 1–3, if the control gain η i satisfies the following inequality,
2 c i + η i j = 1 n ε j i 1 L i 2 + 1 ε i j 1 a i j a i j ¯ + 1 ε i j 2 b i j b i j ¯ + ζ j i 1 κ j i + ζ j i τ j i > 0 .
Then the drive-response systems (17) and (18) realize general decay synchronization via nonlinear feedback controller (7).
Remark 2.
In works [22,23,24,25], the stability and synchronization of QVNNs are studied by decomposing the original model into two complex-valued NNs or four real-valued NNs. Although the decomposition method is feasible, it evidently increases the dimension of the system under consideration and brings extra the amount of computation. Inspired from the recent work [26,27,28], this paper directly discusses the general decay synchronization of QVNNs, which is more natural and compact than decompressing QVNNs into two complex-valued NNs or four real-valued NNs.
Remark 3.
This paper focuses on the general decay synchronization of QVNNs with time delay. In [22], the stability of continuous QVNNs and discrete QVNNs is considered. In [24,25], the global μ-stability of QVNNs with unbounded delays is discussed. In [29], the boundedness and periodicity of discrete QVNNs with time delays are studied. In [26], the dissipative degree of QVNN is studied. However, as far as we know, there are few results on general decay synchronization of QVNNs with discrete and distributed time delays. Therefore, the research results of this paper are innovative and contribute to the further research of general decay synchronization of NNs.
Remark 4.
From Definition 1 and 2, it is clear that exponential synchronization and polynomial synchronization can be seen as the special forms of general decay synchronization, and the corresponding synchronization can be obtained by choosing the proper Ψ ( t ) functions as Ψ ( t ) = r β t , Ψ ( t ) = ( 1 + t ) β , thus the driving-response systems (1) and (2) realize exponential synchronization and polynomial synchronization respectively. From this aspect, the results of this paper are more general and have a better applicability.

4. Numerical Examples and Simulations

Example 1.
For  n = 2 , consider the following quaternion-valued NN system with time-varying delays
z ˙ i ( t ) = c i z i ( t ) + j = 1 2 a i j f j ( z j ( t ) ) + j = 1 2 b i j f j ( z j ( t τ i j ( t ) ) ) + I i ,
where  f 1 ( u ) = f 2 ( u ) = t a n h ( u ) . The parameters of system (20) are taken as  c 1 = 1.2 + 1 i + 1 j + 1.2 k ,  c 2 = 1.1 + 1 i + 1 j + 1.2 k ,  a 11 = 1.3 + 1.8 i + 1.2 j + 1.1 k ,  a 12 = 1 + 1.5 i + 1.5 j 0.12 k , a 21 = 2.1 + 0.1 i 0.9 j 4.8 k , a 22 = 1.6 + 1.8 i 1.7 j + 2.2 k , b 11 = 0.6 + 1.4 i + 0.8 j + 1.5 k , b 12 = 1.3 + 1.1 i + 1.9 j + 2 k , b 21 = 1.7 + 0.1 i + 2.5 j + 3 k , b 22 = 3.2 + 1.4 i + 2.1 j + 2.5 k , τ i j ( t ) = e t / ( 1 + e t ) , and I i = 0 for i = 1 , 2 .
The initial conditions of the primary system (20) are given as z 1 ( s ) = 1.2 0.5 i + 0.9 j 0.2 k and z 2 ( s ) = 0.7 + 0.2 i 0.8 j + 0.3 k to s [ 1 , 0 ] . Its corresponding Matlab simulation is shown in Figure 1 and Figure 2. We can see that the drive system (20) has a chaotic attractor.
The corresponding response system can be expressed as
r ˙ i ( t ) = c i r i ( t ) + j = 1 2 a i j f j ( r j ( t ) ) + j = 1 2 b i j f j ( r j ( t τ i j ( t ) ) ) + I i + u i ( t ) ,
where c i , a i j , b i j and I i are the same as in system (20). The nonlinear feedback controller u i ( t ) is designed as follows
u i ( t ) = η i ω ( t ) 2 ω i ( t ) ω ( t ) 2 + ϱ ( t ) , i = 1 , 2 .
where ω i ( t ) = r i ( t ) z i ( t ) . By simple computation, we can obtain that L j = 1 , τ i j = 1 . Therefore, Assumptions 1 and 2 are satisfied. Let ϱ ( t ) = e 8.8 t , ψ ( t ) = e t , and choosing ξ 1 = 1 , ξ 2 = 2 , η 1 = 1 and η 2 = 2 . Then all the conditions of Theorem 1 are satisfied, and thus the general decay synchronization between system (20) and system (21) is guaranteed. The time evolution of the synchronization error of the drive-response systems (20) and (21) is provided in Figure 3. The initial conditions of system (21) are taken as z 1 ( s ) = ( 1.2 0.5 i + 0.9 j 0.2 k ) + 0.2 h and z 2 ( s ) = ( 0.7 + 0.2 i 0.8 j + 0.3 k ) + 0.2 h for h = { 6 , 4 , 2 , 0 , 2 , 4 } and s [ 1 , 0 ] . The synchronization curves between systems (20) and (21) are given in Figure 4.

5. Conclusions

This paper focuses on the general-decay synchronization of QVNNs with discrete and distributed time delays. The general-decay synchronization property of QVNNs is directly analyzed without decomposing the QVNN into two complex-valued or four real-valued neural networks. By introducing the appropriate Lyapunov functional and designing a new nonlinear feedback controller, some sufficient conditions for the system to achieve general decay synchronization are established. Also, the feasibility of the obtained results is verified using one numerical example.

Author Contributions

X.H.: writing, methodology, and visualization. A.A.: visualization, review, editing, and funding acquisition. J.Y.: review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Basic Research Program of Tianshan Talent Plan of Xinjiang, China (Grant no. 2022TSYCJU0005), the National Natural Science Foundation of China (Grant no. 62266042), and the Outstanding Youth Program of Xinjiang, China (Grant no. 2022D01E10).

Data Availability Statement

There is no data associated with this paper.

Conflicts of Interest

The authors declare that they have no competing interest regarding the publication of this article.

Appendix A

We write the following MATLAB program, which is divided into two .m files, i.e., quaternionchaos1.m and quaternionsyn2.m. Finally, we can obtain the simulation results. The details are as follows:
Listing A1. quaternionchaos1.m.
Axioms 12 00842 i001
Axioms 12 00842 i002
Axioms 12 00842 i003
Listing A2. quaternionsyn2.m.
Axioms 12 00842 i004
Axioms 12 00842 i005
Axioms 12 00842 i006
Axioms 12 00842 i007

References

  1. Kazemy, A.; Cao, J. Consecutive synchronization of a delayed complex dynamical network via distributed adaptive control approach. Int. J. Control Autom. Syst. 2018, 16, 2656–2664. [Google Scholar]
  2. Wu, A.L.; Wen, S.P.; Zeng, Z.G. Synchronization control of a class of memristor-based recurrent neural networks. Inf. Sci. 2012, 183, 106–116. [Google Scholar] [CrossRef]
  3. Feki, M. An adaptive chaos synchronization scheme applied to secure communication. Chaos Solitons Fractals 2003, 18, 141–148. [Google Scholar] [CrossRef]
  4. Yang, Z.; Zhang, Z. Finite-time synchronization analysis for BAM neural networks with time-varying delays by applying the maximum-value approach with new inequalities. Mathematics 2022, 10, 835. [Google Scholar] [CrossRef]
  5. Liu, M.; Lu, B.; Li, Z.; Jiang, H.; Hu, C. Fixed-time synchronization control of delayed dynamical. Entropy 2021, 23, 1610. [Google Scholar] [CrossRef]
  6. Abdurahman, A.; Abudusaimaiti, M.; Jiang, H. Fixed/predefined-time lag synchronization of complex-valued BAM neural networks with stochastic perturbations. Appl. Math. Comput. 2023, 444, 127811. [Google Scholar] [CrossRef]
  7. Hui, M.; Yan, J.; Zhang, J.; Iu, H.H.C.; Yao, R.; Bai, L. Exponential synchronization of inertial neural network with mixed delays via intermittent pinning control. Int. J. Robust Nonlinear Control 2022, 32, 358–372. [Google Scholar] [CrossRef]
  8. Zhang, Z. New sufficient conditions on global asymptotic synchronization of inertial delayed neural networks by using integrating inequality techniques. Nonlinear Dyn. 2019, 95, 897–904. [Google Scholar] [CrossRef]
  9. Pogromsky, A.; Santoboni, G.; Nijmeijer, H. Partial synchronization: From symmetry towards stability. Physica D 2002, 172, 65–87. [Google Scholar] [CrossRef]
  10. Feketa, P.; Schaum, A.; Meurer, T. Synchronization and multicluster capabilities of oscillatory networks with adaptive coupling. IEEE Trans. Autom. Control 2020, 66, 3084–3096. [Google Scholar] [CrossRef]
  11. Wang, Z.; Liu, Y.; Li, M.; Liu, X. Stability analysis for stochastic Cohen-Grossberg neural networks with mixed time delays. IEEE Trans. Neural Netw. 2006, 17, 814–820. [Google Scholar] [CrossRef]
  12. Zhu, Q.; Cao, J. Exponential stability of stochastic neural networks with both markovian jump parameters and mixed time delays. IEEE Trans. Cybern. 2011, 41, 341–353. [Google Scholar]
  13. Han, J.; Chen, G.; Hu, J. New results on anti-synchronization in predefined-time for a class of fuzzy inertial neural networks with mixed time delays. Neurocomputing 2022, 495, 26–36. [Google Scholar] [CrossRef]
  14. Wang, L.; Shen, Y.; Zhang, G. Synchronization of a class of switched neural networks with time-varying delays via nonlinear feedback control. IEEE Trans. Cybern. 2016, 46, 2300–2310. [Google Scholar] [CrossRef] [PubMed]
  15. Wang, L.; Shen, Y.; Zhang, G. General decay synchronization stability for a class of delayed chaotic neural networks with discontinuous activations. Neurocomputing 2016, 179, 169–175. [Google Scholar] [CrossRef]
  16. Abdurahman, A. New results on the general decay synchronization of delayed neural networks with general activation functions. Neurocomputing 2018, 275, 2505–2511. [Google Scholar] [CrossRef]
  17. Lu, J.; Huang, Y.; Ren, S. General decay synchronization and H synchronization of multi-weighted coupled reaction-diffusion neural networks. Int. J. Control Autom. Syst. 2020, 18, 1250–1263. [Google Scholar] [CrossRef]
  18. Liu, L.; Deng, F.; Qu, B.; Fang, J. General Decay Stability of Backward Euler–Maruyama Method for Nonlinear Stochastic Integro-Differential Equations. Appl. Math. Lett. 2023, 135, 108406. [Google Scholar] [CrossRef]
  19. Tojtovska, B.; Janković, S. General decay stability analysis of impulsive neural networks with mixed time delays. Neurocomputing 2014, 142, 438–446. [Google Scholar] [CrossRef]
  20. Alaglöz, Y.; Oral, K.; Yüce, S. Split quaternion matrices. Miskolc Math. Notes 2012, 13, 223–232. [Google Scholar] [CrossRef]
  21. 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]
  22. Chen, X.; Song, Q.; Li, Z.; Zhao, Z.; Liu, Y. Stability analysis of continuous-time and discrete-time quaternion-valued neural networks with linear threshold neurons. IEEE Trans. Neural Netw. Learn. Syst. 2017, 29, 2769–2781. [Google Scholar] [CrossRef] [PubMed]
  23. Shu, H.; Song, Q.; Liu, Y.; Zhao, Z.; Alsaadi, F.E. Global μ-stability of quaternion-valued neural networks with non-differentiable time-varying delays. Neurocomputing 2017, 247, 202–212. [Google Scholar] [CrossRef]
  24. Liu, Y.; Zhang, D.; Lu, J. Global exponential stability for quaternion-valued recurrent neural networks with time-varying delays. Nonlinear Dyn. 2017, 87, 553–565. [Google Scholar] [CrossRef]
  25. Liu, Y.; Zhang, D.; Lu, J.; Cao, J. Global μ-stability criteria for quaternion-valued neural networks with unbounded time-varying delays. Inf. Sci. 2016, 360, 273–288. [Google Scholar] [CrossRef]
  26. Tu, Z.; Cao, J.; Alsaedi, A.; Hayat, T. Global dissipativity analysis for delayed quaternion-valued neural networks. Neural Netw. 2017, 89, 97–104. [Google Scholar] [CrossRef]
  27. Li, H.; Zhang, L.; Hu, C.; Jiang, H.; Cao, J. Global Mittag-Leffler synchronization of fractional-order delayed quaternion-valued neural networks: Direct quaternion approach. Appl. Math. Comput. 2020, 373, 125020. [Google Scholar] [CrossRef]
  28. Tu, Z.; Yang, X.; Wang, L.; Ding, N. Stability and stabilization of quaternion-valued neural networks with uncertain time-delayed impulses: Direct quaternion method. Phys. A Stat. Mech. Its Appl. 2019, 535, 122358. [Google Scholar] [CrossRef]
  29. Hu, J.; Zeng, C.; Tan, J. Boundedness and periodicity for linear threshold discrete-time quaternion-valued neural network with time-delays. Neurocomputing 2017, 267, 417–425. [Google Scholar] [CrossRef]
Figure 1. The chaotic diagram of system (20), where (a), (b), (c) and (d) correspond to four dimensions of z i , respectively.
Figure 1. The chaotic diagram of system (20), where (a), (b), (c) and (d) correspond to four dimensions of z i , respectively.
Axioms 12 00842 g001
Figure 2. Time evolution of system (20), where (a), (b), (c) and (d) correspond to four dimensions of z i , respectively.
Figure 2. Time evolution of system (20), where (a), (b), (c) and (d) correspond to four dimensions of z i , respectively.
Axioms 12 00842 g002
Figure 3. The synchronization error ω i ( t ) of systems (20) and (21), where (a), (b), (c) and (d) correspond to four dimensions of ω i , respectively.
Figure 3. The synchronization error ω i ( t ) of systems (20) and (21), where (a), (b), (c) and (d) correspond to four dimensions of ω i , respectively.
Axioms 12 00842 g003
Figure 4. The synchronization curve of systems (20) and (21), where (a), (b), (c) and (d) correspond to four dimensions of z i and r i , respectively.
Figure 4. The synchronization curve of systems (20) and (21), where (a), (b), (c) and (d) correspond to four dimensions of z i and r i , respectively.
Axioms 12 00842 g004
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

Han, X.; Abdurahman, A.; You, J. Nonseparation Approach to General-Decay Synchronization of Quaternion-Valued Neural Networks with Mixed Time Delays. Axioms 2023, 12, 842. https://doi.org/10.3390/axioms12090842

AMA Style

Han X, Abdurahman A, You J. Nonseparation Approach to General-Decay Synchronization of Quaternion-Valued Neural Networks with Mixed Time Delays. Axioms. 2023; 12(9):842. https://doi.org/10.3390/axioms12090842

Chicago/Turabian Style

Han, Xiaofang, Abdujelil Abdurahman, and Jingjing You. 2023. "Nonseparation Approach to General-Decay Synchronization of Quaternion-Valued Neural Networks with Mixed Time Delays" Axioms 12, no. 9: 842. https://doi.org/10.3390/axioms12090842

APA Style

Han, X., Abdurahman, A., & You, J. (2023). Nonseparation Approach to General-Decay Synchronization of Quaternion-Valued Neural Networks with Mixed Time Delays. Axioms, 12(9), 842. https://doi.org/10.3390/axioms12090842

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