Next Article in Journal
Stability and Hopf Bifurcation Analysis of a Multi-Delay Vector-Borne Disease Model with Presence Awareness and Media Effect
Next Article in Special Issue
Bifurcation Exploration and Controller Design in a Fractional Oxygen–Plankton Model with Delay
Previous Article in Journal
The Formative Factors of a Rock Burst Based on Energy Calculations and the Experimental Verification of Butterfly-Shaped Plastic Zones
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Asymptotic and Mittag–Leffler Synchronization of Fractional-Order Octonion-Valued Neural Networks with Neutral-Type and Mixed Delays

by
Călin-Adrian Popa
Department of Computers and Information Technology, Politehnica University of Timişoara, Blvd. V. Pârvan, No. 2, 300223 Timişoara, Romania
Fractal Fract. 2023, 7(11), 830; https://doi.org/10.3390/fractalfract7110830
Submission received: 23 October 2023 / Revised: 10 November 2023 / Accepted: 14 November 2023 / Published: 20 November 2023

Abstract

:
Very recently, a different generalization of real-valued neural networks (RVNNs) to multidimensional domains beside the complex-valued neural networks (CVNNs), quaternion-valued neural networks (QVNNs), and Clifford-valued neural networks (ClVNNs) has appeared, namely octonion-valued neural networks (OVNNs), which are not a subset of ClVNNs. They are defined on the octonion algebra, which is an 8D algebra over the reals, and is also the only other normed division algebra that can be defined over the reals beside the complex and quaternion algebras. On the other hand, fractional-order neural networks (FONNs) have also been very intensively researched in the recent past. Thus, the present work combines FONNs and OVNNs and puts forward a fractional-order octonion-valued neural network (FOOVNN) with neutral-type, time-varying, and distributed delays, a very general model not yet discussed in the literature, to our awareness. Sufficient criteria expressed as linear matrix inequalities (LMIs) and algebraic inequalities are deduced, which ensure the asymptotic and Mittag–Leffler synchronization properties of the proposed model by decomposing the OVNN system of equations into a real-valued one, in order to avoid the non-associativity problem of the octonion algebra. To accomplish synchronization, we use two different state feedback controllers, two different types of Lyapunov-like functionals in conjunction with two Halanay-type lemmas for FONNs, the free-weighting matrix method, a classical lemma, and Young’s inequality. The four theorems presented in the paper are each illustrated by a numerical example.

1. Introduction

In the last few years, there has been an increasing interest in neural networks with values in multidimensional domains. Thus, the first type of such neural networks that have appeared are CVNNs, which are the 2D generalization of the classical RVNNs, defined on the complex number algebra. Afterwards, QVNNs appeared, which are defined on the 4D algebra of quaternions. Both types of networks are a part of the larger family of ClVNNs, which can be defined on any Clifford algebra of dimension 2 n , where n 1 .
Recently, a different type of generalization of CVNNs and QVNNs was proposed, namely OVNNs, which are defined on the 8D algebra of octonions. It is easy to see that the algebra of octonions is not a particular case of Clifford algebra because all of the Clifford algebras are associative and the algebra of octonions is not associative. Nonetheless, the octonion algebra possesses the property of being a normed division algebra, which, together with the complex and quaternion algebras, are the only ones that can be defined over the reals. It is this interesting property that gave rise to the idea of defining OVNNs, first in their feed forward variant, in [1]. Additionally, octonions have interesting applications in signal processing [2,3,4], salient object detection [5,6], and hyperspectral fluorescence data fusion [7], but also in physics, for example, in electrodynamics [8], fluid dynamics [9], and gravitational field equations [10]. Taking these applications into account, it was natural to extend neural networks to the octonion domain in order to increase the expressiveness of the networks and their representational power. The dynamics of recurrent neural networks defined on the algebra of octonions was firstly studied in [11,12]. More recently, other papers have appeared that discuss dynamic properties of OVNNs, for example, [13,14,15,16]. We can observe an increasing interest in studying OVNNs in the last two years, which means that the domain of OVNNs is captivating the attention of the research community and that more papers will appear in the very near future.
On the other hand, fractional calculus discusses different ways to define real or complex orders in the context of differential and integral operators. Even though it appeared long time ago, fractional calculus did not have any important applications until recently, when it was proved that some natural phenomena can be better expressed using fractional derivatives or integrals [17,18]. Thus, fractional calculus has proved more effective in describing systems in fields such as physics, electromagnetics, acoustics, mechanics, heat transfer, biology, chemistry, economy, and finance.
It was also proved that fractional-order systems have the interesting property of infinite memory. This means that the use of a fractional derivative or integral could also provide an enhancement for neural networks. Thus, FONNs were defined for the first time in [19]. Over the years, many papers studying different dynamic properties of FONNs have appeared. Recently, the asymptotic stability and synchronization properties of FONNs were discussed, for example, in [20,21,22,23,24,25,26,27]. Then, the equivalent of the exponential stability and synchronization from integer-order neural networks, namely Mittag–Leffler stability and synchronization, were discussed in [28,29,30,31,32,33]. Finite-time stability and synchronization have been the focus of the papers [34,35,36,37,38,39]. Other dynamic properties were also studied, for example, dissipativity, in [40,41,42,43,44,45], etc. As such, it can be said that FONNs constitute a domain of research in their own right, with recently gained popularity.
Combining the two directions discussed above, the current paper aims to study the synchronization property of FONNs with values in the octonion algebra, namely FOOVNNs. To the best of our knowledge, this type of model has not been studied before in the existing literature. There exist, however, papers discussing fractional-order CVNNs (FOCVNNs), for example, [32,37,46,47,48,49], and also papers dealing with different dynamic properties of fractional-order QVNNs (FOQVNNs), for example, [29,35,42,43,44,50]. As such, the current research presents a model that generalizes the models proposed in these papers.
When defining the recurrent neural network model to be studied, it is essential to also add different types of delays to the model, because delays appear naturally when implementing neural networks in practice. The most classical types of delays are the time-varying delays. Then, distribution delays exist, which are determined by the dispersion of conduction velocities along the neural network’s paths. When they appear together with time-varying delays, distributed delays are called mixed delays. FONNs with this type of delays have been discussed in the recent literature, for example, in [21,26,31,39,47,51,52,53,54,55,56].
A different and equally interesting family of delays are the neutral-type delays, which actually dramatically change the dynamics of the system, giving rise to neutral-type systems. In these systems, it is assumed that past derivative information affects the current state. It is natural that this type of delay was also added to neural network models, because they have been seen to appear when VLSI circuits are used for implementing neural networks. FONNs with neutral-type delays were the focus of the following recent papers: [20,21,26,57,58,59].
Taking into account all the above considerations, the most important highlights of the paper are as follows:
  • For the first time in the literature, to our knowledge, an FOOVNN with time-varying, distributed, and neutral-type delays is put forward, combining fractional calculus with octonion algebra.
  • The asymptotic and Mittag–Leffler synchronization properties are studied for the proposed model, and sufficient criteria are given both in terms of LMIs and of algebraic inequalities by decomposing the OVNN system of equations into a real-valued one, in order to avoid the non-associativity problem of octonion algebra.
  • To accomplish synchronization, we use two different types of state feedback controllers, two different types of Lyapunov-type functionals in conjunction with two Halanay-type lemmas specific to FONNs, as well as the free weighting matrix method, a classical lemma, and Young’s inequality.
  • Each of the four theorems formulated in the paper is illustrated by one numerical example.
  • The model is general, and can be particularized for fractional-order CVNNs (FOCVNNs) and fractional-order QVNNs (FOQVNNs), for which the corresponding results do not exist in the literature, to our knowledge, for such general models.
Thus, the rest of the paper is organized as follows: Section 2 is dedicated to presenting the algebra of octonions, the definitions related to fractional calculus, the proposed model, its decomposition into a real-valued system, and the assumption and lemmas that are used in the proofs of the paper. Then, Section 3 contains the main results of the research: four theorems expressed in the form of LMIs and algebraic inequalities for the asymptotic and Mittag–Leffler synchronization of the proposed FOOVNN model using two types of state feedback controllers and two types of Lyapunov-like functions. Each of the four theorems is illustrated by a numerical simulation in Section 4. Finally, the conclusions of the paper are drawn in Section 5.
Notations:  R —real numbers, R + —positive real numbers, O —octonion numbers, | | · | | L 2 norm, | · | L 1 norm, R N ( O N )—real-valued (octonion-valued) N-dimensional vectors, R N × N ( O N × N )—real-valued (octonion-valued) matrices of dimensions N × N , A < 0 —matrix A is negative definite, A T —transpose of matrix A, and λ min ( A ) —smallest eigenvalue of matrix A.

2. Preliminaries

We start by giving details about the algebra of octonions, mainly based on [11,12]. The set of octonions is defined as:
O = o = q = 0 7 o q e q o q R , 0 q 7 ,
where e q represent the unit octonions, 0 q 7 . On this set, we define the octonion addition by o + p : = q = 0 7 ( o q + p q ) e q and the scalar multiplication by α o : = q = 0 7 ( α o q ) e q . The multiplication of octonions is defined by the multiplication table of the octonion units:
× e 0 e 1 e 2 e 3 e 4 e 5 e 6 e 7
e 0 e 0 e 1 e 2 e 3 e 4 e 5 e 6 e 7
e 1 e 1 e 0 e 3 e 2 e 5 e 4 e 7 e 6
e 2 e 2 e 3 e 0 e 1 e 6 e 7 e 4 e 5
e 3 e 3 e 2 e 1 e 0 e 7 e 6 e 5 e 4
e 4 e 4 e 5 e 6 e 7 e 0 e 1 e 2 e 3
e 5 e 5 e 4 e 7 e 6 e 1 e 0 e 3 e 2
e 6 e 6 e 7 e 4 e 5 e 2 e 3 e 0 e 1
e 7 e 7 e 6 e 5 e 4 e 3 e 2 e 1 e 0
For each octonion o O , its conjugate is defined as o ¯ : = o 0 e 0 q = 1 7 o q e q . Then, we define the norm of octonion o as | o | : = o ¯ o = q = 0 7 ( o q ) 2 and its inverse as o 1 : = o ¯ | o | 2 . With all these operations, it can be proved that O is a normed division algebra. Actually, there exists a famous result by Hurwitz, who showed that the real, complex, quaternion, and octonion number sets with their respective operations are the only normed division algebras over the real numbers.
As can be seen from the multiplication table, we have that e q e l = e l e q e l e q if q l , q 0 , l 0 , which means that, like the algebra of quaternions, the above-defined algebra of octonions is not commutative. Moreover, we can observe that ( e q e l ) e m = e q ( e l e m ) e q ( e l e m ) if q , l , m are non-zero, different, and e q e l ± e m . This tells us that, unlike the algebra of quaternions and other Clifford algebras in general, the algebra of octonions is also not associative.
On the other hand, we introduce the basics of the calculus with fractional order.
Definition 1
([60]). The fractional integral of order α for an integrable function x : [ t 0 , ) R is defined as:
I t 0 α x ( t ) = 1 Γ ( α ) t 0 t ( t s ) α 1 x ( s ) d s ,
where t t 0 , α > 0 , and Γ ( · ) is the gamma function, defined by:
Γ ( τ ) = 0 t τ 1 e t d t ,
for Re ( τ ) > 0 , where Re ( · ) represents the real part.
Definition 2
([60]). The fractional Caputo derivative of order α for a function x C n ( [ t 0 , ) , R ) is defined by:
D t 0 α x ( t ) = 1 Γ ( n α ) t 0 t x ( n ) ( s ) ( t s ) α n + 1 d s ,
where t t 0 and n is a positive integer, with n 1 < α < n . Moreover, when 0 < α < 1 , we have that:
D t 0 α x ( t ) = 1 Γ ( 1 α ) t 0 t x ˙ ( s ) ( t s ) α d s .
Definition 3
([60]). The Mittag–Leffler function is defined by:
E α ( z ) = p = 0 z p Γ ( p α + 1 ) ,
where α > 0 and z C . When α = 1 , we have that E 1 ( z ) = e z .
Now, we are ready to introduce the model that will represent the drive system. Assume we have the following OVNN with neutral-type, time-varying, and distributed delays:
D 0 α o i ( t ) = c i o i ( t ) + j = 1 N a i j f j ( o j ( t ) ) + j = 1 N b i j f j ( o j ( t π ( t ) ) ) + j = 1 N g i j t ε t f j ( o j ( s ) ) d s + h i D γ α o i ( t γ ) + I i ,
i { 1 , , N } , t [ 0 , + ) , where o ( t ) = ( o 1 ( t ) , , o N ( t ) ) T O N represents the vector of states at t [ 0 , + ) , C = diag ( c 1 , , c N ) R N × N represents the self-feedback weight matrix, A = ( a i j ) 1 i , j N O N × N is the weight matrix without delay, B = ( b i j ) 1 i , j N O N × N is the weight matrix with delay, G = ( g i j ) 1 i , j N O N × N is the distributed delay weight matrix, H = diag ( h 1 , , h N ) O N × N is the neutral-type weight matrix, f j : O O represent the activation functions, j { 1 , , N } , and I = ( I 1 , , I N ) T O N is the external input vector. The time-varying delays are π : R + R + , and we assume the existence of π > 0 with π ( t ) π , t [ 0 , + ) ; the distributed delay is ε > 0 , and the neutral-type delay is γ > 0 . We denote ς : = max { π , ε , γ } . Additionally, suppose that the functions f j can be written in the form f j ( o ) = q = 0 7 f j q ( o ) e q , o O , where f j q : O R , j { 1 , , N } , 0 q 7 .
For System (1), the initial condition is given as:
o i ( t ) = ν i ( t ) , t [ ς , 0 ] ,
where ν i C ( [ ς , 0 ] , O ) , i { 1 , , N } , and the norm on C ( [ ς , 0 ] , O N ) has the definition | | ν | | : = i = 1 N sup [ ς , 0 ] | ν i ( t ) | .
On the other hand, in order to study synchronization, we will correspondingly define the response system as:
D 0 α p i ( t ) = c i p i ( t ) + j = 1 N a i j f j ( p j ( t ) ) + j = 1 N b i j f j ( p j ( t π ( t ) ) ) + j = 1 N g i j t ε t f j ( p j ( s ) ) d s + h i D γ α p i ( t γ ) + I i u i ( t ) ,
i { 1 , , N } , t [ 0 , + ) , and p ( t ) = ( p 1 ( t ) , , p N ( t ) ) T O N represents the vector of states at t [ 0 , + ) , and u ( t ) = ( u 1 ( t ) , , u N ( t ) ) T O N represents the control input vector at t [ 0 , + ) .
For System (2), the initial condition is given by:
p i ( t ) = υ i ( t ) , t [ ς , 0 ] ,
where υ i C ( [ ς , 0 ] , O ) , i { 1 , , N } .
Now, by denoting r i ( t ) = p i ( t ) o i ( t ) , i { 1 , , N } , t [ 0 , + ) and also considering Relations (1) and (2), the expression of the error system is given as:
D 0 α 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 π ( t ) ) ) + j = 1 N g i j t ε t f ˜ j ( r j ( s ) ) d s + h i D γ α r i ( t γ ) u i ( t ) ,
i { 1 , , N } and t [ 0 , + ) , where f ˜ j ( r j ( t ) ) = f j ( r j ( t ) + o j ( t ) ) f j ( o j ( t ) ) , t [ 0 , + ) , j { 1 , , N } .
The initial conditions of System (3) now have the following form:
r i ( t ) = ψ i ( t ) = υ i ( t ) ν i ( t ) , t [ ς , 0 ] ,
where ψ i C ( [ ς , 0 ] , O ) , i { 1 , , N } .
At this point, we will transform the System of Equations (3) into 8 real-valued systems. In order to do this, each equation in (3) can be written as the following 8 equations:
D 0 α r i q ( t ) = c i r i q ( t ) + j = 1 N l = 0 7 a i j q l f ˜ j l ( r j ( t ) ) + j = 1 N l = 0 7 b i j q l f ˜ j l ( r j ( t π ( t ) ) ) + j = 1 N l = 0 7 g i j q l t ε t f ˜ j l ( r j ( s ) ) d s + l = 0 7 h i q l D γ α r i l ( t γ ) u i q ( t ) ,
0 q 7 , i { 1 , , N } , and o q l , 0 q , l 7 represents an element of matrix mat ( o ) , defined by:
mat ( o ) : = o 0 o 1 o 2 o 3 o 4 o 5 o 6 o 7 o 1 o 0 o 3 o 2 o 5 o 4 o 7 o 6 o 2 o 3 o 0 o 1 o 6 o 7 o 4 o 5 o 3 o 2 o 1 o 0 o 7 o 6 o 5 o 4 o 4 o 5 o 6 o 7 o 0 o 1 o 2 o 3 o 5 o 4 o 7 o 6 o 1 o 0 o 3 o 2 o 6 o 7 o 4 o 5 o 2 o 3 o 0 o 1 o 7 o 6 o 5 o 4 o 3 o 2 o 1 o 0 .
If we now denote vec ( o ) : = ( o 0 , o 1 , , o 7 ) T , System (3) will have the following expression:
vec ( D 0 α r i ( t ) ) = c i vec ( r i ( t ) ) + j = 1 N mat ( a i j ) vec ( f ˜ j ( r j ( t ) ) ) + j = 1 N mat ( b i j ) vec ( f ˜ j ( r j ( t π ( t ) ) ) ) + j = 1 N mat ( g i j ) t ε t vec ( f ˜ j ( r j ( s ) ) ) d s + mat ( h i ) vec ( D γ α r i ( t γ ) ) vec ( u i ( t ) ) ,
t [ 0 , + ) and i { 1 , , N } .
Finally, by denoting:
r ˇ ( t ) : = ( vec ( r 1 ( t ) ) T , , vec ( r N ( t ) ) T ) T R 8 N , f ˇ ( r ˇ ( t ) ) : = ( vec ( f ˜ 1 ( r 1 ( t ) ) ) T , , vec ( f ˜ N ( r N ( t ) ) ) T ) T R 8 N ,
C ˇ : = diag ( c 1 I 8 , c 2 I 8 , , c N I 8 ) R 8 N × 8 N , A ˇ : = mat ( a i j ) 1 i , j N R 8 N × 8 N ,
B ˇ : = mat ( b i j ) 1 i , j N R 8 N × 8 N , G ˇ : = mat ( g i j ) 1 i , j N R 8 N × 8 N ,
H ˇ : = diag mat ( h 1 ) , , mat ( h N ) R 8 N × 8 N , u ˇ ( t ) : = ( vec ( u 1 ( t ) ) T , , vec ( u N ( t ) ) T ) T R 8 N ,
System (3) becomes:
D 0 α r ˇ ( t ) = C ˇ r ˇ ( t ) + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + H ˇ D γ α r ˇ ( t γ ) u ˇ , t [ 0 , + ) .
The following assumption regarding the activation functions has to be made:
Assumption 1.
The activation functions f j satisfy, o , o O , the following Lipschitz conditions:
| | f j q ( o ) f j q ( o ) | | l j q | | o o | | ,
0 q 7 and j { 1 , , N } , where l j q > 0 represent the Lipschitz constants. We denote L ˇ : = d i a g ( l 1 0 , , l 1 7 , , l N 0 , , l N 7 ) R 8 N × 8 N .
In order to conduct our proofs, the following lemmas will also be needed:
Lemma 1
([61]). If x C 1 ( [ t 0 , ) , R N ) and P R N × N is a positive definite matrix, then
D t 0 α ( x T ( t ) P x ( t ) ) x T ( t ) P D t 0 α x ( t ) + D t 0 α x ( t ) T P x ( t ) , t t 0 ,
where 0 < α < 1 .
Lemma 2
([53]). Let V : [ t 0 ρ , ) R + be bounded on [ t 0 ρ , t 0 ] and continuous on [ t 0 , ) . If there exist ϕ, v h , h = 1 , , m such that
D t 0 α V ( t ) ϕ V ( t ) + h = 1 m v h sup ρ h ω 0 V ( t + ω ) ,
where 0 < α < 1 , v h > 0 , ϕ > h = 1 m v h , ρ = max { ρ 1 , , ρ m } , then lim t V ( t ) = 0 .
Lemma 3
([62]). For any vectors X , Y R N and any positive definite matrix Q R N × N , the following inequality holds:
X T Y + Y T X X T Q X + Y T Q 1 Y .
Lemma 4
([36]). If x C 1 ( [ t 0 , ) , R ) and p 1 , then
D t 0 α | x ( t ) | p p | x ( t ) | p 1 s i g n ( x ( t ) ) D t 0 α x ( t ) , t t 0 ,
where 0 < α < 1 .
Lemma 5
(Young’s Inequality). Let u > 0 , v > 0 , r > 1 , s > 1 and 1 r + 1 s = 1 , then the inequality
u v 1 r u r + 1 s v s ,
holds, with equality if u r = v s .
Lemma 6
([63]). Let V C ( [ t 0 , ) , R ) , which satisfies
D t 0 α V ( t ) ϕ V ( t ) , t t 0 ,
where 0 < α < 1 and ϕ > 0 . Then,
V ( t ) V ( t 0 ) E α ( ϕ ( t t 0 ) α ) , t t 0 .

3. Main Results

The assumption that 0 < α < 1 will be made in the remaining part of the paper.
The state feedback control technique will be used to study the synchronization between Drive System (1) and Response System (2). The control input is given, in this case, by the following expression:
u i ( t ) = k i 1 r i ( t ) + k i 2 r i ( t π ( t ) ) + k i 3 t ε t r i ( s ) d s + k i 4 D γ α r i ( t γ ) ,
and k i 1 , k i 2 , k i 3 , k i 4 R + , i { 1 , , N } represent the control gain parameters. We can now write System (3) as:
D 0 α r i ( t ) = ( c i + k i 1 ) r i ( t ) k i 2 r i ( t π ( t ) ) k i 3 t ε t r i ( s ) d s + j = 1 N a i j f ˜ j ( r j ( t ) ) + j = 1 N b i j f ˜ j ( r j ( t π ( t ) ) ) + j = 1 N g i j t ε t f ˜ j ( r j ( s ) ) d s + ( h i k i 4 ) D γ α r i ( t γ ) ,
i { 1 , , N } .
In matrix form, we can write System (6) as:
D 0 α r ˇ ( t ) = ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 r ˇ ( t π ( t ) ) K ˇ 3 t ε t r ˇ ( s ) d s + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) ,
where K ˇ 1 : = diag ( k 11 I 8 , k 21 I 8 , , k N 1 I 8 ) R 8 N × 8 N , K ˇ 2 : = diag ( k 12 I 8 , k 22 I 8 , , k N 2 I 8 ) R 8 N × 8 N ,
K ˇ 3 : = diag ( k 13 I 8 , k 23 I 8 , , k N 3 I 8 ) R 8 N × 8 N , K ˇ 4 : = diag ( k 14 I 8 , k 24 I 8 , , k N 4 I 8 ) R 8 N × 8 N .
Theorem 1.
System (1) and System (2) are asymptotically synchronized under Controller (5) if the subsequent LMI is true:
Ω : = Ω i , j 1 i , j 10 < 0 ,
where Ω 1 , 1 = ( 2 + ϕ ) P + L ˇ T R 1 L ˇ P ( C ˇ + K ˇ 1 ) ( C ˇ + K ˇ 1 ) P , Ω 1 , 2 = ( C ˇ + K ˇ 1 ) N 1 T , Ω 1 , 3 = P K ˇ 2 ( C ˇ + K ˇ 1 ) N 2 T , Ω 1 , 6 = P A ˇ + ( C ˇ + K ˇ 1 ) N 3 T , Ω 1 , 7 = P B ˇ + ( C ˇ + K ˇ 1 ) N 4 T , Ω 1 , 8 = P K ˇ 3 ( C ˇ + K ˇ 1 ) N 5 T , Ω 1 , 9 = ( C ˇ + K ˇ 1 ) N 6 T , Ω 1 , 10 = ( C ˇ + K ˇ 1 ) N 7 T , Ω 2 , 2 = N 1 N 1 T , Ω 2 , 3 = N 1 K ˇ 2 N 2 T , Ω 2 , 6 = N 1 A ˇ + N 3 T , Ω 2 , 7 = N 1 B ˇ + N 4 T , Ω 2 , 8 = N 1 K ˇ 3 N 5 T , Ω 2 , 9 = N 1 G ˇ + N 6 T , Ω 2 , 10 = N 1 ( H ˇ K ˇ 4 ) + N 7 T , Ω 3 , 3 = v 1 P + L ˇ T R 2 L ˇ N 2 K ˇ 3 K ˇ 3 N 2 T , Ω 3 , 6 = N 2 A ˇ + K ˇ 2 N 3 T , Ω 3 , 7 = N 2 B ˇ + K ˇ 2 N 4 T , Ω 3 , 8 = N 2 K ˇ 3 K ˇ 2 N 5 T , Ω 3 , 9 = N 2 G ˇ + K ˇ 2 N 6 T , Ω 3 , 10 = N 2 ( H ˇ K ˇ 4 ) + K ˇ 2 N 7 T , Ω 4 , 4 = v 2 P , Ω 5 , 5 = v 3 P , Ω 6 , 6 = R 1 N 3 A ˇ A ˇ T N 3 T , Ω 6 , 7 = N 3 B ˇ A ˇ T N 4 T , Ω 6 , 8 = N 3 K ˇ 3 + A ˇ T N 5 T , Ω 6 , 9 = N 3 G ˇ A ˇ T N 6 T , Ω 6 , 10 = N 3 ( H ˇ K ˇ 4 ) A ˇ T N 7 T , Ω 7 , 7 = R 2 N 4 B ˇ B ˇ T N 4 T , Ω 7 , 8 = N 4 K ˇ 3 + B ˇ T N 5 T , Ω 7 , 9 = N 4 G ˇ B ˇ T N 6 T , Ω 7 , 10 = N 4 ( H ˇ K ˇ 4 ) B ˇ T N 7 T , Ω 8 , 8 = N 5 K ˇ 3 K ˇ 3 N 5 T , Ω 8 , 9 = N 5 G ˇ + K ˇ 3 N 6 T , Ω 8 , 10 = N 5 ( H ˇ K ˇ 4 ) + K ˇ 3 N 7 T , Ω 9 , 9 = G ˇ T P G ˇ N 6 G ˇ G ˇ T N 6 T , Ω 9 , 10 = N 6 ( H ˇ K ˇ 4 ) G ˇ T N 7 T , Ω 10 , 10 = ( H ˇ K ˇ 4 ) T P ( H ˇ K ˇ 4 ) N 7 ( H ˇ K ˇ 4 ) ( H ˇ K ˇ 4 ) T N 7 T , and P R 8 N × 8 N is a positive definite matrix, R 1 , R 2 R 8 N × 8 N are diagonal positive definite matrices, N 1 , , N 7 R 8 N × 8 N are any matrices, and ϕ , v 1 , v 2 , v 3 are positive real numbers.
Proof. 
Define the following Lyapunov-like functional:
V ( t ) = r ˇ ( t ) T P r ˇ ( t ) .
Using Lemma 1 and taking the fractional-order derivative of the function defined above, along the trajectories of System (7), we obtain:
D 0 α V ( t ) + ϕ V ( t ) h = 1 m v h sup ρ h ς 0 V ( t + ς ) D 0 α V ( t ) + ϕ V ( t ) v 1 V ( t π ( t ) ) v 2 V ( t ε ) v 3 V ( t γ ) r ˇ ( t ) T P D 0 α r ˇ ( t ) + D 0 α r ˇ ( t ) T P r ˇ ( t ) + ϕ r ˇ ( t ) T P r ˇ ( t ) v 1 r ˇ ( t π ( t ) ) T P r ˇ ( t π ( t ) ) v 2 r ˇ ( t ε ) T P r ˇ ( t ε ) v 3 r ˇ ( t γ ) T P r ˇ ( t γ ) = r ˇ ( t ) T P ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 r ˇ ( t π ( t ) ) K ˇ 3 t ε t r ˇ ( s ) d s + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) + ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 r ˇ ( t π ( t ) ) K ˇ 3 t ε t r ˇ ( s ) d s + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) T P r ˇ ( t ) + ϕ r ˇ ( t ) T P r ˇ ( t ) v 1 r ˇ ( t π ( t ) ) T P r ˇ ( t π ( t ) ) v 2 r ˇ ( t ε ) T P r ˇ ( t ε ) v 3 r ˇ ( t γ ) T P r ˇ ( t γ ) = r ˇ ( t ) T P ( C ˇ + K ˇ 1 ) r ˇ ( t ) r ˇ ( t ) T P K ˇ 2 r ˇ ( t π ( t ) ) r ˇ ( t ) T P K ˇ 3 t ε t r ˇ ( s ) d s + r ˇ ( t ) T P A ˇ f ˇ ( r ˇ ( t ) ) + r ˇ ( t ) T P B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + r ˇ ( t ) T P G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + r ˇ ( t ) T P ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) r ˇ ( t ) T ( C ˇ + K ˇ 1 ) P r ˇ ( t ) r ˇ ( t π ( t ) ) T K ˇ 2 P r ˇ ( t ) t ε t r ˇ ( s ) d s T K ˇ 3 P r ˇ ( t ) + f ˇ ( r ˇ ( t ) ) T A ˇ T P r ˇ ( t ) + f ˇ ( r ˇ ( t π ( t ) ) ) T B ˇ T P r ˇ ( t ) + t ε t f ˇ ( r ˇ ( s ) ) d s T G ˇ T P r ˇ ( t ) + D γ α r ˇ ( t γ ) T ( H ˇ K ˇ 4 ) P r ˇ ( t ) + ϕ r ˇ ( t ) T P r ˇ ( t ) v 1 r ˇ ( t π ( t ) ) T P r ˇ ( t π ( t ) ) v 2 r ˇ ( t ε ) T P r ˇ ( t ε ) v 3 r ˇ ( t γ ) T P r ˇ ( t γ ) .
If we take Q = P 1 in Lemma 3, we obtain:
r ˇ ( t ) T P G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + t ε t f ˇ ( r ˇ ( s ) ) d s T G ˇ T P r ˇ ( t ) r ˇ ( t ) T P P 1 P r ˇ ( t ) + t ε t f ˇ ( r ˇ ( s ) ) d s T G ˇ T P G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s ,
r ˇ ( t ) T P ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) + D γ α r ˇ ( t γ ) T ( H ˇ K ˇ 4 ) P r ˇ ( t ) r ˇ ( t ) T P P 1 P r ˇ ( t ) + D γ α r ˇ ( t γ ) T ( H ˇ K ˇ 4 ) T P ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) .
Now, Inequality (9) becomes:
D 0 α V ( t ) + ϕ V ( t ) h = 1 m v h sup ρ h ς 0 V ( t + ς ) r ˇ ( t ) T P ( C ˇ + K ˇ 1 ) r ˇ ( t ) r ˇ ( t ) T ( C ˇ + K ˇ 1 ) P r ˇ ( t ) r ˇ ( t ) T P K ˇ 2 r ˇ ( t π ( t ) ) r ˇ ( t π ( t ) ) T K ˇ 2 P r ˇ ( t ) r ˇ ( t ) T P K ˇ 3 t ε t r ˇ ( s ) d s t ε t r ˇ ( s ) d s T K ˇ 3 P r ˇ ( t ) + r ˇ ( t ) T P A ˇ f ˇ ( r ˇ ( t ) ) + f ˇ ( r ˇ ( t ) ) T A ˇ T P r ˇ ( t ) + r ˇ ( t ) T P B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + f ˇ ( r ˇ ( t π ( t ) ) ) T B ˇ T P r ˇ ( t ) + r ˇ ( t ) T P r ˇ ( t ) + t ε t f ˇ ( r ˇ ( s ) ) d s T G ˇ T P G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + r ˇ ( t ) T P r ˇ ( t ) + D γ α r ˇ ( t γ ) T ( H ˇ K ˇ 4 ) T P ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) + ϕ r ˇ ( t ) T P r ˇ ( t ) v 1 r ˇ ( t π ( t ) ) T P r ˇ ( t π ( t ) ) v 2 r ˇ ( t ε ) T P r ˇ ( t ε ) v 3 r ˇ ( t γ ) T P r ˇ ( t γ ) .
Assumption 1 allows us to ascertain the existence of positive definite diagonal matrices R 1 and R 2 for which the following inequalities are valid t [ 0 , + ) :
0 r ˇ ( t ) T L ˇ T R 1 L ˇ r ˇ ( t ) f ˇ ( r ˇ ( t ) ) T R 1 f ˇ ( r ˇ ( t ) ) ,
0 r ˇ ( t π ( t ) ) T L ˇ T R 2 L ˇ r ˇ ( t π ( t ) ) f ˇ ( r ˇ ( t π ( t ) ) ) T R 2 f ˇ ( r ˇ ( t π ( t ) ) ) .
On the other hand, there exist any matrices N 1 , N 2 , N 3 , N 4 , N 5 , N 6 , N 7 such that the subsequent identity is true:
0 = D 0 α r ˇ ( t ) T N 1 + r ˇ ( t π ( t ) ) T N 2 f ˇ ( r ˇ ( t ) ) T N 3 f ˇ ( r ˇ ( t π ( t ) ) ) T N 4 + t ε t r ˇ ( s ) d s T N 5 t ε t f ˇ ( r ˇ ( s ) ) d s T N 6 D γ α r ˇ ( t γ ) T N 7 × D 0 α r ˇ ( t ) ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 r ˇ ( t π ( t ) ) K ˇ 3 t ε t r ˇ ( s ) d s + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) .
By taking the transpose of Identity (15) and adding them both, as well as Inequalities (13)–(14) to (12), we have that:
D 0 α V ( t ) + ϕ V ( t ) h = 1 m v h sup ρ h ς 0 V ( t + ς ) ζ T ( t ) Ω ζ ( t ) ,
where Ω is given in (8), and
ζ ( t ) = r ˇ ( t ) T D 0 α r ˇ ( t ) T r ˇ ( t π ( t ) ) T r ˇ ( t ε ) T r ˇ ( t γ ) T f ˇ ( r ˇ ( t ) ) T f ˇ ( r ˇ ( t π ( t ) ) ) T t ε t r ˇ ( s ) d s T t ε t f ˇ ( r ˇ ( s ) ) d s T D γ α r ˇ ( t γ ) T T .
Condition (8) tells us that Ω < 0 , so we can conclude that:
D 0 α V ( t ) + ϕ V ( t ) h = 1 m v h sup ρ h ς 0 V ( t + ς ) 0 .
The conclusion lim t V ( t ) = 0 is drawn after applying Lemma 2. From λ min ( P ) | | r ˇ ( t ) | | 2 r ˇ ( t ) T P r ˇ ( t ) = V ( t ) , we deduce that Systems (1) and (2) are asymptotically synchronized using Control Scheme (5), which is what we needed to prove. □
For the next theorem, no neutral-type delay will be considered for Systems (1) and (2), meaning that they will only possess mixed delays. Consequently, the neutral-type term will also not be present in the expression of the controller.
Theorem 2.
System (1) and System (2) are asymptotically synchronized under Controller (5) if the following algebraic inequalities are true, i { 1 , , 8 N } :
ω i ρ ( c ˇ i + k ˇ i 1 ) + ω i ( ρ 1 ) k ˇ i 2 + ω i ( ρ 1 ) k ˇ i 3 ε + ω i ( ρ 1 ) j = 1 8 N | a ˇ i j | l ˇ j + l ˇ i j = 1 8 N | a ˇ j i | ω j + ω i ( ρ 1 ) j = 1 8 N | b ˇ i j | l ˇ j + ω i ( ρ 1 ) j = 1 8 N | g ˇ i j | l ˇ j ε + ϕ ω i < 0 ω i k ˇ i 2 + l ˇ i j = 1 8 N | b ˇ j i | ω j v 1 ω i < 0 ω i k ˇ i 3 ε + l ˇ i j = 1 8 N | g ˇ j i | ω j ε v 2 ω i < 0 ,
where ρ, ω i , i { 1 , , 8 N } , ϕ , v 1 , v 2 are positive real numbers with ρ > 1 .
Proof. 
Define the following Lyapunov-like functional:
V ( t ) = i = 1 8 N ω i | r ˇ i ( t ) | ρ .
Using Lemma 4 and Assumption 1, and taking the fractional-order derivative of the function defined above, along the trajectories of System (7), we obtain:
D 0 α V ( t ) + ϕ V ( t ) h = 1 m v h sup ρ h ς 0 V ( t + ς ) i = 1 8 N ω i ρ | r ˇ i ( t ) | ρ 1 sign ( r ˇ i ( t ) ) D 0 α r ˇ i ( t ) + ϕ ω i | r ˇ i ( t ) | ρ v 1 ω i | r ˇ i ( t π ( t ) ) | ρ v 2 ω i | r ˇ i ( t ε ) | ρ i = 1 8 N ω i ρ | r ˇ i ( t ) | ρ 1 sign ( r ˇ i ( t ) ) ( c ˇ i + k ˇ i 1 ) r ˇ i ( t ) k ˇ i 2 r ˇ i ( t π ( t ) ) k ˇ i 3 t ε t r ˇ i ( s ) d s + j = 1 8 N a ˇ i j f ˇ j ( r ˇ j ( t ) ) + j = 1 8 N b ˇ i j f ˇ j ( r ˇ j ( t π ( t ) ) ) + j = 1 8 N g ˇ i j t ε t f ˇ j ( r ˇ j ( s ) ) d s + ϕ ω i | r ˇ i ( t ) | ρ v 1 ω i | r ˇ i ( t π ( t ) ) | ρ v 2 ω i sup ε ς 0 | r ˇ i ( t + ς ) | ρ i = 1 8 N ω i ρ | r ˇ i ( t ) | ρ ( c ˇ i + k ˇ i 1 ) + ω i ρ | r ˇ i ( t ) | ρ 1 k ˇ i 2 | r ˇ i ( t π ( t ) ) | + ω i ρ | r ˇ i ( t ) | ρ 1 k ˇ i 3 t ε t | r ˇ i ( s ) | d s + ω i ρ | r ˇ i ( t ) | ρ 1 j = 1 8 N | a ˇ i j | l ˇ j | r ˇ j ( t ) | + ω i ρ | r ˇ i ( t ) | ρ 1 j = 1 8 N | b ˇ i j | l ˇ j | r ˇ j ( t π ( t ) ) | + ω i ρ | r ˇ i ( t ) | ρ 1 j = 1 8 N | g ˇ i j | l ˇ j t ε t | r ˇ j ( s ) | d s + ϕ ω i | r ˇ i ( t ) | ρ v 1 ω i | r ˇ i ( t π ( t ) ) | ρ v 2 ω i sup ε ς 0 | r ˇ i ( t + ς ) | ρ i = 1 8 N ω i ρ ( c ˇ i + k ˇ i 1 ) | r ˇ i ( t ) | ρ + ω i ρ k ˇ i 2 | r ˇ i ( t ) | ρ 1 | r ˇ i ( t π ( t ) ) | + ω i ρ k ˇ i 3 ε | r ˇ i ( t ) | ρ 1 sup ε ς 0 | r ˇ i ( t + ς ) | + ω i ρ j = 1 8 N | a ˇ i j | l ˇ j | r ˇ i ( t ) | ρ 1 | r ˇ j ( t ) | + ω i ρ j = 1 8 N | b ˇ i j | l ˇ j | r ˇ i ( t ) | ρ 1 | r ˇ j ( t π ( t ) ) | + ω i ρ j = 1 8 N | g ˇ i j | l ˇ j ε | r ˇ i ( t ) | ρ 1 sup ε ς 0 | r ˇ j ( t + ς ) | ρ + ϕ ω i | r ˇ i ( t ) | ρ v 1 ω i | r ˇ i ( t π ( t ) ) | ρ v 2 ω i sup ε ς 0 | r ˇ i ( t + ς ) | ρ .
The application of Lemma 5 yields that:
| r ˇ i ( t ) | ρ 1 | r ˇ i ( t π ( t ) ) | ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ | r ˇ i ( t π ( t ) ) | ρ ,
| r ˇ i ( t ) | ρ 1 sup ε ς 0 | r ˇ i ( t + ς ) | ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ sup ε ς 0 | r ˇ i ( t + ς ) | ρ ,
| r ˇ i ( t ) | ρ 1 | r ˇ j ( t ) | ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ | r ˇ j ( t ) | ρ ,
| r ˇ i ( t ) | ρ 1 | r ˇ j ( t π ( t ) ) | ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ | r ˇ j ( t π ( t ) ) | ρ ,
| r ˇ i ( t ) | ρ 1 sup ε ς 0 | r ˇ j ( t + ς ) | ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ sup ε ς 0 | r ˇ j ( t + ς ) | ρ ,
i , j { 1 , , 8 N } , t [ 0 , + ) .
With these inequalities, (17) has the following form:
D 0 α V ( t ) + ϕ V ( t ) h = 1 m v h sup ρ h ς 0 V ( t + ς )
i = 1 8 N ω i ρ ( c ˇ i + k ˇ i 1 ) | r ˇ i ( t ) | ρ + ω i ρ k ˇ i 2 ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ | r ˇ i ( t π ( t ) ) | ρ + ω i ρ k ˇ i 3 ε ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ sup ε ς 0 | r ˇ i ( t + ς ) | ρ + ω i ρ j = 1 8 N | a ˇ i j | l ˇ j ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ | r ˇ j ( t ) | ρ + ω i ρ j = 1 8 N | b ˇ i j | l ˇ j ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ | r ˇ j ( t π ( t ) ) | ρ + ω i ρ j = 1 8 N | g ˇ i j | l ˇ j ε ρ 1 ρ | r ˇ i ( t ) | ρ + 1 ρ sup ε ς 0 | r ˇ j ( t + ς ) | ρ + ϕ ω i | r ˇ i ( t ) | ρ v 1 ω i | r ˇ i ( t π ( t ) ) | ρ v 2 ω i sup ε ς 0 | r ˇ i ( t + ς ) | ρ = i = 1 8 N ω i ρ ( c ˇ i + k ˇ i 1 ) + ω i ( ρ 1 ) k ˇ i 2 + ω i ( ρ 1 ) k ˇ i 3 ε + ω i ( ρ 1 ) j = 1 8 N | a ˇ i j | l ˇ j + l ˇ i j = 1 8 N | a ˇ j i | ω j + ω i ( ρ 1 ) j = 1 8 N | b ˇ i j | l ˇ j + ω i ( ρ 1 ) j = 1 8 N | g ˇ i j | l ˇ j ε + ϕ ω i | r ˇ i ( t ) | ρ
+ ω i k ˇ i 2 + l ˇ i j = 1 8 N | b ˇ j i | ω j v 1 ω i | r ˇ i ( t π ( t ) ) | ρ + ω i k ˇ i 3 ε + l ˇ i j = 1 8 N | g ˇ j i | ω j ε v 2 ω i sup ε ς 0 | r ˇ i ( t + ς ) | ρ .
Conditions (16) allow us to conclude that:
D 0 α V ( t ) + ϕ V ( t ) h = 1 m v h sup ρ h ς 0 V ( t + ς ) 0 .
The conclusion lim t V ( t ) = 0 is drawn by applying Lemma 2. From min i ω i i = 1 8 N | r ˇ i ( t ) | ρ i = 1 8 N ω i | r ˇ i ( t ) | ρ = V ( t ) , we deduce that Systems (1) and (2) are asymptotically synchronized on the basis of Control Scheme (5), which is what we needed to prove. □
Remark 1.
Theorems 1 and 2 give sufficient conditions expressed in terms of LMIs and algebraic inequalities, respectively, for the asymptotic synchronization of FOOVNNs with neutral-type, time-varying, and distributed delays. The asymptotic synchronization of FOCVNNs with different types of delays was discussed in the literature, for example, in [37,46,47,49,64,65]. The same property was studied for FOQVNNs with different types of delays, for example, in [44,50,66]. The asymptotic synchronization of delayed FOOVNNs was never before discussed in the existing literature, to the best of our knowledge. As such, our model is more general than the ones presented in the existing research, and thus, the results obtained are not directly comparable with the available results. However, our obtained results can be particularized for delayed FOCVNNs or FOQVNNs.
Theorem 3.
Systems (1) and (2) are Mittag–Leffler synchronized under Control Scheme (5) if the subsequent LMI is true:
Ω : = Ω i , j 1 i , j 8 < 0 ,
where Ω 1 , 1 = ( 2 + ϕ ) P + L ˇ T R 1 L ˇ P ( C ˇ + K ˇ 1 ) ( C ˇ + K ˇ 1 ) P , Ω 1 , 2 = ( C ˇ + K ˇ 1 ) N 1 T , Ω 1 , 3 = P K ˇ 2 ( C ˇ + K ˇ 1 ) N 2 T , Ω 1 , 4 = P A ˇ + ( C ˇ + K ˇ 1 ) N 3 T , Ω 1 , 5 = P B ˇ + ( C ˇ + K ˇ 1 ) N 4 T , Ω 1 , 6 = P K ˇ 3 ( C ˇ + K ˇ 1 ) N 5 T , Ω 1 , 7 = ( C ˇ + K ˇ 1 ) N 6 T , Ω 1 , 8 = ( C ˇ + K ˇ 1 ) N 7 T , Ω 2 , 2 = N 1 N 1 T , Ω 2 , 3 = N 1 K ˇ 2 N 2 T , Ω 2 , 4 = N 1 A ˇ + N 3 T , Ω 2 , 5 = N 1 B ˇ + N 4 T , Ω 2 , 6 = N 1 K ˇ 3 N 5 T , Ω 2 , 7 = N 1 G ˇ + N 6 T , Ω 2 , 8 = N 1 ( H ˇ K ˇ 4 ) + N 7 T , Ω 3 , 3 = v 1 P + L ˇ T R 2 L ˇ N 2 K ˇ 3 K ˇ 3 N 2 T , Ω 3 , 4 = N 2 A ˇ + K ˇ 2 N 3 T , Ω 3 , 5 = N 2 B ˇ + K ˇ 2 N 4 T , Ω 3 , 6 = N 2 K ˇ 3 K ˇ 2 N 5 T , Ω 3 , 7 = N 2 G ˇ + K ˇ 2 N 6 T , Ω 3 , 8 = N 2 ( H ˇ K ˇ 4 ) + K ˇ 2 N 7 T , Ω 4 , 4 = R 1 N 3 A ˇ A ˇ T N 3 T , Ω 4 , 5 = N 3 B ˇ A ˇ T N 4 T , Ω 4 , 6 = N 3 K ˇ 3 + A ˇ T N 5 T , Ω 4 , 7 = N 3 G ˇ A ˇ T N 6 T , Ω 4 , 8 = N 3 ( H ˇ K ˇ 4 ) A ˇ T N 7 T , Ω 5 , 5 = R 2 N 4 B ˇ B ˇ T N 4 T , Ω 5 , 6 = N 4 K ˇ 3 + B ˇ T N 5 T , Ω 5 , 7 = N 4 G ˇ B ˇ T N 6 T , Ω 5 , 8 = N 4 ( H ˇ K ˇ 4 ) B ˇ T N 7 T , Ω 6 , 6 = N 5 K ˇ 3 K ˇ 3 N 5 T , Ω 6 , 7 = N 5 G ˇ + K ˇ 3 N 6 T , Ω 6 , 8 = N 5 ( H ˇ K ˇ 4 ) + K ˇ 3 N 7 T , Ω 7 , 7 = G ˇ T P G ˇ N 6 G ˇ G ˇ T N 6 T , Ω 7 , 8 = N 6 ( H ˇ K ˇ 4 ) G ˇ T N 7 T , Ω 8 , 8 = ( H ˇ K ˇ 4 ) T P ( H ˇ K ˇ 4 ) N 7 ( H ˇ K ˇ 4 ) ( H ˇ K ˇ 4 ) T N 7 T , and P R 8 N × 8 N is a positive definite matrix, R 1 , R 2 R 8 N × 8 N are diagonal positive definite matrices, N 1 , , N 7 R 8 N × 8 N are any matrices, and ϕ is a positive real number.
Proof. 
Define the following Lyapunov-like functional:
V ( t ) = r ˇ T ( t ) P r ˇ ( t ) .
Using Lemma 1 and taking the fractional-order derivative of the function defined above, along the trajectories of System (7), we obtain:
D 0 α V ( t ) + ϕ V ( t ) r ˇ ( t ) T P D 0 α r ˇ ( t ) + D 0 α r ˇ ( t ) T P r ˇ ( t ) + ϕ r ˇ ( t ) T P r ˇ ( t ) = r ˇ ( t ) T P ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 r ˇ ( t π ( t ) ) K ˇ 3 t ε t r ˇ ( s ) d s + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) + ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 r ˇ ( t π ( t ) ) K ˇ 3 t ε t r ˇ ( s ) d s + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) T P r ˇ ( t ) + ϕ r ˇ ( t ) T P r ˇ ( t ) = r ˇ ( t ) T P ( C ˇ + K ˇ 1 ) r ˇ ( t ) r ˇ ( t ) T P K ˇ 2 r ˇ ( t π ( t ) ) r ˇ ( t ) T P K ˇ 3 t ε t r ˇ ( s ) d s + r ˇ ( t ) T P A ˇ f ˇ ( r ˇ ( t ) ) + r ˇ ( t ) T P B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + r ˇ ( t ) T P G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + r ˇ ( t ) T P ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) r ˇ ( t ) T ( C ˇ + K ˇ 1 ) P r ˇ ( t ) r ˇ ( t π ( t ) ) T K ˇ 2 P r ˇ ( t ) t ε t r ˇ ( s ) d s T K ˇ 3 P r ˇ ( t ) + f ˇ ( r ˇ ( t ) ) T A ˇ T P r ˇ ( t ) + f ˇ ( r ˇ ( t π ( t ) ) ) T B ˇ T P r ˇ ( t ) + t ε t f ˇ ( r ˇ ( s ) ) d s T G ˇ T P r ˇ ( t ) + D γ α r ˇ ( t γ ) T ( H ˇ K ˇ 4 ) P r ˇ ( t ) + ϕ r ˇ ( t ) T P r ˇ ( t ) .
If we take Q = P 1 in Lemma 3, we obtain that:
r ˇ ( t ) T P G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + t ε t f ˇ ( r ˇ ( s ) ) d s T G ˇ T P r ˇ ( t ) r ˇ ( t ) T P P 1 P r ˇ ( t ) + t ε t f ˇ ( r ˇ ( s ) ) d s T G ˇ T P G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s ,
r ˇ ( t ) T P ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) + D γ α r ˇ ( t γ ) T ( H ˇ K ˇ 4 ) P r ˇ ( t ) r ˇ ( t ) T P P 1 P r ˇ ( t ) + D γ α r ˇ ( t γ ) T ( H ˇ K ˇ 4 ) T P ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) .
Now, Inequality (19) becomes:
D 0 α V ( t ) + ϕ V ( t ) r ˇ ( t ) T P ( C ˇ + K ˇ 1 ) r ˇ ( t ) r ˇ ( t ) T ( C ˇ + K ˇ 1 ) P r ˇ ( t ) r ˇ ( t ) T P K ˇ 2 r ˇ ( t π ( t ) ) r ˇ ( t π ( t ) ) T K ˇ 2 P r ˇ ( t ) r ˇ ( t ) T P K ˇ 3 t ε t r ˇ ( s ) d s t ε t r ˇ ( s ) d s T K ˇ 3 P r ˇ ( t ) + r ˇ ( t ) T P A ˇ f ˇ ( r ˇ ( t ) ) + f ˇ ( r ˇ ( t ) ) T A ˇ T P r ˇ ( t ) + r ˇ ( t ) T P B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + f ˇ ( r ˇ ( t π ( t ) ) ) T B ˇ T P r ˇ ( t ) + r ˇ ( t ) T P r ˇ ( t ) + t ε t f ˇ ( r ˇ ( s ) ) d s T G ˇ T P G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + r ˇ ( t ) T P r ˇ ( t ) + D γ α r ˇ ( t γ ) T ( H ˇ K ˇ 4 ) T P ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) + ϕ r ˇ ( t ) T P r ˇ ( t ) .
Assumption 1 allows us to ascertain the existence of positive definite diagonal matrices R 1 and R 2 for which the following inequalities are valid t [ 0 , + ) :
0 r ˇ ( t ) T L ˇ T R 1 L ˇ r ˇ ( t ) f ˇ ( r ˇ ( t ) ) T R 1 f ˇ ( r ˇ ( t ) ) ,
0 r ˇ ( t π ( t ) ) T L ˇ T R 2 L ˇ r ˇ ( t π ( t ) ) f ˇ ( r ˇ ( t π ( t ) ) ) T R 2 f ˇ ( r ˇ ( t π ( t ) ) ) .
On the other hand, there exist any matrices N 1 , N 2 , N 3 , N 4 , N 5 , N 6 , N 7 such that the subsequent identity is true:
0 = D 0 α r ˇ ( t ) T N 1 + r ˇ ( t π ( t ) ) T N 2 f ˇ ( r ˇ ( t ) ) T N 3 f ˇ ( r ˇ ( t π ( t ) ) ) T N 4 + t ε t r ˇ ( s ) d s T N 5 t ε t f ˇ ( r ˇ ( s ) ) d s T N 6 D γ α r ˇ ( t γ ) T N 7 × D 0 α r ˇ ( t ) ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 r ˇ ( t π ( t ) ) K ˇ 3 t ε t r ˇ ( s ) d s + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) .
By taking the transpose of Identity (25) and adding them both, as well as Inequalities (23)–(24) to (22), we have that:
D 0 α V ( t ) + ϕ V ( t ) ζ T ( t ) Ω ζ ( t ) ,
where Ω is given in (18), and
ζ ( t ) = r ˇ ( t ) T D 0 α r ˇ ( t ) T r ˇ ( t π ( t ) ) T f ˇ ( r ˇ ( t ) ) T f ˇ ( r ˇ ( t π ( t ) ) ) T t ε t r ˇ ( s ) d s T t ε t f ˇ ( r ˇ ( s ) ) d s T D γ α r ˇ ( t γ ) T T .
Condition (18) tells us that Ω < 0 , from which we obtain that:
D 0 α V ( t ) + ϕ V ( t ) 0 .
From Lemma 6 we obtain that:
V ( t ) V ( 0 ) E α ( ϕ t α ) ,
or, equivalently,
λ min ( P ) | | r ˇ ( t ) | | 2 r ˇ ( t ) T P r ˇ ( t ) r ˇ ( 0 ) T P r ˇ ( 0 ) E α ( ϕ t α ) λ max ( P ) | | r ˇ ( 0 ) | | 2 E α ( ϕ t α ) λ max ( P ) | | ψ ˇ | | 2 E α ( ϕ t α ) ,
and, finally,
| | r ˇ ( t ) | | λ max ( P ) λ min ( P ) | | ψ ˇ | | E α ( ϕ t α ) 1 2 .
This means that Systems (1) and (2) are Mittag–Leffler synchronized on the basis of Control Scheme (5), which is what we needed to prove. □
We will now employ a different state feedback controller to obtain another condition for the Mittag–Leffler synchronization between Drive System (1) and Response System (2), for which the controller will be given by:
u i ( t ) = k i 1 r i ( t ) + k i 2 sign ( r i ( t ) ) | r i ( t π ( t ) ) | + k i 3 sign ( r i ( t ) ) t ε t | r i ( s ) | d s + k i 4 sign ( r i ( t ) ) D γ α r i ( t γ ) ,
where k i 1 , k i 2 , k i 3 , k i 4 R + , i { 1 , , N } , represent the control gain parameters. In this case, System (3) will have the form:
D 0 α r i ( t ) = ( c i + k i 1 ) r i ( t ) k i 2 sign ( r i ( t ) ) | r i ( t π ( t ) ) | k i 3 sign ( r i ( t ) ) t ε t | r i ( s ) | d s k i 4 sign ( r i ( t ) ) D γ α 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 π ( t ) ) ) + j = 1 N g i j t ε t f ˜ j ( r j ( s ) ) d s + h i D γ α r i ( t γ ) ,
i { 1 , , N } .
In matrix form, we can write System (27) as:
D 0 α r ˇ ( t ) = ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 sign ( r ˇ ( t ) ) | r ˇ ( t π ( t ) ) | K ˇ 3 sign ( r ˇ ( t ) ) t ε t | r ˇ ( s ) | d s K ˇ 4 sign ( r ˇ ( t ) ) D γ α r ˇ ( t γ ) + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + H ˇ D γ α r ˇ ( t γ ) ,
where K ˇ 1 : = diag ( k 11 I 8 , k 21 I 8 , , k N 1 I 8 ) R 8 N × 8 N , K ˇ 2 : = diag ( k 12 I 8 , k 22 I 8 , , k N 2 I 8 ) R 8 N × 8 N ,
K ˇ 3 : = diag ( k 13 I 8 , k 23 I 8 , , k N 3 I 8 ) R 8 N × 8 N , K ˇ 4 : = diag ( k 14 I 8 , k 24 I 8 , , k N 4 I 8 ) R 8 N × 8 N , and ⊙ represents the elementwise vector product.
Theorem 4.
Systems (1) and (2) are Mittag–Leffler synchronized under Control Scheme (27) if the subsequent LMIs are true:
C ˇ + K ˇ 1 | A ˇ | L ˇ > 0 , K ˇ 2 | B ˇ | L ˇ > 0 , K ˇ 3 | G ˇ | L ˇ > 0 , K ˇ 4 | H ˇ | > 0 .
Proof. 
Define the following Lyapunov-like functional:
V ( t ) = 1 2 r ˇ ( t ) T r ˇ ( t ) .
Using Lemma 1 and taking the fractional-order derivative of the function defined above, along the trajectories of System (28), we obtain:
D 0 α V ( t ) = D 0 α 1 2 r ˇ ( t ) T r ˇ ( t ) r ˇ ( t ) T D 0 α r ˇ ( t ) = r ˇ ( t ) T ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 sign ( r ˇ ( t ) ) | r ˇ ( t π ( t ) ) | K ˇ 3 sign ( r ˇ ( t ) ) t ε t | r ˇ ( s ) | d s K ˇ 4 sign ( r ˇ ( t ) ) D γ α r ˇ ( t γ ) + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + H ˇ D γ α r ˇ ( t γ ) = r ˇ ( t ) T ( C ˇ + K ˇ 1 ) r ˇ ( t ) | r ˇ ( t ) | T K ˇ 2 | r ˇ ( t π ( t ) ) | | r ˇ ( t ) | T K ˇ 3 t ε t | r ˇ ( s ) | d s | r ˇ ( t ) | T K ˇ 4 D γ α r ˇ ( t γ ) + r ˇ ( t ) T A ˇ f ˇ ( r ˇ ( t ) ) + r ˇ ( t ) T B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + r ˇ ( t ) T G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + r ˇ ( t ) T H ˇ D γ α r ˇ ( t γ ) | r ˇ ( t ) | T ( C ˇ + K ˇ 1 ) | r ˇ ( t ) | | r ˇ ( t ) | T K ˇ 2 | r ˇ ( t π ( t ) ) | | r ˇ ( t ) | T K ˇ 3 t ε t | r ˇ ( s ) | d s | r ˇ ( t ) | T K ˇ 4 D γ α r ˇ ( t γ ) + | r ˇ ( t ) | T | A ˇ | L ˇ | r ˇ ( t ) | + | r ˇ ( t ) | T | B ˇ | L ˇ | r ˇ ( t π ( t ) ) | + | r ˇ ( t ) | T | G ˇ | L ˇ t ε t | r ˇ ( s ) | d s + | r ˇ ( t ) | T | H ˇ | D γ α r ˇ ( t γ ) = | r ˇ ( t ) | T ( ( C ˇ + K ˇ 1 ) + | A ˇ | L ˇ ) | r ˇ ( t ) | + | r ˇ ( t ) | T ( K ˇ 2 + | B ˇ | L ˇ ) | r ˇ ( t π ( t ) ) | + | r ˇ ( t ) | T ( K ˇ 3 + | G ˇ | L ˇ ) t ε t | r ˇ ( s ) | d s + | r ˇ ( t ) | T ( K ˇ 4 + | H ˇ | ) D γ α r ˇ ( t γ ) .
Using Conditions (29), Inequality (30) becomes:
D 0 α V ( t ) | r ˇ ( t ) | T ( C ˇ + K ˇ 1 | A ˇ | L ) | r ˇ ( t ) | λ V ( t ) ,
where λ = 2 λ min ( C ˇ + K ˇ 1 | A ˇ | L ) . From Lemma 6, we obtain:
V ( t ) V ( 0 ) E α ( λ t α ) , t [ 0 , + ) ,
which is equivalent with:
1 2 | | r ˇ ( t ) | | 2 1 2 | | r ˇ ( 0 ) | | 2 E α ( λ t α ) 1 2 | | ψ ˇ | | 2 E α ( λ t α ) , t [ 0 , + ) ,
yielding
| | r ˇ ( t ) | | | | ψ ˇ | | [ E α ( λ t α ) ] 1 2 , t [ 0 , + ) .
This means that Systems (1) and (2) are Mittag–Leffler synchronized using Control Scheme (27), which is what we needed to prove. □
Remark 2.
Theorems 3 and 4 give sufficient conditions expressed in terms of LMIs using two types of state feedback controllers for the Mittag–Leffler synchronization of FOOVNNs with neutral-type, time-varying, and distributed delays. The Mittag–Leffler synchronization of delayed FOCVNNs was discussed in the literature, for example, in [32,67]. The same property was studied for FOQVNNs with different types of delays, for example, in [29,35,68]. The Mittag–Leffler synchronization of delayed FOOVNNs has never been presented in the literature, to our knowledge. Again, our model is more general than the ones discussed in the existing research, and thus, the results obtained are not directly comparable with the available results, but they can be particularized for FOCVNNs or FOQVNNs with neutral-type, time-varying, and/or distributed delays.

4. Numerical Examples

In all of the experiments, we take α = 0.75 .
Example 1.
Define the following two-neuron FOOVNN with neutral-type, time-varying, and distributed delays:
D 0 α o i ( t ) = c i o i ( t ) + j = 1 2 a i j f j ( o j ( t ) ) + j = 1 2 b i j f j ( o j ( t π ( t ) ) ) + j = 1 2 g i j t ε t f j ( o j ( s ) ) d s + h i D γ α o i ( t γ ) + I i ,
i { 1 , 2 } and t [ 0 , + ) .
System (31) will be taken as the drive system, and the response system will be the following system:
D 0 α p i ( t ) = c i p i ( t ) + j = 1 2 a i j f j ( p j ( t ) ) + j = 1 2 b i j f j ( p j ( t π ( t ) ) ) + j = 1 2 g i j t ε t f j ( p j ( s ) ) d s + h i D γ α p i ( t γ ) + I i u i ( t ) ,
i { 1 , 2 } and t [ 0 , + ) . If we denote r i ( t ) = p i ( t ) o i ( t ) , taking (31) and (32) into account, the expression of the error system is given as:
D 0 α 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 π ( t ) ) ) + j = 1 2 g i j t ε t f ˜ j ( r j ( s ) ) d s + h i D γ α r i ( t γ ) u i ( t ) ,
i { 1 , 2 } and t [ 0 , + ) , where f ˜ j ( r j ( t ) ) = f j ( r j ( t ) + o j ( t ) ) f j ( o j ( t ) ) , t [ 0 , + ) and j { 1 , 2 } .
In order to realize synchronization between Systems (31) and (32) , we will use the following state feedback controller:
u i ( t ) = k i 1 r i ( t ) + k i 2 r i ( t π ( t ) ) + k i 3 t ε t r i ( s ) d s + k i 4 D γ α r i ( t γ ) ,
and k i 1 , k i 2 , k i 3 , k i 4 R + , i { 1 , 2 } represent the control gain parameters.
With this controller, System (33) can be written in matrix form as:
D 0 α r ˇ ( t ) = ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 r ˇ ( t π ( t ) ) K ˇ 3 t ε t r ˇ ( s ) d s + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + ( H ˇ K ˇ 4 ) D γ α r ˇ ( t γ ) .
The choice of parameters is the following:
C = 3 0 0 4 ,
A = a 11 a 12 a 21 a 22 ,
a 11 = 0.7 e 0 + 0.9 e 1 0.2 e 2 + 0.4 e 3 + 0.2 e 4 + 0.8 e 5 + 0.3 e 6 + 0.9 e 7 ,
a 12 = 0.3 e 0 + 0.9 e 1 0.2 e 2 0.2 e 3 + 0.5 e 4 + 0.8 e 5 + 0.8 e 6 0.9 e 7 ,
a 21 = 0.2 e 0 0.4 e 1 + 0.2 e 2 0.2 e 3 + 0.3 e 4 + 0.2 e 5 0.5 e 6 + 0.2 e 7 ,
a 22 = 0.4 e 0 + 0.3 e 1 + 0.1 e 2 + 0.4 e 3 0.2 e 4 0.8 e 5 + 0.8 e 6 + 0.9 e 7 ,
B = b 11 b 12 b 21 b 22 ,
b 11 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
b 12 = 0.8 e 0 + 0.5 e 1 + 0.3 e 2 0.5 e 3 + 0.8 e 4 + 0.9 e 5 0.9 e 6 + 0.8 e 7 ,
b 21 = 0.3 e 0 + 0.2 e 1 0.2 e 2 + 0.1 e 3 + 0.8 e 4 + 0.9 e 5 + 0.7 e 6 + 0.9 e 7 ,
b 22 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.8 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
G = g 11 g 12 g 21 g 22 ,
g 11 = 0.2 e 0 + 0.4 e 1 + 0.5 e 2 + 0.3 e 3 0.6 e 4 + 0.2 e 5 0.4 e 6 + 0.5 e 7 ,
g 12 = 0.3 e 0 + 0.5 e 1 + 0.2 e 2 0.5 e 3 + 0.3 e 4 + 0.1 e 5 0.2 e 6 + 0.3 e 7 ,
g 21 = 0.1 e 0 + 0.3 e 1 0.2 e 2 + 0.1 e 3 + 0.2 e 4 + 0.1 e 5 + 0.3 e 6 + 0.4 e 7 ,
g 22 = 0.3 e 0 + 0.1 e 1 + 0.2 e 2 + 0.5 e 3 + 0.4 e 4 0.2 e 5 0.1 e 6 + 0.5 e 7 ,
H = h 1 0 0 h 2 ,
h 1 = 0.1 e 0 + 0.4 e 1 + 0.3 e 2 0.5 e 3 + 0.2 e 4 + 0.3 e 5 0.4 e 6 + 0.5 e 7 ,
h 2 = 0.2 e 0 + 0.1 e 1 + 0.2 e 2 + 0.3 e 3 + 0.5 e 4 0.3 e 5 0.4 e 6 + 0.2 e 7 ,
f j ( o ) = 1 20 2 q = 0 7 f j q ( o ) e q = 1 20 2 q = 0 7 1 1 + exp ( o q ) e q , o O , j { 1 , 2 } ,
from which we deduce that the activation functions satisfy Assumption 1, and L ˇ = 0.025 I 8 0 0 0.025 I 8 . The control gain matrices are the following:
K 1 = 0.1 0 0 0.2 , K 2 = 0.2 0 0 0.3 , K 3 = 0.3 0 0 0.2 , K 4 = 0.4 0 0 0.3 .
Additionally, π ( t ) = 0.4 | cos t | , ε = 0.3 , γ = 0.01 , hence, π = 0.4 , ς = max { π , ε , γ } = 0.4 , ϕ = 4 , v 1 = 2 , v 2 = 2 , and v 3 = 2 . Based on the above parameters, we conclude that the hypotheses of Theorem 1 are satisfied, and the LMI is solved to give R 1 = d i a g ( 1.196 I 8 , 2.3816 I 8 ) and R 2 = d i a g ( 2.5154 I 8 , 2.6213 I 8 ) (in order not to clutter the paper, the values of the other matrices are not provided). Thus, Systems (31) and (32) are asymptotically synchronized using Control Scheme (34).
Figure 1 and Figure 2 depict the trajectories of octonion states r ˇ 1 and r ˇ 2 of System (35), with 8 initial points.
Example 2.
In the second example, we realize the synchronization between Systems (31) and (32) based on State Feedback Controller (34), but this time with the subsequent parameters:
C = 0.2 0 0 0.3 ,
A = a 11 a 12 a 21 a 22 ,
a 11 = 0.7 e 0 + 0.9 e 1 0.2 e 2 + 0.4 e 3 + 0.2 e 4 + 0.8 e 5 + 0.3 e 6 + 0.9 e 7 ,
a 12 = 0.3 e 0 + 0.9 e 1 0.2 e 2 0.2 e 3 + 0.5 e 4 + 0.8 e 5 + 0.8 e 6 0.9 e 7 ,
a 21 = 0.2 e 0 0.4 e 1 + 0.2 e 2 0.2 e 3 + 0.3 e 4 + 0.2 e 5 0.5 e 6 + 0.2 e 7 ,
a 22 = 0.4 e 0 + 0.3 e 1 + 0.1 e 2 + 0.4 e 3 0.2 e 4 0.8 e 5 + 0.8 e 6 + 0.9 e 7 ,
B = b 11 b 12 b 21 b 22 ,
b 11 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
b 12 = 0.8 e 0 + 0.5 e 1 + 0.3 e 2 0.5 e 3 + 0.8 e 4 + 0.9 e 5 0.9 e 6 + 0.8 e 7 ,
b 21 = 0.3 e 0 + 0.2 e 1 0.2 e 2 + 0.1 e 3 + 0.8 e 4 + 0.9 e 5 + 0.7 e 6 + 0.9 e 7 ,
b 22 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.8 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
G = g 11 g 12 g 21 g 22 ,
g 11 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
g 12 = 0.9 e 0 + 0.5 e 1 + 0.3 e 2 0.5 e 3 + 0.8 e 4 + 0.9 e 5 0.9 e 6 + 0.7 e 7 ,
g 21 = 0.3 e 0 + 0.2 e 1 0.2 e 2 + 0.1 e 3 + 0.8 e 4 + 0.9 e 5 + 0.8 e 6 + 0.9 e 7 ,
g 22 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.9 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
H = h 1 0 0 h 2 ,
h 1 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
h 2 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.9 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
f j ( o ) = 1 2 2 q = 0 7 f j q ( o ) e q = 1 2 2 q = 0 7 1 1 + exp ( o q ) e q , o O , j { 1 , 2 } ,
from which we deduce that the activation functions satisfy Assumption 1 and L ˇ = 0.25 I 8 0 0 0.25 I 8 . The control gain matrices are the following:
K 1 = 5 0 0 6 , K 2 = 0.1 0 0 0.1 , K 3 = 0.2 0 0 0.2 .
Now, we take π ( t ) = 0.3 | sin t | , ε = 0.05 , γ = 0 (no neutral-type delay), from which we have π = 0.3 , ς = max { π , ε , γ } = 0.3 , ω i = 1 , i { 1 , , 16 } , ρ = 1.5 > 1 , ϕ = 1.6 , v 1 = 3.5 , and v 2 = 4.5 . All the hypotheses of Theorem 2 are now satisfied, thus allowing us to conclude that Drive System (31) and Response System (32) are asymptotically synchronized using Control Scheme (34).
Example 3.
For the next example, we again study the synchronization between Systems (31) and (32) based on State Feedback Controller (34) with the following parameters:
C = 4 0 0 5 ,
A = a 11 a 12 a 21 a 22 ,
a 11 = 0.7 e 0 + 0.9 e 1 0.2 e 2 + 0.4 e 3 + 0.2 e 4 + 0.8 e 5 + 0.3 e 6 + 0.9 e 7 ,
a 12 = 0.3 e 0 + 0.9 e 1 0.2 e 2 0.2 e 3 + 0.5 e 4 + 0.8 e 5 + 0.8 e 6 0.9 e 7 ,
a 21 = 0.2 e 0 0.4 e 1 + 0.2 e 2 0.2 e 3 + 0.3 e 4 + 0.2 e 5 0.5 e 6 + 0.2 e 7 ,
a 22 = 0.4 e 0 + 0.3 e 1 + 0.1 e 2 + 0.4 e 3 0.2 e 4 0.8 e 5 + 0.8 e 6 + 0.9 e 7 ,
B = b 11 b 12 b 21 b 22 ,
b 11 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
b 12 = 0.8 e 0 + 0.5 e 1 + 0.3 e 2 0.5 e 3 + 0.8 e 4 + 0.9 e 5 0.9 e 6 + 0.8 e 7 ,
b 21 = 0.3 e 0 + 0.2 e 1 0.2 e 2 + 0.1 e 3 + 0.8 e 4 + 0.9 e 5 + 0.7 e 6 + 0.9 e 7 ,
b 22 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.8 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
G = g 11 g 12 g 21 g 22 ,
g 11 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
g 12 = 0.9 e 0 + 0.5 e 1 + 0.3 e 2 0.5 e 3 + 0.8 e 4 + 0.9 e 5 0.9 e 6 + 0.7 e 7 ,
g 21 = 0.3 e 0 + 0.2 e 1 0.2 e 2 + 0.1 e 3 + 0.8 e 4 + 0.9 e 5 + 0.8 e 6 + 0.9 e 7 ,
g 22 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.9 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
H = h 1 0 0 h 2 ,
h 1 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
h 2 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.9 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
f j ( o ) = 1 20 2 q = 0 7 f j q ( o ) e q = 1 20 2 q = 0 7 1 1 + exp ( o q ) e q , o O , j { 1 , 2 } ,
from which we deduce that the activation functions satisfy Assumption 1 and L ˇ = 0.025 I 8 0 0 0.025 I 8 . The control gain matrices are the following:
K 1 = 0.2 0 0 0.1 , K 2 = 0.2 0 0 0.3 , K 3 = 0.3 0 0 0.1 , K 4 = 0.4 0 0 0.3 .
The delays are taken as π ( t ) = 0.4 | cos t | , ε = 0.5 , and γ = 0.03 , from which we have π = 0.4 , ς = max { π , ε , γ } = 0.5 , ϕ = 4.5 , v 1 = 2.7 , v 2 = 2.2 , and v 3 = 2.3 . All the hypotheses of Theorem 3 are now satisfied, and the LMI is solved to give R 1 = d i a g ( 1.5005 I 8 , 1.6806 I 8 ) and R 2 = d i a g ( 1.7819 I 8 , 1.8129 I 8 ) (in order not to clutter the paper, the values of the other matrices are not provided), thus allowing us to conclude that Drive System (31) and Response System (32) are Mittag–Leffler synchronized using Control Scheme (34).
Example 4.
For the last example, the same Systems (31) and (32) are considered as drive and response systems, respectively, but this time, a different feedback controller will be used to achieve synchronization:
u i ( t ) = k i 1 r i ( t ) + k i 2 s i g n ( r i ( t ) ) | r i ( t π ( t ) ) | + k i 3 s i g n ( r i ( t ) ) t ε t | r i ( s ) | d s + k i 4 s i g n ( r i ( t ) ) D γ α r i ( t γ ) ,
where k i 1 , k i 2 , k i 3 , k i 4 R + , i { 1 , 2 } represent the control gain parameters. With this controller, System (33) can be written in matrix form as:
D 0 α r ˇ ( t ) = ( C ˇ + K ˇ 1 ) r ˇ ( t ) K ˇ 2 s i g n ( r ˇ ( t ) ) | r ˇ ( t π ( t ) ) | K ˇ 3 s i g n ( r ˇ ( t ) ) t ε t | r ˇ ( s ) | d s K ˇ 4 s i g n ( r ˇ ( t ) ) D γ α r ˇ ( t γ ) + A ˇ f ˇ ( r ˇ ( t ) ) + B ˇ f ˇ ( r ˇ ( t π ( t ) ) ) + G ˇ t ε t f ˇ ( r ˇ ( s ) ) d s + H ˇ D γ α r ˇ ( t γ ) .
The parameters will now be the following:
C = 1 0 0 2 ,
A = a 11 a 12 a 21 a 22 ,
a 11 = 0.7 e 0 + 0.9 e 1 0.2 e 2 + 0.4 e 3 + 0.2 e 4 + 0.8 e 5 + 0.3 e 6 + 0.9 e 7 ,
a 12 = 0.3 e 0 + 0.9 e 1 0.2 e 2 0.2 e 3 + 0.5 e 4 + 0.8 e 5 + 0.8 e 6 0.9 e 7 ,
a 21 = 0.2 e 0 0.4 e 1 + 0.2 e 2 0.2 e 3 + 0.3 e 4 + 0.2 e 5 0.5 e 6 + 0.2 e 7 ,
a 22 = 0.4 e 0 + 0.3 e 1 + 0.1 e 2 + 0.4 e 3 0.2 e 4 0.8 e 5 + 0.8 e 6 + 0.9 e 7 ,
B = b 11 b 12 b 21 b 22 ,
b 11 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
b 12 = 0.8 e 0 + 0.5 e 1 + 0.3 e 2 0.5 e 3 + 0.8 e 4 + 0.9 e 5 0.9 e 6 + 0.8 e 7 ,
b 21 = 0.3 e 0 + 0.2 e 1 0.2 e 2 + 0.1 e 3 + 0.8 e 4 + 0.9 e 5 + 0.7 e 6 + 0.9 e 7 ,
b 22 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.8 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
G = g 11 g 12 g 21 g 22 ,
g 11 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
g 12 = 0.9 e 0 + 0.5 e 1 + 0.3 e 2 0.5 e 3 + 0.8 e 4 + 0.9 e 5 0.9 e 6 + 0.7 e 7 ,
g 21 = 0.3 e 0 + 0.2 e 1 0.2 e 2 + 0.1 e 3 + 0.8 e 4 + 0.9 e 5 + 0.8 e 6 + 0.9 e 7 ,
g 22 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.9 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
H = h 1 0 0 h 2 ,
h 1 = 0.4 e 0 + 0.7 e 1 + 0.2 e 2 + 0.5 e 3 0.9 e 4 + 0.9 e 5 0.8 e 6 + 0.9 e 7 ,
h 2 = 0.5 e 0 + 0.5 e 1 + 0.2 e 2 + 0.4 e 3 + 0.9 e 4 0.9 e 5 0.8 e 6 + 0.7 e 7 ,
f j ( o ) = 1 2 2 q = 0 7 f j q ( o ) e q = 1 2 2 q = 0 7 1 1 + exp ( o q ) e q , o O , j { 1 , 2 } ,
from which we deduce that the activation functions satisfy Assumption 1 and L ˇ = 0.25 I 8 0 0 0.25 I 8 . The control gain matrices are the following:
K 1 = 2 0 0 1 , K 2 = 3 0 0 4 , K 3 = 5 0 0 2 , K 4 = 7 0 0 5 .
The delays are π ( t ) = 0.3 | sin t | , ε = 0.4 , γ = 0.02 , so π = 0.3 and ς = max { π , ε , γ } = 0.4 . The LMI hypotheses of Theorem 4 are easily verified to be true; thus, we can conclude that Systems (31) and (32) are Mittag–Leffler synchronized using Control Scheme (36).
Figure 3 and Figure 4 depict the trajectories of octonion states r ˇ 1 and r ˇ 2 of System (37), with 8 initial points.

5. Conclusions

The very general FOOVNN model with neutral-type, time-varying, and distributed delays was discussed in this paper, to our awareness, for the first time in the literature. Sufficient criteria expressed by LMIs and algebraic inequalities were deduced, guaranteeing the asymptotic and Mittag–Leffler synchronization of these FOOVNNs by means of two different state feedback control schemes. The octonion-valued system of equations was transformed into a real-valued one, in order to avoid the non-associativity problem of the octonion algebra. Two types of Lyapunov-like functions were used in conjunction with two Halanay-type lemmas designed specifically for FONNs. Additionally, in order to reduce the conservativeness of the obtained conditions, the free-weighting matrix method, a classical lemma, and Young’s inequality were employed. Each of the four theorems formulated in the paper was illustrated using a numerical simulation.
The methods used in the present work are general enough that they can be applied to study other types of dynamic properties for other types of FOOVNNs, which constitute promising future work directions. Additionally, the theorems put forward in the study can be particularized for FOCVNNs and FOQVNNs, for which the respective results do not exist in the literature for models with so many types of delays.

Funding

Funding was provided by a grant of the Ministry of Research, Innovation and Digitization, project number PN-III-P1-1.1-PD-2021-0345.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

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

Acknowledgments

This work was supported by a grant of the Ministry of Research, Innovation and Digitization, CNCS—UEFISCDI, project number PN-III-P1-1.1-PD-2021-0345, within PNCDI III.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Popa, C.A. Octonion-Valued Neural Networks. In Proceedings of the Artificial Neural Networks and Machine Learning—ICANN 2016, Barcelona, Spain, 6–9 September 2016; pp. 435–443. [Google Scholar] [CrossRef]
  2. Snopek, K.M. Quaternions and Octonions in Signal Processing—Fundamentals and Some New Results. Prz. Telekomun.+Wiad. Telekomun. 2015, 6, 618–622. [Google Scholar] [CrossRef]
  3. Wang, R.; Xiang, G.; Zhang, F. L1-norm minimization for octonion signals. In Proceedings of the 2016 International Conference on Audio, Language and Image Processing (ICALIP), Shanghai, China, 11–12 July 2016. [Google Scholar] [CrossRef]
  4. Błaszczyk, L.; Snopek, K.M. Octonion Fourier Transform of real-valued functions of three variables—Selected properties and examples. Signal Process. 2017, 136, 29–37. [Google Scholar] [CrossRef]
  5. Gao, H.Y.; Lam, K.M. From quaternion to octonion: Feature-based image saliency detection. In Proceedings of the 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Florence, Italy, 4–9 May 2014. [Google Scholar] [CrossRef]
  6. Gao, H.Y.; Lam, K.M. Salient object detection using octonion with Bayesian inference. In Proceedings of the 2014 IEEE International Conference on Image Processing (ICIP), Paris, France, 27–30 October 2014. [Google Scholar] [CrossRef]
  7. Bauer, S.; Leon, F.P. Hyperspectral fluorescence data fusion using quaternion and octonion phase. In Proceedings of the 2016 IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI), Baden-Baden, Germany, 19–21 September 2016. [Google Scholar] [CrossRef]
  8. Chanyal, B.C. Octonion massive electrodynamics. Gen. Relativ. Gravit. 2013, 46, 1646. [Google Scholar] [CrossRef]
  9. Demir, S.; Tanişli, M. Hyperbolic octonion formulation of the fluid Maxwell equations. J. Korean Phys. Soc. 2016, 68, 616–623. [Google Scholar] [CrossRef]
  10. Demir, S. Hyperbolic Octonion Formulation of Gravitational Field Equations. Int. J. Theor. Phys. 2012, 52, 105–116. [Google Scholar] [CrossRef]
  11. Popa, C.A. Global exponential stability of neutral-type octonion-valued neural networks with time-varying delays. Neurocomputing 2018, 309, 117–133. [Google Scholar] [CrossRef]
  12. Popa, C.A. Global exponential stability of octonion-valued neural networks withleakage delay and mixed delays. Neural Netw. 2018, 105, 277–293. [Google Scholar] [CrossRef]
  13. Chouhan, S.S.; Kumar, R.; Sarkar, S.; Das, S. Multistability analysis of octonion-valued neural networks with time-varying delays. Inf. Sci. 2022, 609, 1412–1434. [Google Scholar] [CrossRef]
  14. Chouhan, S.S.; Kumar, U.; Das, S.; Cao, J. Fixed time synchronization of octonion valued neural networks with time varying delays. Eng. Appl. Artif. Intell. 2023, 118, 105684. [Google Scholar] [CrossRef]
  15. Gao, J.; Dai, L. Weighted pseudo almost periodic solutions of octonion-valued neural networks with mixed time-varying delays and leakage delays. AIMS Math. 2023, 8, 14867–14893. [Google Scholar] [CrossRef]
  16. Huang, X.; Li, Y. Weyl almost periodic solutions of octonion-valued high-order fuzzy neural networks with delays. Comput. Appl. Math. 2023, 42, 155. [Google Scholar] [CrossRef]
  17. Liu, J.G.; Zhang, Y.F.; Wang, J.J. Investigation of the Time Fractional Generalized (2+1)-Dimensional Zakharov–Kuznetsov Equation with Single-Power Law Nonlinearity. Fractals 2023, 31, 2350033. [Google Scholar] [CrossRef]
  18. Wang, K.J.; Xu, P.; Shi, F. Nonlinear Dynamic Behaviors Of The Fractional (3+1)-Dimensional Modified Zakharov–Kuznetsov Equation. Fractals 2023, 31, 23500883. [Google Scholar] [CrossRef]
  19. Kaslik, E.; Sivasundaram, S. Nonlinear dynamics and chaos in fractional-order neural networks. Neural Netw. 2012, 32, 245–256. [Google Scholar] [CrossRef] [PubMed]
  20. Korkmaz, E.; Ozdemir, A.; Yildirim, K. Asymptotical Stability of Riemann-Liouville Nonlinear Fractional Neutral Neural Networks with Time-Varying Delays. J. Math. 2022, 2022, 6832472. [Google Scholar] [CrossRef]
  21. Popa, C.A. Neutral-Type and Mixed Delays in Fractional-Order Neural Networks: Asymptotic Stability Analysis. Fractal Fract. 2022, 7, 36. [Google Scholar] [CrossRef]
  22. Pratap, A.; Raja, R.; Cao, J.; Huang, C.; Alzabut, J.; Bagdasar, O. O(t)-Synchronization and Asymptotic Synchronization of Delayed Fractional Order Neural Networks. Acta Math. Sci. 2022, 42, 1273–1292. [Google Scholar] [CrossRef]
  23. Wu, X.; Liu, S.; Wang, H. Asymptotic stability and synchronization of fractional delayed memristive neural networks with algebraic constraints. Commun. Nonlinear Sci. Numer. Simul. 2022, 114, 106694. [Google Scholar] [CrossRef]
  24. Zhang, Y.; Li, J.; Zhu, S.; Wang, H. Asymptotical stability and synchronization of Riemann–Liouville fractional delayed neural networks. Comput. Appl. Math. 2022, 42, 20. [Google Scholar] [CrossRef]
  25. Ci, J.; Guo, Z.; Long, H.; Wen, S.; Huang, T. Multiple asymptotical ω-periodicity of fractional-order delayed neural networks under state-dependent switching. Neural Netw. 2023, 157, 11–25. [Google Scholar] [CrossRef]
  26. Popa, C.A. Neutral-type, leakage, and mixed delays in fractional-order neural networks: Asymptotic synchronization analysis. AIMS Math. 2023, 8, 15969–15992. [Google Scholar] [CrossRef]
  27. Yang, D.; Yu, Y.; Hu, W.; Yuan, X.; Ren, G. Mean Square Asymptotic Stability of Discrete-Time Fractional Order Stochastic Neural Networks with Multiple Time-Varying Delays. Neural Process. Lett. 2023, 55, 9247–9268. [Google Scholar] [CrossRef]
  28. Zhang, F.; Zeng, Z. Multiple Mittag-Leffler Stability of Delayed Fractional-Order Cohen–Grossberg Neural Networks via Mixed Monotone Operator Pair. IEEE Trans. Cybern. 2021, 51, 6333–6344. [Google Scholar] [CrossRef]
  29. Chen, S.; Li, H.L.; Bao, H.; Zhang, L.; Jiang, H.; Li, Z. Global Mittag–Leffler stability and synchronization of discrete-time fractional-order delayed quaternion-valued neural networks. Neurocomputing 2022, 511, 290–298. [Google Scholar] [CrossRef]
  30. Zhang, X.L.; Li, H.L.; Kao, Y.; Zhang, L.; Jiang, H. Global Mittag-Leffler synchronization of discrete-time fractional-order neural networks with time delays. Appl. Math. Comput. 2022, 433, 127417. [Google Scholar] [CrossRef]
  31. Zheng, B.; Wang, Z. Mittag-Leffler synchronization of fractional-order coupled neural networks with mixed delays. Appl. Math. Comput. 2022, 430, 127303. [Google Scholar] [CrossRef]
  32. Shen, Y.; Zhu, S.; Liu, X.; Wen, S. Multiple Mittag-Leffler Stability of Fractional-Order Complex-Valued Memristive Neural Networks with Delays. IEEE Trans. Cybern. 2023, 53, 5815–5825. [Google Scholar] [CrossRef] [PubMed]
  33. Xu, D.N.; Li, Z.Y. Mittag-Leffler stabilization of anti-periodic solutions for fractional-order neural networks with time-varying delays. AIMS Math. 2023, 8, 1610–1619. [Google Scholar] [CrossRef]
  34. Popa, C.A.; Kaslik, E. Finite-Time Mittag–Leffler Synchronization of Neutral-Type Fractional-Order Neural Networks with Leakage Delay and Time-Varying Delays. Mathematics 2020, 8, 1146. [Google Scholar] [CrossRef]
  35. Narayanan, G.; Ali, M.S.; Alam, M.I.; Rajchakit, G.; Boonsatit, N.; Kumar, P.; Hammachukiattikul, P. Adaptive Fuzzy Feedback Controller Design for Finite-Time Mittag-Leffler Synchronization of Fractional-Order Quaternion-Valued Reaction-Diffusion Fuzzy Molecular Modeling of Delayed Neural Networks. IEEE Access 2021, 9, 130862–130883. [Google Scholar] [CrossRef]
  36. Yang, S.; Yu, J.; Hu, C.; Jiang, H. Finite-Time Synchronization of Memristive Neural Networks with Fractional-Order. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 3739–3750. [Google Scholar] [CrossRef]
  37. Li, X.; Cao, Y.; Zheng, C.; Feng, Z.; Xu, G. Finite-Time Synchronization of Fractional-Order Complex-Valued Cohen-Grossberg Neural Networks with Mixed Time Delays and State-Dependent Switching. Adv. Math. Phys. 2022, 2022, 4227067. [Google Scholar] [CrossRef]
  38. Sun, Y.; Liu, Y.; Liu, L. Asymptotic and Finite-Time Synchronization of Fractional-Order Memristor-Based Inertial Neural Networks with Time-Varying Delay. Fractal Fract. 2022, 6, 350. [Google Scholar] [CrossRef]
  39. Liu, Y.; Sun, Y. Finite-Time Synchronization for Fractional Order Fuzzy Inertial Cellular Neural Networks with Piecewise Activations and Mixed Delays. Fractal Fract. 2023, 7, 294. [Google Scholar] [CrossRef]
  40. Velmurugan, G.; Rakkiyappan, R.; Vembarasan, V.; Cao, J.; Alsaedi, A. Dissipativity and stability analysis of fractional-order complex-valued neural networks with time delay. Neural Netw. 2017, 86, 42–53. [Google Scholar] [CrossRef]
  41. Liu, W.; Jiang, M.; Fei, K. Dissipativity Analysis of Memristor-Based Fractional-Order Hybrid BAM Neural Networks with Time Delays. Int. J. Nonlinear Sci. Numer. Simul. 2019, 20, 773–785. [Google Scholar] [CrossRef]
  42. Ali, M.S.; Narayanan, G.; Nahavandi, S.; Wang, J.L.; Cao, J. Global Dissipativity Analysis and Stability Analysis for Fractional-Order Quaternion-Valued Neural Networks with Time Delays. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 4046–4056. [Google Scholar] [CrossRef]
  43. Aouiti, C.; Touati, F. Global Dissipativity of Quaternion-Valued Fuzzy Cellular Fractional-Order Neural Networks with Time Delays. Neural Process. Lett. 2022, 55, 481–503. [Google Scholar] [CrossRef]
  44. Xiao, J.; Zhong, S.; Wen, S. Unified Analysis on the Global Dissipativity and Stability of Fractional-Order Multidimension-Valued Memristive Neural Networks with Time Delay. IEEE Trans. Neural Networks Learn. Syst. 2022, 33, 5656–5665. [Google Scholar] [CrossRef] [PubMed]
  45. Liu, Y.; Zhang, C.; Li, M. Quasi-Synchronization and Dissipativity Analysis for Fractional-Order Neural Networks with Time Delay. Fractal Fract. 2023, 7, 364. [Google Scholar] [CrossRef]
  46. Aravind, R.V.; Balasubramaniam, P. Global asymptotic stability of delayed fractional-order complex-valued fuzzy cellular neural networks with impulsive disturbances. J. Appl. Math. Comput. 2022, 68, 4713–4731. [Google Scholar] [CrossRef]
  47. Cheng, J.; Zhang, H.; Zhang, W.; Zhang, H. Quasi-projective Synchronization for Caputo Type Fractional-order Complex-valued Neural Networks with Mixed Delays. Int. J. Control. Autom. Syst. 2022, 20, 1723–1734. [Google Scholar] [CrossRef]
  48. Hymavathi, M.; Muhiuddin, G.; Ali, M.S.; Al-Amri, J.F.; Gunasekaran, N.; Vadivel, R. Global Exponential Stability of Fractional Order Complex-Valued Neural Networks with Leakage Delay and Mixed Time Varying Delays. Fractal Fract. 2022, 6, 140. [Google Scholar] [CrossRef]
  49. Chen, S.; Song, Q.; Zhao, Z.; Liu, Y.; Alsaadi, F.E. Global asymptotic stability of fractional-order complex-valued neural networks with probabilistic time-varying delays. Neurocomputing 2021, 450, 311–318. [Google Scholar] [CrossRef]
  50. Song, Q.; Chen, Y.; Zhao, Z.; Liu, Y.; Alsaadi, F.E. Robust stability of fractional-order quaternion-valued neural networks with neutral delays and parameter uncertainties. Neurocomputing 2021, 420, 70–81. [Google Scholar] [CrossRef]
  51. Chen, J.; Jiang, M. Stability of Memristor-based Fractional-order Neural Networks with Mixed Time-delay and Impulsive. Neural Process. Lett. 2022, 55, 4697–4718. [Google Scholar] [CrossRef]
  52. Han, X.; Hymavathi, M.; Sanober, S.; Dhupia, B.; Ali, M.S. Robust Stability of Fractional Order Memristive BAM Neural Networks with Mixed and Additive Time Varying Delays. Fractal Fract. 2022, 6, 62. [Google Scholar] [CrossRef]
  53. Liu, P.; Kong, M.; Zeng, Z. Projective Synchronization Analysis of Fractional-Order Neural Networks with Mixed Time Delays. IEEE Trans. Cybern. 2022, 52, 6798–6808. [Google Scholar] [CrossRef]
  54. Wang, Y.; Cao, J.; Huang, C. Exploration of bifurcation for a fractional-order BAM neural network with n+2 neurons and mixed time delays. Chaos Solitons Fractals 2022, 159, 112117. [Google Scholar] [CrossRef]
  55. Xu, C.; Zhang, W.; Liu, Z.; Yao, L. Delay-induced periodic oscillation for fractional-order neural networks with mixed delays. Neurocomputing 2022, 488, 681–693. [Google Scholar] [CrossRef]
  56. Yan, H.; Qiao, Y.; Ren, Z.; Duan, L.; Miao, J. Master–slave synchronization of fractional-order memristive MAM neural networks with parameter disturbances and mixed delays. Commun. Nonlinear Sci. Numer. Simul. 2023, 120, 107152. [Google Scholar] [CrossRef]
  57. Ali, M.S.; Hymavathi, M.; Alsulami, H.; Saeed, T.; Ahmad, B. Passivity Analysis of Fractional-Order Neutral-Type Fuzzy Cellular BAM Neural Networks with Time-Varying Delays. Math. Probl. Eng. 2022, 2022, 9035736. [Google Scholar] [CrossRef]
  58. Wu, X.; Liu, S.; Wang, H.; Sun, J.; Qiao, W. Stability analysis of fractional reaction-diffusion memristor-based neural networks with neutral delays via Lyapunov functions. Neurocomputing 2023, 550, 126497. [Google Scholar] [CrossRef]
  59. Wu, X.; Liu, S.; Wang, H. Pinning synchronization of fractional memristor-based neural networks with neutral delays and reaction–diffusion terms. Commun. Nonlinear Sci. Numer. Simul. 2023, 118, 107039. [Google Scholar] [CrossRef]
  60. Podlubny, I. Fractional Differential Equations: An Introduction to Fractional Derivatives, Fractional Differential Equations, to Methods of Their Solution and Some of Their Applications; Academic Press: Cambridge, MA, USA, 1998. [Google Scholar]
  61. Duarte-Mermoud, M.A.; Aguila-Camacho, N.; Gallegos, J.A.; Castro-Linares, R. Using general quadratic Lyapunov functions to prove Lyapunov uniform stability for fractional order systems. Commun. Nonlinear Sci. Numer. Simul. 2015, 22, 650–659. [Google Scholar] [CrossRef]
  62. Cao, J.; Ho, D.W.; Huang, X. LMI-based criteria for global robust stability of bidirectional associative memory networks with time delay. Nonlinear Anal. Theory Methods Appl. 2007, 66, 1558–1572. [Google Scholar] [CrossRef]
  63. Li, Y.; Chen, Y.; Podlubny, I. Stability of fractional-order nonlinear dynamic systems: Lyapunov direct method and generalized Mittag–Leffler stability. Comput. Math. Appl. 2010, 59, 1810–1821. [Google Scholar] [CrossRef]
  64. Hou, Y.; Dai, L. S-Asymptotically ω-Periodic Solutions of Fractional-Order Complex-Valued Recurrent Neural Networks with Delays. IEEE Access 2021, 9, 37883–37893. [Google Scholar] [CrossRef]
  65. Zeng, J.; Yang, X.; Wang, L.; Chen, X. Robust Asymptotical Stability and Stabilization of Fractional-Order Complex-Valued Neural Networks with Delay. Discret. Dyn. Nat. Soc. 2021, 2021, 5653791. [Google Scholar] [CrossRef]
  66. Pahnehkolaei, S.M.A.; Alfi, A.; Machado, J.T. Delay-dependent stability analysis of the QUAD vector field fractional order quaternion-valued memristive uncertain neutral type leaky integrator echo state neural networks. Neural Netw. 2019, 117, 307–327. [Google Scholar] [CrossRef]
  67. Ali, M.S.; Narayanan, G.; Shekher, V.; Alsaedi, A.; Ahmad, B. Global Mittag-Leffler stability analysis of impulsive fractional-order complex-valued BAM neural networks with time varying delays. Commun. Nonlinear Sci. Numer. Simul. 2020, 83, 105088. [Google Scholar] [CrossRef]
  68. Yan, H.; Qiao, Y.; Duan, L.; Miao, J. Novel methods to global Mittag-Leffler stability of delayed fractional-order quaternion-valued neural networks. Neural Netw. 2021, 142, 500–508. [Google Scholar] [CrossRef] [PubMed]
Figure 1. State trajectories of octonion components of r ˇ 1 in Example 1. Different colors are used for the 8 initial points. The eight graphs depict the components r ˇ 1 q , 0 q 7 , with respect to time.
Figure 1. State trajectories of octonion components of r ˇ 1 in Example 1. Different colors are used for the 8 initial points. The eight graphs depict the components r ˇ 1 q , 0 q 7 , with respect to time.
Fractalfract 07 00830 g001
Figure 2. State trajectories of octonion components of r ˇ 2 in Example 1. Different colors are used for the 8 initial points. The eight graphs depict the components r ˇ 2 q , 0 q 7 , with respect to time.
Figure 2. State trajectories of octonion components of r ˇ 2 in Example 1. Different colors are used for the 8 initial points. The eight graphs depict the components r ˇ 2 q , 0 q 7 , with respect to time.
Fractalfract 07 00830 g002
Figure 3. State trajectories of octonion components of r ˇ 1 in Example 4. Different colors are used for the 8 initial points. The eight graphs depict the components r ˇ 1 q , 0 q 7 , with respect to time.
Figure 3. State trajectories of octonion components of r ˇ 1 in Example 4. Different colors are used for the 8 initial points. The eight graphs depict the components r ˇ 1 q , 0 q 7 , with respect to time.
Fractalfract 07 00830 g003
Figure 4. State trajectories of octonion components of r ˇ 2 in Example 4. Different colors are used for the 8 initial points. The eight graphs depict the components r ˇ 2 q , 0 q 7 , with respect to time.
Figure 4. State trajectories of octonion components of r ˇ 2 in Example 4. Different colors are used for the 8 initial points. The eight graphs depict the components r ˇ 2 q , 0 q 7 , with respect to time.
Fractalfract 07 00830 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

Popa, C.-A. Asymptotic and Mittag–Leffler Synchronization of Fractional-Order Octonion-Valued Neural Networks with Neutral-Type and Mixed Delays. Fractal Fract. 2023, 7, 830. https://doi.org/10.3390/fractalfract7110830

AMA Style

Popa C-A. Asymptotic and Mittag–Leffler Synchronization of Fractional-Order Octonion-Valued Neural Networks with Neutral-Type and Mixed Delays. Fractal and Fractional. 2023; 7(11):830. https://doi.org/10.3390/fractalfract7110830

Chicago/Turabian Style

Popa, Călin-Adrian. 2023. "Asymptotic and Mittag–Leffler Synchronization of Fractional-Order Octonion-Valued Neural Networks with Neutral-Type and Mixed Delays" Fractal and Fractional 7, no. 11: 830. https://doi.org/10.3390/fractalfract7110830

APA Style

Popa, C. -A. (2023). Asymptotic and Mittag–Leffler Synchronization of Fractional-Order Octonion-Valued Neural Networks with Neutral-Type and Mixed Delays. Fractal and Fractional, 7(11), 830. https://doi.org/10.3390/fractalfract7110830

Article Metrics

Back to TopTop