Next Article in Journal
Internet of Things Data Cloud Jobs Scheduling Using Modified Distance Cat Swarm Optimization
Next Article in Special Issue
Fault-Tolerant Consensus Control of Positive Networked Systems
Previous Article in Journal
Towards Smarter Positioning through Analyzing Raw GNSS and Multi-Sensor Data from Android Devices: A Dataset and an Open-Source Application
Previous Article in Special Issue
Extended State Observer-Based Predictive Current Control for Dual Three-Phase PMSM with High Dynamic Performance
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Communication

Positivity and Stability of Fractional-Order Coupled Neural Network with Time-Varying Delays

College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
*
Author to whom correspondence should be addressed.
Electronics 2023, 12(23), 4782; https://doi.org/10.3390/electronics12234782
Submission received: 1 November 2023 / Revised: 19 November 2023 / Accepted: 22 November 2023 / Published: 26 November 2023

Abstract

:
This brief paper analyzes the positivity and asymptotic stability of incommensurate fractional-order coupled neural networks (FOCNNs) with time-varying delays. Under a reasonable assumption about the activation functions of neurons, a sufficient and necessary condition is proposed to guarantee that FOCNNs are positive systems. Furthermore, the sufficient and necessary condition ensuring the asymptotic stability of FOCNNs is also given via introducing a linear auxiliary system. Finally, a simulation experiment was carried out to justify the effectiveness of the derived results.

1. Introduction

As an important artificial neural network, coupled neural networks (CNNs) have attracted considerable attention due to their wide range of applications in the fields of associative memories [1], bioengineering [2], pattern recognition [3], image encryption [4], and machine learning [5]. It is worth emphasizing that the application of fractional calculus for representing the electrical conductivity of biological neuron membranes, as documented in [6], has significantly propelled fractional-order coupled neural networks (FOCNNs) into the limelight. In recent years, many classical results focusing on their dynamical behaviors, such as stability, synchronization, and passivity, have been obtained. For example, in [7], the global stability of complex valued FOCNNs with nodes in unequal dimensions and time delays was analyzed using comparison theory; in [8], the stability analysis of FOCNNs with time delays was investigated; in addition, the stability of two three-dimensional FOCNNs with different ring structures and time delays were analyzed; in [9], the authors studied the quantized output feedback synchronization of FOCNNs with output coupling; in [10], the authors considered the finite-time synchronization of FOCNNs with time-varying delays; the results were proved to be applicable to the FOCNNs without time delays and integer-order neural networks; in [11], the authors innovatively introduced the concept of finite-time passivity for FOCNNs with multiple state coupling or multiple derivative coupling; in [12], based on the existing passivity definition, the authors proposed the concepts of finite-time input strict passivity, finite-time output strict passivity, and finite-time strict passivity for FOCNNs; in addition, novel delay-dependent and order-dependent sufficient conditions ensuring the passivity performances were obtained for FOCNNs. More interesting results can be found in [13,14,15,16,17,18,19].
One the other hand, positive systems theory is indispensable for researching certain actual physical systems whose quantities, including states and inputs, are non-negative, such as ecology [20] and biology [21]. Unsurprisingly, research on fractional-order positive systems has a long history, and some pioneering results have been achieved. For instance, in [22], the necessary and sufficient condition that guarantees the positivity and reachability of fractional-order linear systems (FOLSs) was given, where fractional linear continuous systems were described by a class of state equations; in [23], the authors studied robust stability of positive discrete FOLSs, and proved that the robust stability of the positive discrete FOLSs is equivalent to the robust stability of the corresponding positive discrete system of natural order; in [24], the authors analyzed the L 1 -gain performance and L 2 -gain performance of positive FOLSs, where the Mittag–Leffler stability is guaranteed using state feedback control; similarly, in [25], the authors addressed the stability problem of positive FOLSs via defining a Lyapunov function, where a state feedback controller was synthesized by means of linear programming. It is worth noting that the objects studied in the above literature are all commensurate FOLSs, i.e., the order of each subsystem is consistent. For more general incommensurate FOLSs, some fascinating work was also reported.
In [26], the sufficient and necessary condition guaranteeing the positivity of incommensurate FOLSs was introduced by virtue of the Laplace transform. In [27], the authors addressed the stability of the incommensurate FOLSs; furthermore, the stability of fractional-order nonlinear systems with multiorder couplings was proposed in a similar manner to the stability of incommensurate FOLSs. In [28], the asymptotic stability and L -gain performance of incommensurate positive FOLSs with time-varying delays were investigated, where the obtained stability condition was proved to be independent of the size of bounded delays. However, it should be noted that the systems analyzed in these results are all linear systems. To the best of the authors’ knowledge, there is almost no literature on the stability analysis of positive fractional-order nonlinear systems, particularly in the realm of positive FOCNNs. Although fractional operators, coupled dynamics, and the nonlinearity of activation functions can cause many difficulties in research, the significance of this work is evident due to the wide application of fractional calculus, positive systems, and neural networks in the realm of bioengineering for system modeling.
Drawing on the previous discussion, this paper focuses on the analysis of both positivity and stability for incommensurate FOCNNs with time-varying delays. The paper provides two fundamental conditions, both necessary and sufficient, essential for attaining positivity and asymptotic stability, in which the proposal of the latter relies on a linear auxiliary system under a reasonable assumption for activation functions. Unlike most results on the stability of CNNs with delays, the method used in this paper does not require the construction of the Lyapunov–Krasovskii function.
This paper is organized as follows. Section 2 gives some necessary preliminaries and problem descriptions. The detailed analysis procedure is presented in Section 3. Section 4 performs simulation experiments, and Section 5 concludes this work.
Notation: N , C , and C 1 symbolize the sets of natural numbers, complex numbers, and differentiable functions; R n denotes the space of the n-dimensional vector; I n is the n-dimensional identity matrix; A 0 ( 0 ) indicates that all entries of the matrix are positive (and respectively, non-negative); P > 0 denotes that the diagonal matrix is positive definite; Γ M n is an n-dimensional Metzler matrix; e j is the j-th column of the identity matrix. Moreover, λ ( A ) denotes the eigenvalues of A, and λ max ( A ) represents the largest eigenvalue of A.

2. Preliminaries and Problem Formulation

2.1. Introduction to Fractional Calculus

Definition 1
([29]). The ϑ-th fractional integral is defined as
I t ϑ f ( t ) = 1 Γ ( ϑ ) 0 t ( t ζ ) ϑ 1 f ( ζ ) d ζ ,
where Γ ( ϑ ) = 0 + t ϑ 1 e t d t is the Euler’s Gamma function, and ϑ > 0 .
Definition 2
([29]). The ϑ-th Caputo’s fractional derivative is
D t ϑ f ( t ) = 1 Γ ( n ϑ ) 0 t ( t ζ ) n 1 ϑ f ( n ) ( ζ ) d ζ ,
where n 1 < ϑ < n , and n N .
Definition 3
([29]). The Mittage–Leffler function is defined as
E a , b ( α ) = i = 0 + α i Γ ( i a + b ) ,
where a , b 0 , and α C .
The Laplace transform of (1) is
L [ t b 1 E a , b ( r t a ) ] = s a b s a + r ,
where r is a constant.
Lemma 1
([29]). If f ( t ) C 1 , one has that
I t ϑ D t ϑ f ( t ) = f ( t ) f ( 0 )
holds for all ϑ ( 0 , 1 ) .
Lemma 2
([28]). Matrix A R n × n is characterized as Metzler and Hurwitz if, and only if, there exists a column vector λ 0 , satisfying A λ 0 .

2.2. Problem Description

The following incommensurate FOCNN with time-varying delays is given:
D t ϑ α i ( t ) = A α i ( t ) + B f ( α i ( t τ ( t ) ) ) + D u i ( t ) + c j = 1 N l i j G α j ( t ) , i = 1 , , N , α i ( ι ) = ν i ( ι ) , ι [ max { τ ( t ) } , 0 ] ,
where N denotes the number of neurons, α i ( t ) = [ α i 1 ( t ) , , α i n ( t ) ] T R n and ν i ( ι ) = [ ν i 1 ( ι ) , , ν i n ( ι ) ] T R n represent the state and initial condition of the i-th neuron, respectively, f ( α i ( t ) ) = [ f 1 ( α i 1 ( t ) ) , , f n ( α i n ( t ) ) ] T R n is the activation function vector, u i ( t ) = [ u i 1 ( t ) , , u i m ( t ) ] T R m represents the input vector, and τ ( t ) 0 denotes the non-negative time-varying delay, which is bounded. ϑ = [ ϑ 1 , , ϑ n ] T R n is the order vector with ϑ p ( 0 , 1 ) ( p = 1 , , n ), and D t ϑ α i ( t ) = [ D t ϑ 1 α i 1 ( t ) , , D t ϑ n α i n ( t ) ] T R n . In addition, A , B R n × n , D R n × m . Moreover, c > 0 , L = [ l i j ] N × N R N × N , and G R n × n are the coupling strength, the outer coupling matrix, and the inner coupling matrix, respectively. It is assumed that l i j > 0 if there exists a directed weight from the j-th neuron to the i-th neuron, otherwise, l i j = 0 , and l i i = 0 . Assuming the delay satisfies that max τ ( t ) = τ ¯ , we proceed to define the positivity of the FOCNN (2) as follows.
Definition 4.
For any ι [ τ ¯ , 0 ] and t 0 , if ν i ( ι ) 0 , u i ( t ) 0 and α i ( t ) 0 holds for all t 0 , then the FOCNN (2) is a positive system.
An assumption is required to facilitate the subsequent positivity analysis. Furthermore, unless specifically indicated, the independent variables for all functions are always represented as t.
Assumption 1.
The activation function f p ( · ) is a nondecreasing function satisfying f ( 0 ) = 0 and
| f p ( x ) f p ( y ) | l f | x y | .
Remark 1.
Assumption 1 is reasonable for many activation functions that often appear in neural networks, such as the hyperbolic tangent function, the softsign function, and the linear rectification function.
The objective of this paper is to provide two necessary and sufficient conditions that ensure both the positivity and asymptotic stability of FOCNNs.

3. Main Results

This section consists of two subsections. Within the initial subsection, we will present the necessary and sufficient condition that guarantees the positivity of the FOCNN (2), and in the subsequent subsection, we will delve into the analysis of asymptotic stability.

3.1. Positivity Analysis

Theorem 1.
For any ν i ( ι ) 0 and u i 0 , the FOCNN (2) satisfying Assumption (1) is positive if, and only if, the matrix A is Metzler, and B, D, G are non-negative matrices.
Proof of Theorem 1.
(Sufficiency) Since A is a Metzler matrix, there must exist a constant r > 0 such that r I n + A 0 . Then, the FOCNN (2) is equivalent to
D t ϑ α i = r α i + ( r I n + A ) α i + B f ( α i ( t τ ) ) + D u i + c j = 1 N l i j G α j , α i ( ι ) = ν i ( ι ) , ι [ τ ¯ , 0 ] .
The p-th component of the system (3) is
D t ϑ p α i p = r α i p + q = 1 n [ r I n + A ] p q α i q + q = 1 n [ D ] p q u i q + q = 1 n [ B ] p q f q ( α i q ( t τ ) ) + c j = 1 N q = 1 n l i j [ G ] p q α j q .
For convenience, let Θ ( t ) = q = 1 n [ r I n + A ] p q α i q + q = 1 n [ D ] p q u i q + q = 1 n [ B ] p q f q ( α i q ( t τ ) ) + c j = 1 N q = 1 n l i j [ G ] p q α j q ; then, (4) can be rewritten as
D t ϑ p α i p = r α i p + Θ .
Taking the Laplace transform on both sides of (5), one obtains
X i p ( s ) = s ϑ p 1 s ϑ p + r α i p ( 0 ) + 1 s ϑ p + r Θ ( s ) ,
where X i p ( s ) and Θ ( s ) are the Laplace transforms corresponding to α i p and Θ , respectively. Taking the inverse transform on both sides of (6), then
α i p = 0 t μ ϑ p 1 E ϑ p , ϑ p ( r μ ϑ p ) Θ ( t μ ) d μ + E ϑ p , 1 ( r t ϑ p ) α i p ( 0 ) .
Let α = [ α 1 , , α N n ] T = [ α 1 T , , α N T ] T R N n . For any T > 0 , if the FOCNN (2) is not positive, there must exist a set S = { t [ 0 , T ] | α 0 } . Let t 0 = inf S , then one obtains that α 0 holds for all t [ 0 , t 0 ) . However, α i p ( t 0 ) E ϑ p , 1 ( r t ϑ p ) α i p ( 0 ) 0 must holds since E ϑ p , 1 ( r t ϑ p ) > 0 and E ϑ p , ϑ p ( r t ϑ p ) > 0 , which contradicts the definition of t 0 . Therefore, S must be an empty set, i.e., α i p 0 holds true across the interval [ 0 , T ] . Then, it can be concluded that α i 0 holds for all [ 0 , T ] .
(Necessity) When the FOCNN (2) is a positive system under Assumption 1, let N = 2 , l 12 > 0 , l 21 = 0 and f ( α i ) = α i , i.e., this network only consists of two neurons and one weight.
The first neuron is given by
D t ϑ α 1 = A α 1 + B α 1 ( t τ ) + D u 1 + l 12 G α 2 , α 1 ( ι ) = ν 1 ( ι ) , ι [ max { τ ( t ) } , 0 ] .
If G is not a non-negative matrix, there must exist an element [ G ] p h < 0 . Let u 1 = 0 , then the p-th component of this neuron is
D t ϑ p α 1 p = q = 1 n [ A ] p q α 1 q + [ B ] p q α 1 q ( t τ ) + l 12 [ G ] p q α 2 q .
Let g 1 ( t ) = D t ϑ p α 1 p , ν 1 ( ι ) = 0 , and ν 2 ( ι ) = e h with e h being the h-th column of I n , then one has g 1 ( 0 ) = l 12 [ G ] p h . Therefore, there must be a constant δ 1 > 0 such that g 1 ( t ) < 1 2 l 12 [ G ] p h holds for all t U + ( 0 , δ 1 ) . Using Definition 1 and Lemma 1, one has
α 1 p ( t 1 ) = α 1 p ( 0 ) + 1 Γ ( ϑ p ) 0 t 1 ( t 1 ζ ) ϑ p 1 g 1 ( ζ ) d ζ < 0 ,
where 0 < t 1 < δ 1 , which contradicts the positivity of the FOCNN (2). As a consequence, G is non-negative.
The second neuron is described as
D t ϑ α 2 = A α 2 + B α 2 ( t τ ) + D u 2 , α 2 ( ι ) = ν 2 ( ι ) , ι [ max { τ ( t ) } , 0 ] .
If A is not a Metzler matrix, there must exist a [ A ] p h < 0 ( h p ). When u 2 = 0 , the p-th component of this neuron is
D t ϑ p α 2 p = q = 1 n [ A ] p q α 2 q + [ B ] p q α 2 q ( t τ ) .
Let
ν 2 ( ι ) = 0 , ι [ max { τ ( t ) } , 0 ) , e h , ι = 0 ,
and g 2 ( t ) = D t ϑ p α 2 p , then one has g 2 ( 0 ) = [ A ] p h , which implies that there is a constant δ 2 such that g 2 ( t ) < 1 2 [ A ] p h holds for all t U + ( 0 , δ 2 ) . Similarly, one obtains
α 2 p ( t 2 ) = α 2 p ( 0 ) + 1 Γ ( ϑ ) 0 t 2 ( t 2 ζ ) ϑ p 1 g 2 ( ζ ) d ζ < 0 ,
where 0 < t 2 < δ 2 , which also contradicts the positivity of the network (2). Consequently, A is a Metzler matrix. Let [ B ] p h < 0 (h can be equal to p) and
ν 2 ( ι ) = e h , ι [ max { τ ( t ) } , 0 ) , 0 , ι = 0 ,
then one has g 2 ( 0 ) = [ B ] p h α 2 h ( 0 τ ( 0 ) ) = [ B ] p h . Similar to the above discussion, there is a constant δ 3 such that g 2 ( t ) < 1 2 [ B ] p h satisfies for all t U + ( 0 , δ 3 ) , which implies that α 2 p ( t 3 ) < 0 , in which 0 < t 3 < δ 3 . Hence, according to the principle of contradiction, B is a non-negative matrix. Finally, let ν 2 ( ι ) = 0 and u 2 = e h ( e h is the h-th column of the m-dimensional identity matrix), which means that the matrix D is non-negative. □

3.2. Asymptotic Stability Analysis

The FOCNN (2) can be rewritten as
D t ϑ α ( t ) = ( I N A ) α ( t ) + ( I N B ) F ( α ( t τ ( t ) ) ) + ( I N D ) u ( t ) + c ( L G ) α ( t ) , α ( ι ) = ν ( ι ) , ι [ τ ¯ , 0 ] ,
in which D t ϑ α = [ D t ϑ α 1 T , , D t ϑ α N T ] T R N n , F ( α ) = [ f ( α 1 ) T , , f ( α N ) T ] T R N n , u = [ u 1 T , , u N T ] T R N m , and ν ( ι ) = [ ν 1 ( ι ) T , , ν N ( ι ) T ] T R N n .
A linear auxiliary system is defined as
D t ϑ β ( t ) = ( I N A ) β ( t ) + ( I N B ) L f β ( t τ ( t ) ) + ( I N D ) u ( t ) + c ( L G ) β ( t ) , β ( ι ) = ψ ( ι ) , ι [ τ ¯ , 0 ] ,
where β R N n and ψ ( ι ) R N n are the state and initial condition of the system, respectively, and L f = l f I N n . Moreover, it is reasonable to contemplate the constant delay system under zero input:
D t ϑ β ( t ) = ( I N A ) β ( t ) + ( I N B ) L f β ( t τ ) + c ( L G ) β ( t ) , β ( ι ) = ψ ( ι ) , ι [ τ ¯ , 0 ] .
Before giving formal stability results, a lemma needs to be provided to facilitate the analysis.
Lemma 3.
Consider the FOCNN (2) under Assumption 1. When u = 0 , if ψ ( ι ) ν ( ι ) holds for all ι [ τ ¯ , 0 ] , it can be affirmed that β α is valid for all t > 0 .
Proof of Lemma 3.
Let e = β α . When u = 0 , it follows from (16) and (17) that
D t ϑ e = ( I N A ) + c ( L G ) e + ( I N B ) L f e ( t τ ) + ( I N B ) L f α ( t τ ) F ( α ( t τ ) ) .
It is easy to conclude that ( I N A ) + c ( L G ) is a Metzler matrix, and ( I N B ) L f , ( I N B ) are non-negative matrices. Since Assumption 1 is met, ( I N B ) L f α ( t τ ) F ( α ( t τ ) ) can be regarded as a non-negative input for the system (19). From [28] (Theorem 1), it can be concluded that e 0 is valid for all t > 0 , i.e., β α holds for all t > 0 . □
Lemma 4.
Assume λ 0 such that ( ( I N A ) + c ( L G ) + ( I N B ) L f ) λ 0 . Consequently, for the system (18) with zero input ( u = 0 ) and initial condition ψ ( ι ) λ ( ι [ τ ¯ , 0 ] ) , it follows that: (i) β λ for all t 0 ; (ii) for any t 2 > t 1 0 , it holds that β ( t 1 ) β ( t 2 ) .
Proof of Lemma 4.
(i) Define η ( t ) λ β ( t ) , then it holds that
D t ϑ η ( t ) = ( I N A + c ( L G ) ) η ( t ) ( I N A + c ( L G ) + ( I N B ) L f ) λ + ( I N B ) L f η ( t τ ) .
Since η ( ι ) = 0 for any ι [ τ ¯ , 0 ] . According to the positivity analysis of the error system (20), it can be demonstrated that η ( t ) 0 for all t 0 , implying that β λ holds for all t 0 ;
(ii) Consider the arbitrary constant d > 0 , and define η ( t ) β ( t ) β ( t + d ) , then it can be deduced that
D t ϑ η ( t ) = ( I N A + c ( L G ) ) η ( t ) + ( I N B ) L f η ( t τ ) .
Note that the error system (21) holds that η ( ι ) = β ( ι ) β ( ι + d ) = λ β ( ι + d ) 0 for ι [ τ ¯ , 0 ] . Then, η ( t ) 0 holds due to the error system (21) being positive, which means that β ( t ) β ( t + d ) for all t 0 . □
Lemma 5.
Suppose that β ( t ; ψ 1 ) and β ( t ; ψ 2 ) are the trajectories of system (17) with the initial condition ψ 1 and ψ 2 . Then, ψ 1 ( ι ) ψ 2 ( ι ) for ι [ τ ¯ , 0 ] means that β ( t ; ψ 1 ) β ( t ; ψ 2 ) for t > 0 .
Proof of Lemma 5.
It can be proved directly from the positivity and the linearity of system (17). □
With reference to Lemmas 3, 4, and 5, the theorem below elucidates the notion of asymptotic stability.
Theorem 2.
Suppose that Assumption 1 holds. Then, the positive FOCNN (2) is asymptotically stable under zero input if, and only if, the matrix ( I N A ) + c ( L G ) + ( I N B ) L f is Hurwitz.
Proof of Theorem 2.
(Sufficiency) Since β α , the linear system (17) and (18) must be the positive system. Suppose that β 1 ( t ; ψ ) and β 2 ( t ; ψ ) are the trajectories of system (17) and (18) with the initial condition ψ . Since ( I N A ) + c ( L G ) + ( I N B ) L f is a Hurwitz matrix, based on Lemma 2, it can be concluded that there exists a column vector λ 0 , satisfying ( ( I N A ) + c ( L G ) + ( I N B ) L f ) λ 0 . Moreover, there always exists a constant d = max t [ τ ¯ , 0 ] ψ ( t ) / min j = 1 , 2 , , n λ j , such that d λ ψ ( ι ) for ι [ τ ¯ , 0 ] . From [28] (Proposition 1), it is obvious that lim t + β 2 ( t ; d λ ) = 0 . Define ε ( t ) = β 2 ( t ; d λ ) β 1 ( t ; d λ ) , then we have D t ϑ ε ( t ) = [ I N A + c ( L G ) ] ε ( t ) + ( I N B ) L f ε ( t τ ( t ) ) + ( I N B ) L f [ β 2 ( t τ ) β 2 ( t τ ( t ) ) ] . By Lemma 4, it is shown that β 2 ( t τ ) β 2 ( t τ ( t ) ) 0 for all t 0 , and β 1 ( t ; d λ ) β 2 ( t ; d λ ) . In addition, from Lemma 5, one can obtain that β 1 ( t ; ψ ) β 1 ( t ; d λ ) and lim t + β 1 ( t ; ψ ) = 0 , which implies that the system (17) is asymptotically stable, i.e., lim t + β = 0 . Therefore, it follows from 0 α β that lim t + α = 0 using the squeeze theorem, which means that the FOCNN (2) is asymptotically stable.
(Necessity) Let τ = 0 , f ( α i ) = l f α i , and ϑ i = ϑ , where ϑ ( 0 , 1 ) is a constant. Then, (16) can be rewritten as
D t ϑ α = Ω α ,
in which Ω = ( I N A ) + c ( L G ) + ( I N B ) L f R N n × N n . Since this system is asymptotically stable, in the light of [29], one has | arg ( λ ( Ω ) ) | > π ϑ 2 . It is easy to see that Ω is a Metzler matrix, which implies that there must exist a constant r > 0 such that r I N n + Ω 0 . Using the Perron–Frobenius theorem, λ max ( r I N n + Ω ) must be a singlet eigenvalue that is a real number. Let x R N n be the eigenvector of r I N n + Ω , then one has
Ω x = ( r I N n + Ω ) x r x = λ ( r I N n + Ω ) r x = λ ( Ω ) x ,
which means that λ max ( Ω ) = λ max ( r I N n + Ω ) r is a real number. Since | arg ( λ ( Ω ) ) | > π ϑ 2 , which excludes the positive real part, λ max ( Ω ) must be a negative number. Therefore, Ω is a Hurwitz matrix. □
Remark 2.
The purpose of introducing the auxiliary system (17) is to avoid defining the Lyapunov function for the stability analysis. In the context of integer-order systems featuring time-varying delays, the stability analysis commonly relies on the utilization of the Lyapunov–Krasovskii function. However, in the case of fractional-order systems, especially those involving incommensurate fractional orders, this method is rendered impractical due to the intricate nature of the fractional derivative of a composite function, characterized by a complex infinite series.

4. Simulation

Consider the following FOCNN constructed using four neurons:
D t ϑ α i = A α i + B f ( α i ( t 0.5 cos t ) ) + D u i + c j = 1 4 l i j G α j , i = 1 , , 4 , α i ( ι ) = ν i ( ι ) , ι [ 0.5 , 0 ] ,
with f ( α i ) = 0.5 [ tanh ( α i 1 ) , tanh ( α i 2 ) , tanh ( α i 3 ) ] T , and ϑ = [ 0.6 , 0.7 , 0.8 ] T . Under the initial condition ν 1 ( ι ) = [ 0.2 | sin ι | , 0.2 | cos ι | , 0.3 ( sin ι + 1 ) ] T , ν 2 ( ι ) = [ 0.3 ( cos ι + 1 ) , 0.1 | tanh ι | , 0.2 | tanh ι | ] T , ν 3 ( ι ) = [ 0.3 | tanh ι | , 0.2 , 0.3 ] T , ν 4 ( ι ) = [ 0.4 , 0.5 , 0.6 e ι ] T , and constant c = 0.2 . The coefficient matrices of the system (23) are L f = 0.5 I 12 :
A = 2 0.1 0.2 0.3 3 0.2 0.1 0.2 4 , B = 0.099 0.678 0.107 0.262 0.137 0.654 0.335 0.721 0.494 ,
D = 0.779 0.891 0.715 0.334 0.904 0.698 , L = 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 ,
and
G = 0.198 0.512 0.611 0.031 0.481 0.618 0.744 0.905 0.859 .
It is obvious that the matrix A is Metzler, and B, D, and G are non-negative matrices. In addition, Ω is a Hurwitz matrix using the MATLAB R2019 toolbox, which means that system (17) is asymptoically stable. Moreover, the states of the four neurons are depicted in Figure 1, Figure 2, Figure 3 and Figure 4. From Figure 1, Figure 2, Figure 3 and Figure 4, it is obvious that α i , i = 1 , 2 , 3 , 4 , are quite close to zero when time t increases to 20s, and these states can be maintained with increasing time. Also, we can see that the state trajectories of FOCNN (23) remain positive all the time, which clearly shows that the FOCNN (23) is positive and asymptotically stable.

5. Conclusions

Within this paper, the problem of positivity and asymptotic stability in incommensurate FOCNNs characterized by time-varying delays is addressed. Our contributions encompass the presentation of two necessary and sufficient conditions that ensure both positivity and asymptotic stability in FOCNNs. Moving forward, our research endeavors will be directed towards the exploration of positivity and stability aspects in a wider array of fractional-order nonlinear systems and singular FOCNNs with time-varying delays.

Author Contributions

Methodology, J.G., H.Q. and J.S.; software, J.G.; writing—original draft preparation, J.G.; writing—review and editing, H.Q.; supervision, J.S.; funding acquisition, J.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China under Grant 61973156.

Data Availability Statement

The datasets generated and analyzed during the current study are not publicly available but are available from the corresponding author on reasonable request.

Conflicts of Interest

The authors declare no potential conflict of interests.

Abbreviations

The following abbreviations are used in this manuscript:
CNNsCoupled neural networks
FOCNNsFractional-order coupled neural networks
FOLSsFractional-order linear systems

References

  1. Wang, T.; Wang, K.; Jia, N. Chaos control and associative memory of a time-delay globally coupled neural network using symmetric map. Neurocomputing 2011, 74, 1673–1680. [Google Scholar] [CrossRef]
  2. Keren, H.; Partzsch, J.; Marom, S.; Mayr, C.G. A biohybrid setup for coupling biological and neuromorphic neural networks. Front. Neurosci. 2019, 13, 432. [Google Scholar] [CrossRef] [PubMed]
  3. Mureşan, R.C. Pattern recognition using pulse-coupled neural networks and discrete Fourier transforms. Neurocomputing 2003, 51, 487–493. [Google Scholar] [CrossRef]
  4. Ouyang, D.; Shao, J.; Jiang, H.; Nguang, S.K.; Shen, H.T. Impulsive synchronization of coupled delayed neural networks with actuator saturation and its application to image encryption. Neural Netw. 2020, 128, 158–171. [Google Scholar] [CrossRef]
  5. Zhang, X.; Garikipati, K. Machine learning materials physics: Multi-resolution neural networks learn the free energy and nonlinear elastic response of evolving microstructures. Comput. Methods Appl. Mech. Eng. 2020, 372, 113362. [Google Scholar] [CrossRef]
  6. Cole, K.S. Electric conductance of biological systems. In Proceedings of the Cold Spring Harbor Symposia on Quantitative Biology; Cold Spring Harbor Laboratory Press: New York, NY, USA, 1933; Volume 1, pp. 107–116. [Google Scholar]
  7. Tan, M.; Pan, Q. Global stability analysis of delayed complex-valued fractional-order coupled neural networks with nodes of different dimensions. Int. J. Mach. Learn. Cybern. 2019, 10, 897–912. [Google Scholar] [CrossRef]
  8. Wang, H.; Yu, Y.; Wen, G.; Zhang, S. Stability analysis of fractional-order neural networks with time delay. Neural Process. Lett. 2015, 42, 479–500. [Google Scholar] [CrossRef]
  9. Bao, H.; Park, J.H.; Cao, J. Adaptive synchronization of fractional-order output-coupling neural networks via quantized output control. IEEE Trans. Neural Netw. Learn. Syst. 2020, 32, 3230–3239. [Google Scholar] [CrossRef]
  10. Li, Y.; Xu, M.; Sun, J.; Liu, N.; Yu, P.; Liu, P. Finite-time Synchronization of Fractional-Order Neural Networks With Time-Varying Delays. In Proceedings of the 2021 11th International Conference on Information Science and Technology (ICIST), Chengdu, China, 21–23 May 2021; pp. 668–672. [Google Scholar]
  11. Liu, C.G.; Wang, J.L.; Wu, H.N. Finite-Time Passivity for Coupled Fractional-Order Neural Networks With Multistate or Multiderivative Couplings. IEEE Trans. Neural Netw. Learn. Syst. 2021, 34, 5976–5987. [Google Scholar] [CrossRef]
  12. Shafiya, M.; Nagamani, G. New finite-time passivity criteria for delayed fractional-order neural networks based on Lyapunov function approach. Chaos Solitons Fractals 2022, 158, 112005. [Google Scholar] [CrossRef]
  13. Liu, C.G.; Wang, J.L. Passivity of fractional-order coupled neural networks with multiple state/derivative couplings. Neurocomputing 2021, 455, 379–389. [Google Scholar] [CrossRef]
  14. Li, H.L.; Kao, Y.; Hu, C.; Jiang, H.; Jiang, Y.L. Robust exponential stability of fractional-order coupled quaternion-valued neural networks with parametric uncertainties and impulsive effects. Chaos Solitons Fractals 2021, 143, 110598. [Google Scholar] [CrossRef]
  15. Bao, H.; Park, J.H.; Cao, J. Synchronization of fractional-order delayed neural networks with hybrid coupling. Complexity 2016, 21, 106–112. [Google Scholar] [CrossRef]
  16. Qiu, H.; Wang, H.; Pan, Y.; Cao, J.; Liu, H. Stability and L-Gain of Positive Fractional-Order Singular Systems With Time-Varying Delays. IEEE Trans. Circuits Syst. II Express Briefs 2023, 70, 3534–3538. [Google Scholar] [CrossRef]
  17. Fei, C.; Shen, J. Machine learning for securing Cyber–Physical Systems under cyber attacks: A survey. Frankl. Open 2023, 4, 100041. [Google Scholar] [CrossRef]
  18. Qiu, H.; Cao, J.; Liu, H. Stability and L-gain of positive fractional-order coupled differential-difference systems with unbounded time-varying delays. Chaos Solitons Fractals 2023, 175, 113948. [Google Scholar] [CrossRef]
  19. Leutcho, G.D.; Woodward, L.; Blanchard, F. Nonlinear dynamics of a single-gap terahertz split-ring resonator under electromagnetic radiation. Chaos Interdiscip. J. Nonlinear Sci. 2023, 33, 103131. [Google Scholar] [CrossRef]
  20. Caswell, H. Matrix Population Models; Sinauer: Sunderland, MA, USA, 2000; Volume 1. [Google Scholar]
  21. Jacquez, J.A. Compartmental Analysis in Biology and Medicine; Elsevier Publishing Company: Amsterdam, The Netherlands, 1972. [Google Scholar]
  22. Kaczorek, T. Fractional Positive Continuous-Time Linear Systems and Their Reachability. Int. J. Appl. Math. Comput. Sci. 2008, 18, 223–228. [Google Scholar] [CrossRef]
  23. Busłowicz, M. Robust stability of positive discrete-time linear systems of fractional order. Bull. Pol. Acad. Sci. Tech. Sci. 2010, 58, 567–572. [Google Scholar] [CrossRef]
  24. Wang, C.; Zhao, Y. Performance analysis and control of fractional-order positive systems. IET Control Theory Appl. 2019, 13, 928–934. [Google Scholar] [CrossRef]
  25. Benzaouia, A.; Hmamed, A.; Mesquine, F.; Benhayoun, M.; Tadeo, F. Stabilization of continuous-time fractional positive systems by using a Lyapunov function. IEEE Trans. Autom. Control 2014, 59, 2203–2208. [Google Scholar] [CrossRef]
  26. Kaczorek, T. Positive linear systems consisting of n subsystems with different fractional orders. IEEE Trans. Circuits Syst. I Regul. Pap. 2011, 58, 1203–1210. [Google Scholar] [CrossRef]
  27. Chen, L.; Gu, P.; Lopes, A.M.; Chai, Y.; Xu, S.; Ge, S. Asymptotic Stability of Fractional-Order Incommensurate Neural Networks. Neural Process. Lett. 2023, 55, 5499–5513. [Google Scholar] [CrossRef]
  28. Shen, J.; Lam, J. Stability and performance analysis for positive fractional-order systems with time-varying delays. IEEE Trans. Autom. Control 2015, 61, 2676–2681. [Google Scholar] [CrossRef]
  29. Podlubny, I. Fractional Differential Equations: An Introduction to Fractional Derivatives, Fractional Differential Equations, to Methods of Their Solution and Some of Their Applications; Elsevier: Amsterdam, The Netherlands, 1998. [Google Scholar]
Figure 1. The state trajectory of the first neuron of the FOCNN (23).
Figure 1. The state trajectory of the first neuron of the FOCNN (23).
Electronics 12 04782 g001
Figure 2. The state trajectory of the second neuron of the FOCNN (23).
Figure 2. The state trajectory of the second neuron of the FOCNN (23).
Electronics 12 04782 g002
Figure 3. The state trajectory of the third neuron of the FOCNN (23).
Figure 3. The state trajectory of the third neuron of the FOCNN (23).
Electronics 12 04782 g003
Figure 4. The state trajectory of the fourth neuron of the FOCNN (23).
Figure 4. The state trajectory of the fourth neuron of the FOCNN (23).
Electronics 12 04782 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

Gong, J.; Qiu, H.; Shen, J. Positivity and Stability of Fractional-Order Coupled Neural Network with Time-Varying Delays. Electronics 2023, 12, 4782. https://doi.org/10.3390/electronics12234782

AMA Style

Gong J, Qiu H, Shen J. Positivity and Stability of Fractional-Order Coupled Neural Network with Time-Varying Delays. Electronics. 2023; 12(23):4782. https://doi.org/10.3390/electronics12234782

Chicago/Turabian Style

Gong, Jiyun, Hongling Qiu, and Jun Shen. 2023. "Positivity and Stability of Fractional-Order Coupled Neural Network with Time-Varying Delays" Electronics 12, no. 23: 4782. https://doi.org/10.3390/electronics12234782

APA Style

Gong, J., Qiu, H., & Shen, J. (2023). Positivity and Stability of Fractional-Order Coupled Neural Network with Time-Varying Delays. Electronics, 12(23), 4782. https://doi.org/10.3390/electronics12234782

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