Previous Article in Journal
Lateral and Axial Camera Motions Reveal Two Fixed-Error Components in Active Infrared Stereo
Previous Article in Special Issue
Predictor-Based Stabilization for Linear Switched Systems with Input Delays
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A General Framework for Stability Analysis of Neutral Cohen–Grossberg Neural Networks with Discrete Delay Terms

by
Melike Solak Altuntas
1,
Ozlem Faydasicok
1,* and
Sabri Arik
2
1
Department of Mathematics, Faculty of Science, Istanbul University, Istanbul 34134, Turkey
2
Department of Computer Engineering, Faculty of Engineering, Istanbul University-Cerrahpasa, Istanbul 34320, Turkey
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(17), 3075; https://doi.org/10.3390/math14173075
Submission received: 14 July 2026 / Revised: 16 August 2026 / Accepted: 24 August 2026 / Published: 26 August 2026

Abstract

This paper studies global asymptotic stability of Cohen–Grossberg neural networks involving discrete time delays in the neuron states and neutral delays in the time derivatives of the neuron states. An appropriate Lyapunov functional, which is defined by the linear combination of three Lyapunov functionals of the quadratic forms, is constructed to determine new criteria for global asymptotic stability of neutral-type neural networks with discrete delay parameters. The proposed stability conditions are established through a set of algebraic inequalities that utilize key matrix properties and parameters of system functions. These criteria are proved to be independent of delay components, and they can be tested by checking some algebraic inequalities. A numerical example is studied to illustrate the efficiency aspects of the derived stability conditions.

1. Introduction

The class of dynamical neural networks has recently attracted considerable attention, since these networks have proved to possess extensive applications in real-world engineering problems with regard to global pattern formation [1], emergent collective computational abilities [2,3], nonlinear programming [4], fixed point learning algorithms [5], optimization problems [6], signal processing [7], and analog neural nonlinear programming solvers [8]. In most of these applications, the information representing the studied problem is generally required to be properly processed in the form of stable states of the network neurons. In this context, it is of crucial importance to determine the stability properties of the equilibrium points associated with neural networks. In the past literature, the stability issue of dynamical neural networks has gained a great deal of attention, and some key results addressing the stability of neural networks have been proposed (see [9,10,11,12] and references therein). It is known from the literature that, in the electronic implementation of a dynamical neural network by electronic circuit components, time delay elements are unavoidably present as a consequence of the finite switching speeds of the network amplifiers as well as the inherent communication times of the network neurons. Thus, the existence of time delay components usually has critical impacts on the stability of neural networks, leading to undesired oscillatory and unstable behaviors [13,14,15]. Therefore, the time delays involved in the dynamics of the neurons describe the dynamical behaviors of the neuron model more precisely. In the process of determining the desired stability criteria for neural networks, the selection of suitable Lyapunov functionals plays a crucial role. Recently, various forms of suitable Lyapunov functionals have been constructed to derive alternative sets of stability criteria associated with different models of delayed dynamical neural networks. In [16,17,18,19], robust stability of neural networks involving multiple discrete delays has been studied; in [20,21,22,23], stability of neural networks with discrete and distributed delays has been investigated; and in [24], stability of delayed fuzzy inertial discontinuous neural networks has been analyzed. In these papers, various sets of stability criteria for the considered neural network models have been derived by constructing suitable Lyapunov functionals, and using some matrix and norm inequalities. We now note that dynamical neural networks can also be modelled by neutral functional differential equations, which include both time and neutral delay arguments. This class of neural systems is generally called neutral-type neural networks. In this neural network model, both states and time derivatives of states contain delay parameters. The dynamical systems defined by neutral-type differential equations are usually employed in the mathematical modelling of engineering problems including the dynamical modelling of the unsteady motion of the elastic rigid body [25]; the optimal control and automatic control problems [26]; viscoelasticity [27]; the lossless transmission lines [28]; cell growth [29]; the economic models [30]; and the population models [31]. Therefore, substantial research has been conducted to establish stability conditions for neutral neural networks. Recently, numerous articles have employed various Lyapunov functional candidates to determine stability conditions for different classes of neutral Hopfield neural networks. In [32], stability problem for the class of neutral high-order Hopfield neural networks with mixed time delays has been studied. In [33,34,35,36], stability conditions for the class of Hopfield neural networks with multiple delays have been presented. In [37,38,39,40], stability of the class of neutral Hopfield neural networks with a single time delay and a single neutral delay has been investigated. In [41,42,43], stability of neutral Hopfield neural networks with time-varying delays has been studied.
This current article will deal with the stability problem for neutral Cohen–Grossberg neural networks, which is a more general class of neural networks than Hopfield neural networks. A novel Lyapunov functional method, combining a set of the Lyapunov functionals, together with using matrix analysis techniques, is constructed to obtain the criteria under which the examined neutral neural system is globally asymptotically stable. Our proposed stability criteria mainly involve network parameters, that can merely be checked by verifying some system-related algebraic equations. In addition, stability conditions given in this paper are purely delay-independent; that is, they are independent of the size of delay terms. It is indicated that most of the previous stability results presented for various versions of the same neural network model can be obtained from the appropriate choices of set of the Lyapunov functionals utilized in this paper.
Notations: Throughout this paper, x R n denotes a real vector x = ( x 1 , x 2 , , x n ) T and A R n × n denotes a real matrix A = ( a i j ) n × n . x T represents the transpose of vector x. A T and A 1 respectively denote the transpose and inverse of A. I denotes the identity matrix of the appropriate dimension. D = diag ( d i > 0 ) is a positive diagonal matrix with the entries d i > 0 , i = 1 , , n . For the elements d 1 , d 2 , , d n , d m and d M will respectively denote d m = min 1 i n { d i } and d M = max 1 i n { d i } . Finally, the vector and matrix norms are noted: | | x | | 2 = i = 1 n x i 2 and | | A | | 2 = λ M ( A T A ) where λ M ( A T A ) is the maximum eigenvalue of the nonnegative definite matrix A T A .

2. Neutral Cohen–Grossberg Neural Networks

This study will deal with stability problem for the neutral Cohen–Grossberg neural network that is defined by the nonlinear differential equations given by
x ˙ i ( t ) = d i ( x i ( t ) ) ( c i ( x i ( t ) ) + j = 1 n a i j f j ( x j ( t ) ) + j = 1 n b i j f j ( x j ( t τ j ) ) + u i ) + j = 1 n e i j x ˙ j ( t ζ j ) , i = 1 , , n .
where
  • n indicates the number of neurons involved in system (1);
  • x i ( t ) is the state of ith neuron;
  • a i j and b i j are the constant interconnection elements;
  • e i j are the constant coefficients of time derivatives of states with neutral delays;
  • d i ( x i ( t ) ) are the amplification functions;
  • c i ( x i ( t ) ) are the behaved functions;
  • f i ( x i ( t ) ) are the nonlinear activation functions;
  • τ i are the constant time delays;
  • ζ i are the constant neutral delays;
  • u i are the constant inputs, i , j = 1 , , n .
In neutral system (1), let τ M = max 1 i n { τ i } , ζ M = max 1 i n { ζ i } and χ = max { τ M , ζ M } . Then, the accompanying initial data of the neutral-type neural network (1) are introduced by
x i ( t ) = φ i ( t ) C ( [ χ , 0 ] , R ) , x i ˙ ( t ) = φ ^ i ( t ) = d d t φ i ( t ) C ( [ χ , 0 ] , R )
where C ( [ χ , 0 ] , R ) denotes the set of all continuous functions from [ χ , 0 ] to R .
When dealing with stability issues for the neutral system described by (1), we first need to know the mathematical statements of the amplification functions d i ( x i ( t ) ) , the behaved functions c i ( x i ( t ) ) and the activation functions f i ( x i ( t ) ) included in neural system (1). In general, the system functions are considered to satisfy the properties given below:
A 1 : The amplification functions d i ( x ) are considered to satisfy the conditions:
0 < υ i d i ( x ) ϕ i , x R , i
with υ i and ϕ i being positive real constants.
A 2 : The behaved functions c i ( x ) are considered to satisfy the conditions:
α i c i ( x ) c i ( z ) x z i , x , z R , x z , i
with α i and i being positive real constants.
A 3 : The nonlinear activation functions f i ( x ) are considered to possess the Lipschitz property given by
| f i ( x ) f i ( z ) | l i | x z | , x , z R , i
where l i are positive constants.

3. Stability Analysis

In this section, by utilizing various linear combinations of different types of Lyapunov functional candidates, which are stated in terms of the squares of the states of the neurons, many novel sets of sufficient criteria associated with the global asymptotic stability of the neural network described in (1) will be derived. Assume that neural system (1) has an equilibrium point for a particular input u = ( u 1 , u 2 , , u n ) T and denote this equilibrium point by x = ( x 1 , x 2 , , x n ) T . Now, transform (1) into an equivalent neural network model by using s i ( t ) = x i ( t ) x i , i . With the help of this transformation, neural network (1) is directly stated in the transformed form given by
s ˙ i ( t ) = γ i ( s i ( t ) ) ( ρ i ( s i ( t ) ) + j = 1 n a i j g j ( s j ( t ) ) + j = 1 n b i j g j ( s j ( t τ j ) ) ) + j = 1 n e i j s ˙ j ( t ζ j ) , i
where the new nonlinear functions in the transformed system possess the forms: γ i ( s i ( t ) ) = d i ( s i ( t ) + x i ) , ρ i ( s i ( t ) ) = c i ( s i ( t ) + x i ) c i ( x i ) and g i ( s i ( t ) ) = f i ( s i ( t ) + x i ) f i ( x i ) . Based on A 1 A 3 , these functions satisfy the conditions:
C 1 : υ i γ i ( s i ( t ) ) ϕ i , i ,   C 2 : α i s i 2 ( t ) s i ( t ) ρ i ( s i ( t ) ) i s i 2 ( t ) , i ,       C 3 : g i ( s i ( t ) ) l i ( s i ( t ) ) , i .
The vector-matrix representation of neural network (2) is written as
s ˙ ( t ) = Γ ( s ( t ) ) ( ρ ( s ( t ) ) + A g ( s ( t ) ) + B g ( s ( t , τ ) ) ) + E s ˙ ( t , ζ )
where
  • s ( t ) = ( s 1 ( t ) , s 2 ( t ) , , s n ( t ) ) T is the state vector of the system;
  • A, B and E are the constant system matrices;
  • Γ ( s ( t ) ) = diag ( γ i ( s i ( t ) ) > 0 ) is a positive diagonal matrix;
  • ρ ( s ( t ) ) = ( ρ 1 ( s 1 ( t ) ) , ρ 2 ( s 2 ( t ) ) , , ρ n ( s n ( t ) ) ) T ;
  • g ( s ( t ) ) = ( g 1 ( s 1 ( t ) ) , g 2 ( s 2 ( t ) ) , , g n ( s n ( t ) ) ) T is the output vector;
  • g ( s ( t , τ ) ) = ( g 1 ( s 1 ( t τ 1 ) ) , g 2 ( s 2 ( t τ 2 ) ) , , g n ( s n ( t τ n ) ) ) T ;
  • s ˙ ( t , ζ ) = ( s ˙ 1 ( t ζ 1 ) , s ˙ 2 ( t ζ 2 ) , , s ˙ n ( t ζ n ) ) T .
Note that neural systems (1) and (2) have equivalent stability properties. Therefore, we will simply conduct the stability analysis for the origin of neural system (2) without conducting the stability analysis for the equilibrium points associated with neural system (1). Before proceeding any further, in order to establish a general framework for the stability conditions of neutral system (2), it is necessary to give the following key lemma of the paper:
Lemma 1.
For γ i ( s i ( t ) ) in system (2), define
ψ i ( s i ( t ) ) = k 1 + k 2 γ i ( s i ( t ) ) + k 3 γ i ( s i ( t ) ) , ψ ^ i ( s i ( t ) ) = k ^ 1 + k ^ 2 γ i ( s i ( t ) ) + k ^ 3 γ i ( s i ( t ) )
and
ψ ˜ i ( s i ( t ) ) = k ˜ 1 γ i ( s i ( t ) ) + k ˜ 2 + k ˜ 3 γ i 2 ( s i ( t ) ) , i
where k 1 , k 2 , k 3 k ^ 1 , k ^ 2 , k ^ 3 k ˜ 1 , k ˜ 2 and k ˜ 3 are the nonnegative real constants with k 1 + k 2 + k 3 = k ^ 1 + k ^ 2 + k ^ 3 = k ˜ 1 + k ˜ 2 + k ˜ 3 = 1 . Then, the following conditions hold
Υ i = k 1 υ i + k 2 υ i 2 + k 3 γ i ( s i ( t ) ) ψ i ( s i ( t ) ) = k 1 γ i ( s i ( t ) ) + k 2 γ i 2 ( s i ( t ) ) + k 3 Υ i k 1 ϕ i + k 2 ϕ i 2 + k 3 = Ω i , Θ i = k 1 ϕ i + k 2 + k 3 ϕ i 2 ψ i ( s i ( t ) ) γ i ( s i ( t ) ) = k 1 γ i ( s i ( t ) ) + k 2 + k 3 γ i 2 ( s i ( t ) ) k 1 υ i + k 2 + k 3 υ i 2 = Φ i ψ ^ i ( s i ( t ) ) = k ^ 1 + k ^ 2 γ i ( s i ( t ) ) + k ^ 3 γ i ( s i ( t ) ) k ^ 1 + k ^ 2 ϕ i + k ^ 3 υ i = Λ ^ i Θ ^ i = k ^ 1 ϕ i + k ^ 2 + k ^ 3 ϕ i 2 ψ ^ i ( s i ( t ) ) γ i ( s i ( t ) ) = k ^ 1 γ i ( s i ( t ) ) + k ^ 2 + k ^ 3 γ i 2 ( s i ( t ) ) k ^ 1 υ i + k ^ 2 + k ^ 3 υ i 2 = Φ ^ i
Υ ˜ i = k ˜ 1 + k ˜ 2 υ i + k ˜ 3 ϕ i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) = k ˜ 1 + k ˜ 2 γ i ( s i ( t ) ) + k ˜ 3 γ i ( s i ( t ) ) Υ ˜ i k ˜ 1 + k ˜ 2 ϕ i + k ˜ 3 υ i = Λ ˜ i ψ ˜ i ( s i ( t ) ) = k ˜ 1 γ i ( s i ( t ) ) + k ˜ 2 + k ˜ 3 γ i 2 ( s i ( t ) ) k ˜ 1 υ i + k ˜ 2 + k ˜ 3 υ i 2 = Φ ˜ i , i Γ ( s ( t ) ) Ψ ( s ( t ) ) 2 k 1 ϕ M + k 2 ϕ M 2 + k 3 = Ω M Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) 2 k 1 υ m + k 2 + k 3 υ m 2 = Φ M
where Ψ ( s ( t ) ) = diag ( ψ i ( s i ( t ) ) > 0 ) = k 1 I + k 2 Γ ( s ( t ) ) + k 3 Γ 1 ( s ( t ) ) , υ m = min 1 i n { υ i } , ϕ M = max 1 i n { ϕ i } , Φ M = max 1 i n { Φ i } and Ω M = max 1 i n { Ω i } .
Proof of Lemma 1.
The proof of this lemma directly follows from the fact that all inequalities stated in Lemma 1 hold under the condition that υ i γ i ( s i ( t ) ) ϕ i , i , defined by assumption C 1 . □
Exploiting the results of Lemma 1, we determine the main stability conditions as follows:
Theorem 1.
Let system (3) satisfy the conditions C 1 C 3 . Then, the origin of neutral system (3) is globally asymptotically stable if the following two sets of criteria are satisfied:
ϱ i = h 1 ( ϵ i δ i ξ i ) h 2 ( δ ^ i + ξ ^ i ) + h 3 ( ϵ ˜ i δ ˜ i ξ ˜ i ) > 0
and
ϑ i = h 1 ( ε i σ i ) + h 2 ( ε ^ i σ ^ i ω ^ i ) h 3 σ ˜ i > 0 , i
where h 1 , h 2 and h 3 are the nonnegative constants with h 1 + h 2 + h 3 = 1 , and
ϵ i = Υ i α i 2 , ε i = Θ i , ε ^ i = 2 p i Θ ^ i , ϵ ˜ i = 2 q i Υ ˜ i α i ,
δ i = ( 1 + κ + β ) θ 1 Ω M A 2 2 + θ 2 j = 1 n k = 1 n Ω k | a k i | | a k j | l i 2 , ξ i = ( 1 + 1 κ + η ) μ 1 Ω M B 2 2 + μ 2 j = 1 n k = 1 n Ω k | b k i | | b k j | l i 2 , σ i = ( 1 + 1 β + 1 η ) π 1 Φ M E 2 2 + π 2 j = 1 n k = 1 n Φ k | e k i | | e k j | , δ ^ i = κ ^ j = 1 n p j Λ ^ j l i 2 | a j i | , ξ ^ i = β ^ j = 1 n p j Λ ^ j l i 2 | b j i | , σ ^ i = η ^ j = 1 n p j Φ ^ j | e j i | , ω ^ i = j = 1 n 1 κ ^ p i Λ ^ i | a i j | + 1 β ^ p i Λ ^ i | b i j | + 1 η ^ p i Φ ^ i | e i j | , δ ˜ i = j = 1 n κ ˜ q j Λ ˜ j l i | a j i | + 1 κ ˜ q i Λ ˜ i l j | a i j | + 1 β ˜ q i Λ ˜ i l j | b i j | + 1 η ˜ q i Φ ˜ i | e i j | , ξ ˜ i = β ˜ j = 1 n q j Λ ˜ j l i | b j i | , σ ˜ i = η ˜ j = 1 n q j Φ ˜ j | e j i | , i
0 θ 1 , θ 2 , μ 1 , μ 2 , π 1 , π 2 1 , θ 1 + θ 2 = μ 1 + μ 2 = π 1 + π 2 = 1 , κ , β , η , κ ^ , β ^ , η ^ , κ ˜ , β ˜ , η ˜ , p i , q i are the positive real constants, and the other quantities in the above conditions are the same as those defined in Lemma 1.
Proof of Theorem 1.
Define three Lyapunov functionals:
V 1 ( t ) = i = 1 n 2 0 s i ( t ) ψ i ( ς ) ρ i ( ς ) d ς + ξ i t τ i t s i 2 ( ς ^ ) d ς ^ + σ i t ζ i t s ˙ i 2 ( ς ˜ ) d ς ˜ ,
V 2 ( t ) = i = 1 n 2 p i 0 s i ( t ) ψ ^ i ( ς ) ρ i ( ς ) d ς + ξ ^ i t τ i t s i 2 ( ς ^ ) d ς ^ + σ ^ i t ζ i t s ˙ i 2 ( ς ˜ ) d ς ˜
and
V 3 ( t ) = i = 1 n 2 q i 0 s i ( t ) ψ ˜ i ( ς ) ς d ς + ξ ˜ i t τ i t s i 2 ( ς ^ ) d ς ^ + σ ˜ i t ζ i t s ˙ i 2 ( ς ˜ ) d ς ˜
Construct the Lyapunov functional for the neutral system expressed by (3):
V ( t ) = h 1 V 1 ( t ) + h 2 V 2 ( t ) + h 3 V 3 ( t )
In light of (7), V ( t ) has its time derivative as given below:
V ˙ ( t ) = h 1 V ˙ 1 ( t ) + h 2 V ˙ 2 ( t ) + h 3 V ˙ 3 ( t )
Now, computing the time derivative of V 1 ( t ) , defined by (4), yields
V ˙ 1 ( t ) = 2 i = 1 n ψ i ( s i ( t ) ) ρ i ( s i ( t ) ) s ˙ i ( t ) + i = 1 n ξ i s i 2 ( t ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ) σ i s ˙ i 2 ( t ζ i ) = 2 ρ T ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) + i = 1 n ξ i s i 2 ( t ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ) σ i s ˙ i 2 ( t ζ i )
Adding and subtracting the following term
s ˙ T ( t ) Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t )
to the right-hand side of (9) leads to a mathematically equivalent result:
V ˙ 1 ( t ) = 2 ρ T ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) + s ˙ T ( t ) Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) s ˙ T ( t ) Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) + i = 1 n ξ i s i 2 ( t ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ) σ i s ˙ i 2 ( t ζ i ) = 2 ρ T ( s ( t ) ) + s ˙ T ( t ) Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) s ˙ T ( t ) Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) + i = 1 n ξ i s i 2 ( t ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ) σ i s ˙ i 2 ( t ζ i ) = 2 ρ ( s ( t ) ) + Γ 1 ( s ( t ) ) s ˙ ( t ) T Ψ ( s ( t ) ) Γ ( s ( t ) ) Γ 1 ( s ( t ) ) s ˙ ( t ) s ˙ T ( t ) Γ 1 ( s ( t ) ) ×   Ψ ( s ( t ) ) s ˙ ( t ) + i = 1 n ξ i s i 2 ( t ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ) σ i s ˙ i 2 ( t ζ i ) = ρ ( s ( t ) ) + A g ( s ( t ) ) + B g ( s ( t , τ ) ) + Γ 1 ( s ( t ) ) E s ˙ ( t , ζ ) T Ψ ( s ( t ) ) Γ ( s ( t ) ) ×   ( ρ ( s ( t ) ) + A g ( s ( t ) ) + B g ( s ( t , τ ) ) + Γ 1 ( s ( t ) ) E s ˙ ( t , ζ ) ) s ˙ T ( t ) ×   Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) + i = 1 n ξ i s i 2 ( t ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ) σ i s ˙ i 2 ( t ζ i )
(10) directly leads to
V ˙ 1 ( t ) = ρ T ( s ( t ) ) Γ ( s ( t ) ) Ψ ( s ( t ) ) ρ ( s ( t ) ) + g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) A g ( s ( t ) ) + g T ( s ( t , τ ) ) B T Γ ( s ( t ) ) Ψ ( s ( t ) ) B g ( s ( t , τ ) ) + s ˙ T ( t , ζ ) E T Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) E s ˙ ( t , ζ ) + 2 g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) B g ( s ( t , τ ) ) + 2 g T ( s ( t ) ) A T Ψ ( s ( t ) ) E s ˙ ( t , ζ ) + 2 g T ( s ( t , τ ) ) B T Ψ ( s ( t ) ) E s ˙ ( t , ζ ) s ˙ T ( t ) Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) + i = 1 n ( ξ i s i 2 ( t ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ) σ i s ˙ i 2 ( t ζ i ) )
Note the following inequalities
2 g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) B g ( s ( t , τ ) ) κ g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) A g ( s ( t ) ) + 1 κ g T ( s ( t , τ ) ) B T Γ ( s ( t ) ) Ψ ( s ( t ) ) B g ( s ( t , τ ) ) ,
2 g T ( s ( t ) ) A T Ψ ( s ( t ) ) E s ˙ ( t , ζ ) β g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) A g ( s ( t ) ) + 1 β s ˙ T ( t , ζ ) E T Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) E s ˙ ( t , ζ )
and
2 g T ( s ( t , τ ) ) B T Ψ ( s ( t ) ) E s ˙ ( t , ζ ) η g T ( s ( t , τ ) ) B T Γ ( s ( t ) ) Ψ ( s ( t ) ) B g ( s ( t , τ ) ) + 1 η s ˙ T ( t , ζ ) E T Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) E s ˙ ( t , ζ )
Using (12)–(14) in (11) yields
V ˙ 1 ( t ) ρ T ( s ( t ) ) Γ ( s ( t ) ) Ψ ( s ( t ) ) ρ ( s ( t ) ) + ( 1 + κ + β ) g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) ×   A g ( s ( t ) ) + ( 1 + 1 κ + η ) g T ( s ( t , τ ) ) B T Γ ( s ( t ) ) Ψ ( s ( t ) ) B g ( s ( t , τ ) ) + ( 1 + 1 β + 1 η ) s ˙ T ( t , ζ ) E T Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) E s ˙ ( t , ζ ) s ˙ T ( t ) Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) + i = 1 n ξ i s i 2 ( t ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ) σ i s ˙ i 2 ( t ζ i )
In what follows, we write the equality
g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) A g ( s ( t ) ) = i = 1 n j = 1 n k = 1 n γ k ( s k ( t ) ) ψ k ( s k ( t ) ) a k i a k j g i ( s i ( t ) ) g j ( s j ( t ) ) = θ 1 g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) A g ( s ( t ) ) + θ 2 i = 1 n j = 1 n k = 1 n γ k ( s k ( t ) ) ψ k ( s k ( t ) ) a k i a k j g i ( s i ( t ) ) g j ( s j ( t ) )
By virtue of the results of Lemma 1 and the conditions C 1 and C 3 , together with some basic norm inequalities for vectors and matrices, the following two inequalities are derived:
g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) A g ( s ( t ) ) Γ ( s ( t ) ) Ψ ( s ( t ) ) 2 A 2 2 g ( s ( t ) ) 2 2 Ω M A 2 2 g ( s ( t ) ) 2 2 = Ω M A 2 2 i = 1 n g i 2 ( s i ( t ) ) Ω M A 2 2 i = 1 n l i 2 s i 2 ( t )
and
i = 1 n j = 1 n k = 1 n γ k ( s k ( t ) ) ψ k ( s k ( t ) ) a k i a k j g i ( s i ( t ) ) g j ( s j ( t ) ) i = 1 n j = 1 n k = 1 n Ω k | a k i | | a k j | | g i ( s i ( t ) ) | | g j ( s j ( t ) ) | i = 1 n j = 1 n k = 1 n Ω k | a k i | | a k j | g i 2 ( s i ( t ) ) i = 1 n j = 1 n k = 1 n Ω k | a k i | | a k j | l i 2 s i 2 ( t )
Thus, inserting (17) and (18) into (16) leads to
g T ( s ( t ) ) A T Γ ( s ( t ) ) Ψ ( s ( t ) ) A g ( s ( t ) ) i = 1 n θ 1 Ω M A 2 2 + θ 2 j = 1 n k = 1 n Ω k | a k i | | a k j | l i 2 s i 2 ( t )
Similar to the derivation of the inequality given by (19), by using the results of Lemma 1 and under the conditions C 1 and C 3 , we can also derive the inequalities:
g T ( s ( t , τ ) ) B T Γ ( s ( t ) ) Ψ ( s ( t ) ) B g ( s ( t , τ ) ) i = 1 n ( μ 1 Ω M B 2 2 + μ 2 j = 1 n k = 1 n Ω k | b k i | | b k j | ) g i 2 ( s i ( t τ i ) ) i = 1 n ( μ 1 Ω M B 2 2 + μ 2 j = 1 n k = 1 n Ω k | b k i | | b k j | ) l i 2 s i 2 ( t τ i )
and
s ˙ T ( t , ζ ) E T Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) E s ˙ ( t , ζ ) i = 1 n π 1 Φ M E 2 2 + π 2 j = 1 n k = 1 n Φ k | e k i | | e k j | s ˙ i 2 ( t ζ i ) ,
In light of Lemma 1 and under the conditions C 1 and C 2 , we find that
ρ T ( s ( t ) ) Γ ( s ( t ) ) Ψ ( s ( t ) ) ρ ( s ( t ) ) = i = 1 n γ i ( s i ( t ) ) ψ i ( s i ( t ) ) ρ i 2 ( s i ( t ) ) i = 1 n Υ i α i 2 s i 2 ( t )
and
s ˙ T ( t ) Γ 1 ( s ( t ) ) Ψ ( s ( t ) ) s ˙ ( t ) = i = 1 n ψ i ( s i ( t ) ) γ i ( s i ( t ) ) s ˙ i 2 ( t ) i = 1 n Θ i s ˙ i 2 ( t )
Using (19)–(23) in (15) results in
V ˙ 1 ( t ) i = 1 n Υ i α i 2 s i 2 ( t ) + ( 1 + κ + β ) i = 1 n θ 1 Ω M A 2 2 + θ 2 j = 1 n k = 1 n Ω k | a k i | | a k j | l i 2 s i 2 ( t ) + ( 1 + 1 κ + η ) i = 1 n μ 1 Ω M B 2 2 + μ 2 j = 1 n k = 1 n Ω k | b k i | | b k j | l i 2 s i 2 ( t τ i ) + ( 1 + 1 β + 1 η ) i = 1 n π 1 Φ M E 2 2 + π 2 j = 1 n k = 1 n Φ k | e k i | | e k j | s ˙ i 2 ( t ζ i ) i = 1 n Θ i s ˙ i 2 ( t ) + i = 1 n ξ i s i 2 ( t ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ) σ i s ˙ i 2 ( t ζ i ) = i = 1 n ϵ i s i 2 ( t ) δ i s i 2 ( t ) + ε i s ˙ i 2 ( t ) ξ i s i 2 ( t ) σ i s ˙ i 2 ( t ) + i = 1 n ξ i s i 2 ( t τ i ) ξ i s i 2 ( t τ i ) + σ i s ˙ i 2 ( t ζ i ) σ i s ˙ i 2 ( t ζ i )
(24) leads to
V ˙ 1 ( t ) i = 1 n ( ϵ i δ i ξ i ) s i 2 ( t ) + ( ε i σ i ) s ˙ i 2 ( t )
Computing the time derivative of V 2 ( t ) , given by (5), yields:
V ˙ 2 ( t ) = i = 1 n ( 2 p i ψ ^ i ( s i ( t ) ) ρ i ( s i ( t ) ) s ˙ i ( t ) + ξ ^ i s i 2 ( t ) ξ ^ i s i 2 ( t τ i ) + σ ^ i s ˙ i 2 ( t ) σ ^ i s ˙ i 2 ( t ζ i ) )
From (2), we can state that
ρ i ( s i ( t ) ) = 1 γ i ( s i ( t ) ) s ˙ i ( t ) j = 1 n e i j s ˙ j ( t ζ j ) + j = 1 n a i j g j ( s j ( t ) ) + b i j g j ( s j ( t τ j ) ) , i
Now, multiplying each side of (27) by the term s ˙ i ( t ) , we find that
ρ i ( s i ( t ) ) s ˙ i ( t ) = 1 γ i ( s i ( t ) ) s ˙ i 2 ( t ) j = 1 n e i j s ˙ i ( t ) s ˙ j ( t ζ j ) + j = 1 n ( a i j s ˙ i ( t ) g j ( s j ( t ) ) + b i j s ˙ i ( t ) g j ( s j ( t τ j ) ) ) , i
Using (28) in (26) yields
V ˙ 2 ( t ) = 2 i = 1 n p i ψ ^ i ( s i ( t ) ) γ i ( s i ( t ) ) s ˙ i 2 ( t ) + 2 i = 1 n j = 1 n ( p i ψ ^ i ( s i ( t ) ) a i j s ˙ i ( t ) g j ( s j ( t ) ) + p i ψ ^ i ( s i ( t ) ) b i j s ˙ i ( t ) g j ( s j ( t τ j ) ) + p i ψ ^ i ( s i ( t ) ) γ i ( s i ( t ) ) e i j s ˙ i ( t ) s ˙ j ( t ζ j ) ) + i = 1 n ξ ^ i s i 2 ( t ) ξ ^ i s i 2 ( t τ i ) + σ ^ i s ˙ i 2 ( t ) σ ^ i s ˙ i 2 ( t ζ i )
By virtue of Lemma 1 and under the conditions C 1 and C 3 , we can state the following important inequalities:
2 i = 1 n j = 1 n p i ψ ^ i ( s i ( t ) ) a i j s ˙ i ( t ) g j ( s j ( t ) ) 2 i = 1 n j = 1 n p i ψ ^ i ( s i ( t ) ) | a i j | | s ˙ i ( t ) | | g j ( s j ( t ) ) | 2 i = 1 n j = 1 n p i ψ ^ i ( s i ( t ) ) l j | a i j | | s j ( t ) | | s ˙ i ( t ) | i = 1 n j = 1 n κ ^ p i Λ ^ i l j 2 | a i j | s j 2 ( t ) + 1 κ ^ p i Λ ^ i | a i j | s ˙ i 2 ( t ) = i = 1 n j = 1 n κ ^ p j Λ ^ j l i 2 | a j i | s i 2 ( t ) + 1 κ ^ p i Λ ^ i | a i j | s ˙ i 2 ( t ) ,
2 i = 1 n j = 1 n p i ψ ^ i ( s i ( t ) ) b i j s ˙ i ( t ) g j ( s j ( t τ j ) ) 2 i = 1 n j = 1 n p i ψ ^ i ( s i ( t ) ) | b i j | | s ˙ i ( t ) | | g j ( s j ( t τ j ) ) | 2 i = 1 n j = 1 n p i ψ ^ i ( s i ( t ) ) l j | b i j | | s j ( t τ j ) | | s ˙ i ( t ) | i = 1 n j = 1 n β ^ p i Λ ^ i l j 2 | b i j | s j 2 ( t τ j ) + 1 β ^ p i Λ ^ i | b i j | s ˙ i 2 ( t ) = i = 1 n j = 1 n β ^ p j Λ ^ j l i 2 | b j i | s i 2 ( t τ i ) + 1 β ^ p i Λ ^ i | b i j | s ˙ i 2 ( t ) ,
2 i = 1 n j = 1 n p i ψ ^ i ( s i ( t ) ) γ i ( s i ( t ) ) e i j s ˙ i ( t ) s ˙ j ( t ζ j ) 2 i = 1 n j = 1 n p i ψ ^ i ( s i ( t ) ) γ i ( s i ( t ) ) | e i j | | s ˙ i ( t ) | | s ˙ j ( t ζ j ) | i = 1 n j = 1 n η ^ p i Φ ^ i | e i j | s ˙ j 2 ( t ζ j ) + 1 η ^ p i Φ ^ i | e i j | s ˙ i 2 ( t ) = i = 1 n j = 1 n η ^ p j Φ ^ j | e j i | s ˙ i 2 ( t ζ i ) + 1 η ^ p i Φ ^ i | e i j | s ˙ i 2 ( t )
and
2 i = 1 n p i ψ ^ i ( s i ( t ) ) γ i ( s i ( t ) ) s ˙ i 2 ( t ) 2 i = 1 n p i Θ ^ i s ˙ i 2 ( t )
Inserting (30)–(33) into (29) will result in
V ˙ 2 ( t ) i = 1 n j = 1 n ( κ ^ p j Λ ^ j l i 2 | a j i | s i 2 ( t ) + β ^ p j Λ ^ j l i 2 | b j i | s i 2 ( t τ i ) + 1 κ ^ p i Λ ^ i | a i j | s ˙ i 2 ( t ) + 1 β ^ p i ×   Λ ^ i | b i j | s ˙ i 2 ( t ) + 1 η ^ p i Φ ^ i | e i j | s ˙ i 2 ( t ) + η ^ p j Φ ^ j | e j i | s ˙ i 2 ( t ζ i ) ) 2 i = 1 n p i Θ ^ i s ˙ i 2 ( t ) + i = 1 n ξ ^ i s i 2 ( t ) ξ ^ i s i 2 ( t τ i ) + σ ^ i s ˙ i 2 ( t ) σ ^ i s ˙ i 2 ( t ζ i ) = i = 1 n ( δ ^ i s i 2 ( t ) + ω ^ i s ˙ i 2 ( t ) ε ^ i s ˙ i 2 ( t ) + ξ ^ i s i 2 ( t ) + σ ^ i s ˙ i 2 ( t ) + ξ ^ i s i 2 ( t τ i ) ξ ^ i s i 2 ( t τ i ) + σ ^ i s ˙ i 2 ( t ζ i ) σ ^ i s ˙ i 2 ( t ζ i ) )
(34) implies that
V ˙ 2 ( t ) i = 1 n ( δ ^ i + ξ ^ i ) s i 2 ( t ) ( ε ^ i σ ^ i ω ^ i ) s ˙ i 2 ( t )
For the time derivative of V 3 ( t ) , given by (6), it is noted that
V ˙ 3 ( t ) = i = 1 n 2 q i ψ ˜ i ( s i ( t ) ) s i ( t ) s ˙ i ( t ) + ξ ˜ i s i 2 ( t ) ξ ˜ i s i 2 ( t τ i ) + σ ˜ i s ˙ i 2 ( t ) σ ˜ i s ˙ i 2 ( t ζ i )
Let us multiply each side of (2) by s i ( t ) . Then, we obtain
s i ( t ) s ˙ i ( t ) = γ i ( s i ( t ) ) ρ i ( s i ( t ) ) s i ( t ) + j = 1 n ( γ i ( s i ( t ) ) a i j g j ( s j ( t ) ) + γ i ( s i ( t ) ) b i j ×   g j ( s j ( t τ j ) ) + e i j s ˙ j ( t ζ j ) ) s i ( t ) , i
Using (37) in (36) yields
V ˙ 3 ( t ) = 2 i = 1 n q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) s i ( t ) ρ i ( s i ( t ) ) + 2 i = 1 n j = 1 n ( q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) a i j ×   s i ( t ) g j ( s j ( t ) ) + q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) b i j s i ( t ) g j ( s j ( t τ j ) ) + q i ψ ˜ i ( s i ( t ) ) e i j ×   s i ( t ) s ˙ j ( t ζ j ) ) + i = 1 n ξ ˜ i s i 2 ( t ) ξ ˜ i s i 2 ( t τ i ) + σ ˜ i s ˙ i 2 ( t ) σ ˜ i s ˙ i 2 ( t ζ i )
Based on the conditions stated by C 1 C 3 and Lemma 1, we can express the following four inequalities required at the next stages of the proof:
2 i = 1 n j = 1 n q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) a i j s i ( t ) g j ( s j ( t ) ) 2 i = 1 n j = 1 n q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) | a i j | | s i ( t ) | | g j ( s j ( t ) ) | 2 i = 1 n j = 1 n q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) l j | a i j | | s j ( t ) | | s i ( t ) | i = 1 n j = 1 n κ ˜ q i Λ ˜ i l j | a i j | s j 2 ( t ) + 1 κ ˜ q i l j Λ ˜ i | a i j | s i 2 ( t ) = i = 1 n j = 1 n κ ˜ q j Λ ˜ j l i | a j i | s i 2 ( t ) + 1 κ ˜ q i l j Λ ˜ i | a i j | s i 2 ( t ) ,
2 i = 1 n j = 1 n q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) b i j s i ( t ) g j ( s j ( t τ j ) ) 2 i = 1 n j = 1 n q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) | b i j | | s i ( t ) | | g j ( s j ( t τ j ) ) | 2 i = 1 n j = 1 n q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) l j | b i j | | s j ( t τ j ) | | s i ( t ) | i = 1 n j = 1 n ( β ˜ q i Λ ˜ i l j | b i j | s j 2 ( t τ j ) + 1 β ˜ q i Λ ˜ i l j | b i j | s i 2 ( t ) ) = i = 1 n j = 1 n β ˜ q j Λ ˜ j l i | b j i | s i 2 ( t τ i ) + 1 β ˜ q i Λ ˜ i l j | b i j | s i 2 ( t ) ,
2 i = 1 n j = 1 n q i ψ ˜ i ( s i ( t ) ) e i j s i ( t ) s ˙ j ( t ζ j ) 2 i = 1 n j = 1 n q i ψ ˜ i ( s i ( t ) ) | e i j | | s i ( t ) | | s ˙ j ( t ζ j ) | i = 1 n j = 1 n η ˜ q i Φ ˜ i | e i j | s ˙ j 2 ( t ζ j ) + 1 η ˜ q i Φ ˜ i | e i j | s i 2 ( t ) = i = 1 n j = 1 n η ˜ q j Φ ˜ j | e j i | s ˙ i 2 ( t ζ i ) + 1 η ˜ q i Φ ˜ i | e i j | s i 2 ( t )
and
2 i = 1 n q i γ i ( s i ( t ) ) ψ ˜ i ( s i ( t ) ) s i ( t ) ρ i ( s i ( t ) ) 2 i = 1 n q i Υ ˜ i α i s i 2 ( t )
Inserting (39)–(42) into (38) yields
V ˙ 3 ( t ) 2 i = 1 n q i Υ ˜ i α i s i 2 ( t ) + i = 1 n j = 1 n ( κ ˜ q j Λ ˜ j l i | a j i | s i 2 ( t ) + 1 κ ˜ q i l j Λ ˜ i | a i j | s i 2 ( t ) + 1 β ˜ q i Λ ˜ i l j | b i j | s i 2 ( t ) + 1 η ˜ q i Φ ˜ i | e i j | s i 2 ( t ) + β ˜ q j Λ ˜ j l i | b j i | s i 2 ( t τ i ) + η ˜ q j Φ ˜ j | e j i | ×   s ˙ i 2 ( t ζ i ) ) + i = 1 n ξ ˜ i s i 2 ( t ) ξ ˜ i s i 2 ( t τ i ) + σ ˜ i s ˙ i 2 ( t ) σ ˜ i s ˙ i 2 ( t ζ i ) = i = 1 n ϵ ˜ i s i 2 ( t ) + δ ˜ i s i 2 ( t ) + σ ˜ i s ˙ i 2 ( t ) + ξ ˜ i s i 2 ( t ) + i = 1 n ξ ˜ i s i 2 ( t τ i ) ξ ˜ i s i 2 ( t τ i ) + σ ˜ i s ˙ i 2 ( t ζ i ) σ ˜ i s ˙ i 2 ( t ζ i )
(43) directly leads to
V ˙ 3 ( t ) i = 1 n ϵ ˜ i s i 2 ( t ) + δ ˜ i s i 2 ( t ) + ξ ˜ i s i 2 ( t ) + σ ˜ i s ˙ i 2 ( t ) = i = 1 n ( ϵ ˜ i δ ˜ i ξ ˜ i ) s i 2 ( t ) + σ ˜ i s ˙ i 2 ( t )
Using (25), (35) and (44) in (8) leads to
V ˙ ( t ) i = 1 n h 1 ( ϵ i δ i ξ i ) h 2 ( δ ^ i + ξ ^ i ) + h 3 ( ϵ ˜ i δ ˜ i ξ ˜ i ) s i 2 ( t ) i = 1 n h 1 ( ε i σ i ) + h 2 ( ε ^ i σ ^ i ω ^ i ) h 3 σ ˜ i s ˙ i 2 ( t ) = i = 1 n ϱ i s i 2 ( t ) i = 1 n ϑ i s ˙ i 2 ( t ) ϱ m s ( t ) 2 2 ϑ m s ˙ ( t ) 2 2
where ϱ m = min 1 i n { ϱ i } and ϑ m = min 1 i n { ϑ i } . In (45), we can immediately observe that if s ( t ) 0 or s ˙ ( t ) 0 , then V ˙ ( t ) < 0 . One can also observe that, if s ( t ) = s ˙ ( t ) = 0 holds, then one simply determines from (9), (26) and (36) that
V ˙ ( t ) = i = 1 n ( h 1 ξ i + h 2 ξ ^ i + h 3 ξ ˜ i ) s i 2 ( t τ i ) i = 1 n ( h 1 σ i + h 2 σ ^ i + h 3 σ ˜ i ) s ˙ i 2 ( t ζ i )
Note that if s i ( t τ i ) 0 or s ˙ i ( t ζ i ) 0 , for at least one index i, then (46) implies that V ˙ ( t ) < 0 . Assume that s i ( t ) = s ˙ i ( t ) = s i ( t τ i ) = s ˙ i ( t ζ i ) = 0 , i , hold. Then, in this particular case, the condition V ˙ ( t ) = 0 will be satisfied. Consequently, according to the Lyapunov stability theorems, it can be established that the origin of neutral system (2) is asymptotically stable. Additionally, it is also of interest to examine the key condition that the main Lyapunov functional stated in (7) is radially unbounded. This property directly indicates that V ( t ) as s ( t ) , which ensures that the origin of the neutral system defined by (2) is globally asymptotically stable. We note here that global asymptotic stability of an equilibrium point directly implies its uniqueness. We can now conclude that if s ( t ) globally asymptotically converges to the origin, in the light of s ( t ) = x ( t ) x , then x ( t ) will globally asymptotically converge to x . This implies that neutral system (1) is globally asymptotically stable. □
Remark 1.
We can now directly make some important remarks that the previously published global stability results on different classes of neutral Cohen–Grossberg neural networks can be directly derived from some certain appropriate choices of special cases of the set of the Lyapunov functionals used in the proof of Theorem 1. In [44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59], the Lyapunov functionals for the following special cases have been used for the stability analysis: h 1 = 0 , h 2 + h 3 = 1 and k ^ 1 = k ˜ 1 = 1 [49]; h 2 = 0 , h 1 + h 3 = 1 and k 3 = k ˜ 1 = 1 [50]; h 1 = 1 , h 2 = h 3 = 0 and k 3 = 1 [45,46,47,48,57]; h 2 = 0 , h 1 + h 3 = 1 , k 2 = k ˜ 2 = 1 [51]; h 1 = h 2 = 0 , h 3 = 1 and k ˜ 2 = 1 [44,52,53,54,55,56,58] and h 1 = 0 , h 2 + h 3 = 1 and k ^ 3 = k ˜ 1 = 1 [59]. Therefore, this paper presents a general framework for the establishment of the suitable Lyapunov functionals of the quadratic forms for stability analysis of various classes of neutral Cohen–Grossberg neural networks that contain different numbers of time and neutral delay components.

4. A Numerical Example and Simulation Results

This section presents an instructive numerical example together with some simulation results to emphasize the effectiveness of the stability criteria derived in Theorem 1 for system (1) with n = 4 .
Example 1.
Consider system (1) which possesses the system parameters and matrices given as: l 1 = l 2 = l 3 = l 4 = 0.3 , α 1 = α 2 = α 3 = α 4 = 1.8 , c i ( x i ( t ) ) = 1.8 x i ( t ) , f i ( x i ( t ) ) = 0.3 tanh ( x i ( t ) ) , d i ( x i ( t ) ) = 1.35 + 0.15 sin 2 ( x i ( t ) ) , i = 1 , 2 , 3 , 4 ,
A = 0.47 0.02 0.08 0.01 0.05 0.43 0.03 0.09 0.01 0.06 0.45 0.04 0.08 0.02 0.07 0.41 , B = 0.92 0.05 0.12 0.03 0.11 0.88 0.07 0.18 0.04 0.14 0.95 0.09 0.19 0.26 0.13 0.40
and
E = 0.11 0.01 0.01 0.01 0.01 0.10 0.02 0.01 0.02 0.01 0.11 0.01 0.01 0.02 0.01 0.07 .
Note that υ m = 1.35 , and ϕ M = 1.5 . For this example, let p i = q i = 1 , i = 1 , 2 , 3 , 4 and θ 1 = θ 2 = μ 1 = μ 2 = π 1 = π 2 = 0.5 .
First, let h 1 = 0.7 , h 2 = 0.15 , h 3 = 0.15 , κ = κ ˜ = β = β ˜ = η = η ˜ = 1 , κ ^ = β ^ = η ^ = 0.5 , k 1 = 0.3 ,   k 2 = 0.4 ,   k 3 = 0.3 , k ^ 1 = 0.2 ,   k ^ 2 = 0.1 ,   k ^ 3 = 0.7 , k ˜ 1 = 0.4 ,   k ˜ 2 = 0.5 ,   k ˜ 3 = 0.1 , τ 1 = 3 ,   τ 2 = 5 ,   τ 3 = 4 ,   τ 4 = 2 , ζ 1 = 11.2 ,   ζ 2 = 12.8 ,   ζ 3 = 9.4 and ζ 4 = 15 . The maximum delay bounds for these delays are τ M = 5 and ζ M = 15 where χ = max { τ M , ζ M } = 15 and the initial condition functions are chosen as follows
x ( t ) = 0.4 cos ( 2 t ) + 0.3 sin ( 2 t ) 0.2 cos ( 2 t ) 0.3 sin ( 2 t ) 0.2 cos ( 2 t ) + 0.3 sin ( 2 t ) 0.4 cos ( 2 t ) 0.3 sin ( 2 t ) , t [ 15 , 0 ]
Then, we calculate ϱ 1 = 3.1238 ,   ϱ 2 = 3.0963 ,   ϱ 3 = 3.0995 ,   ϱ 4 = 3.2789 ,   ϑ 1 = 0.1510 ,   ϑ 2 = 0.1178 ,   ϑ 3 = 0.1275 and ϑ 4 = 0.2093 . Thus, the stability criteria of Theorem 1 are justified. The time response of neutral system (1) in this case of the example is depicted in Figure 1.
Now, let h 1 = 0.7 , h 2 = 0.15 , h 3 = 0.15 , κ = κ ˜ = β = β ˜ = η = η ˜ = 1 , κ ^ = β ^ = η ^ = 0.5 , k 1 = k ^ 1 = k ˜ 1 = 1 , τ 1 = 3 , τ 2 = 5 , τ 3 = 4 , τ 4 = 2 , ζ 1 = 11.2 ,   ζ 2 = 12.8 ,   ζ 3 = 9.4 and ζ 4 = 15 . The maximum delay bounds for these delays are τ M = 5 and ζ M = 15 where χ = max { τ M , ζ M } = 15 . We now select the initial conditions of neutral system (1) as follows
x ( t ) = 0.3 0.2 0.2 0.3 , t [ 15 , 0 ]
In this case of the example, we also calculate ϱ 1 = 2.9407 ,   ϱ 2 = 2.9163 ,   ϱ 3 = 2.9191 ,   ϱ 4 = 3.0785 ,   ϑ 1 = 0.0724 ,   ϑ 2 = 0.0335 ,   ϑ 3 = 0.0455 and ϑ 4 = 0.1363 . Thus, the stability criteria derived in Theorem 1 hold. The time response of neutral system (1) is depicted in Figure 2.
Consider the case where h 1 = 1 , h 2 = 0 , h 3 = 0 , κ = κ ˜ = β = β ˜ = η = η ˜ = 1 , κ ^ = β ^ = η ^ = 0.5 , k 1 = k ^ 1 = k ˜ 1 = 1 , τ 1 = 1.2 , τ 2 = 1.8 , τ 3 = 1.5 , τ 4 = 2.1 , ζ 1 = 0.5 ,   ζ 2 = 0.9 ,   ζ 3 = 0.7 and ζ 4 = 1.2 . The maximum delay bounds for these delays are τ M = 2.1 and ζ M = 1.2 where χ = max { τ M , ζ M } = 2.1 and the initial conditions are selected as follows
x ( t ) = 0.3 0.2 0.2 0.3 , t [ 2.1 , 0 ]
Then, we calculate ϱ 1 = 3.6993 , ϱ 2 = 3.6728 , ϱ 3 = 3.6774 , ϱ 4 = 3.8366 , ϑ 1 = 0.6264 , ϑ 2 = 0.6284 , ϑ 3 = 0.6254 and ϑ 4 = 0.6363 . Thus, the conditions obtained in Theorem 1 hold. For this selection of the parameters, the time response of neutral system given by (1) in this case of the example is depicted in Figure 3.
Finally, let h 1 = 0 , h 2 = 0.5 , h 3 = 0.5 , κ = κ ˜ = β = β ˜ = η = η ˜ = 1 , κ ^ = β ^ = 3 , η ^ = 0.5 , k 1 = k ^ 1 = k ˜ 1 = 1 , τ 1 = 1.2 , τ 2 = 1.8 , τ 3 = 1.5 , τ 4 = 2.1 , ζ 1 = 0.5 ,   ζ 2 = 0.9 ,   ζ 3 = 0.7 and ζ 4 = 1.2 . The maximum delay bounds for these delays are τ M = 2.1 and ζ M = 1.2 where χ = max { τ M , ζ M } = 2.1 and the initial condition functions are chosen as given below
x ( t ) = 0.4 cos ( 2 t ) + 0.3 sin ( 2 t ) 0.2 cos ( 2 t ) 0.3 sin ( 2 t ) 0.2 cos ( 2 t ) + 0.3 sin ( 2 t ) 0.4 cos ( 2 t ) 0.3 sin ( 2 t ) , t [ 2.1 , 0 ]
Then, we calculate ϱ 1 = 0.9602 , ϱ 2 = 0.9420 , ϱ 3 = 0.9359 , ϱ 4 = 1.1690 , ϑ 1 = 0.1963 , ϑ 2 = 0.1785 , ϑ 3 = 0.1756 and ϑ 4 = 0.2696 . Consequently, the conditions determined by Theorem 1 are justified. For these parameters of the example, the time response of neutral system defined by (1) is depicted in Figure 4.

5. Conclusions

This article has conducted a theoretical investigation into the stability analysis of neutral-type Cohen–Grossberg neural networks containing discrete time and neutral delay terms. We have established a suitable Lyapunov functional comprising the linear combination of three main Lyapunov functionals of quadratic form. Then, by exploiting this constructed Lyapunov functional, together with some appropriate matrix analysis techniques, novel sufficient conditions for the global asymptotic stability of the neutral neural system have been obtained. The stability conditions are mainly related to the basic network parameters and are independent of the size of the time and neutral delay components. It has been additionally shown that many sets of previously reported stability results associated with different forms of the same neural network can be directly determined from appropriate special cases of the set of Lyapunov functionals employed in this research study. A numerical example, covering different cases of the constructed main Lyapunov functional, has been considered to indicate the applicability of the obtained results. Since employing the appropriate Lyapunov functionals is an essential factor in stability analysis of linear and nonlinear dynamical systems, the analysis techniques and methods used in this paper may lead to some further research in the area of stability theory of various classes of neutral systems. We find it important to note that different models of linear and nonlinear neutral systems can be derived from system (1) by choosing the system functions in some appropriate forms. Then, the Lyapunov functionals proposed in this paper can be further modified for the systems for which the stability analysis will be conducted. The current paper has considered the system with n time delays and n neutral delays. However, the Lyapunov functionals in this paper can be easily used to study the stability of neutral systems with n 2 time delays and n 2 neutral delays, which would make some important contributions to the previously published results for such systems.

Author Contributions

Conceptualization, O.F. and S.A.; methodology, S.A.; validation, S.A., O.F. and M.S.A.; formal analysis, S.A.; investigation, O.F.; resources, M.S.A.; writing—original draft preparation, S.A.; writing—review and editing, M.S.A. and S.A.; visualization, O.F.; supervision, S.A.; project administration, O.F.; funding acquisition, O.F. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Scientific and Technological Research Council of Turkey (TUBITAK) under Grant No. 125F571. Melike SOLAK ALTUNTAS is supported by the TUBITAK BIDEB 2211-A National Ph.D. Scholarship Program.

Data Availability Statement

The original contributions presented in the study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Cohen, M.; Grossberg, S. Absolute stability of global pattern formation and parallel memory storage by competitive neural networks. IEEE Trans. Syst. Man Cybern. 1983, 13, 815–826. [Google Scholar] [CrossRef] [Scilit]
  2. Hopfield, J. Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. USA 1982, 79, 2554–2558. [Google Scholar] [CrossRef] [Scilit]
  3. Hopfield, J. Neurons with graded response have collective computational properties like those of two-state neurons. Proc. Natl. Acad. Sci. USA 1984, 81, 3088–3092. [Google Scholar] [CrossRef] [Scilit]
  4. Kennedy, M.; Chua, L. Neural networks for nonlinear programming. IEEE Trans. Circuits Syst. 1988, 35, 554–562. [Google Scholar] [CrossRef] [Scilit]
  5. Pearlmutter, B. Gradient calculations for dynamic recurrent neural networks: A survey. IEEE Trans. Neural Netw. 1995, 6, 1212–1228. [Google Scholar] [CrossRef] [Scilit]
  6. Takahashi, Y. A unified constructive network model for problem solving. Theor. Comput. Sci. 1996, 156, 217–261. [Google Scholar] [CrossRef] [Scilit]
  7. Tank, D.; Hopfield, J. Simple neural optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit. IEEE Trans. Circuits Syst. 1986, 33, 533–541. [Google Scholar] [CrossRef] [Scilit]
  8. Vazquez, A.R.; Castro, R.D.; Rueda, A.; Sinencio, E.S. Nonlinear switched capacitor neural networks for optimization problems. IEEE Trans. Circuits Syst. I 1990, 37, 384–398. [Google Scholar] [CrossRef] [Scilit]
  9. Fang, Y.; Kincaid, T.G. Stability analysis of dynamical neural networks. IEEE Trans. Neural Netw. 1996, 7, 996–1006. [Google Scholar] [CrossRef] [Scilit]
  10. Qiao, H.; Peng, J.; Xu, Z.B.; Zhang, B. A reference model approach to stability analysis of neural networks. IEEE Trans. Syst. Man Cybern. Part B 2003, 33, 925–936. [Google Scholar] [CrossRef] [Scilit]
  11. Rajchakit, G.; Agarwal, P.; Ramalingam, S. Stability Analysis of Neural Networks; Springer Nature: Singapore, 2021. [Google Scholar]
  12. Zhang, H.; Wang, Z.; Liu, D. A comprehensive review of stability analysis of continuous-time recurrent neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2014, 25, 1229–1262. [Google Scholar] [CrossRef] [Scilit]
  13. Baldi, P.; Atiya, A. How delays affect neural dynamics and learning. IEEE Trans. Neural Netw. 1994, 5, 612–621. [Google Scholar] [CrossRef] [Scilit]
  14. Cooke, K.; Grossman, Z. Discrete delay, distributed delay and stability switches. J. Math. Anal. Appl. 1982, 86, 592–627. [Google Scholar] [CrossRef] [Scilit]
  15. Marcus, C.; Westervelt, R. Stability of analog neural networks with delay. Phys. Rev. A 1989, 39, 347–359. [Google Scholar] [CrossRef] [Scilit]
  16. Aktas, E.; Faydasicok, O.; Arik, S. Robust stability of dynamical neural networks with multiple time delays: A review and new results. Artif. Intell. Rev. 2023, 56, 1647–1684. [Google Scholar] [CrossRef] [Scilit]
  17. Arik, S. New criteria for global robust stability of delayed neural networks with norm-bounded uncertainties. IEEE Trans. Neural Netw. Learn. Syst. 2014, 25, 1045–1052. [Google Scholar] [CrossRef] [Scilit]
  18. Cao, J.; Huang, D.; Qu, Y. Global robust stability of delayed recurrent neural networks. Chaos Solitons Fractals 2005, 23, 221–229. [Google Scholar] [CrossRef] [Scilit]
  19. Chen, Y.; Zhang, N.; Yang, J. A survey of recent advances on stability analysis, state estimation and synchronization control for neural networks. Neurocomputing 2023, 515, 26–36. [Google Scholar] [CrossRef] [Scilit]
  20. Du, F.F.; Lu, J.G. New criteria on finite-time stability of fractional-order Hopfield neural networks with time delays. IEEE Trans. Neural Netw. Learn. Syst. 2021, 32, 3858–3866. [Google Scholar] [CrossRef] [Scilit]
  21. Lin, H.C.; Zeng, H.B.; Zhang, X.M.; Wang, W. Stability analysis for delayed neural networks via a generalized reciprocally convex inequality. IEEE Trans. Neural Netw. Learn. Syst. 2023, 34, 7491–7499. [Google Scholar] [CrossRef] [Scilit]
  22. Wang, H.; Wei, G.; Wen, S.; Huang, T. Generalized norm for existence, uniqueness and stability of Hopfield neural networks with discrete and distributed delays. Neural Netw. 2020, 128, 288–293. [Google Scholar] [CrossRef] [Scilit]
  23. Wei, C.; Wang, X.; Hui, M.; Zeng, Z. Quasi-synchronization of fractional multiweighted coupled neural networks via aperiodic intermittent control. IEEE Trans. Cybern. 2024, 54, 1671–1684. [Google Scholar] [CrossRef] [Scilit]
  24. Zhang, G.; Cao, J. New results on fixed/predefined-time synchronization of delayed fuzzy inertial discontinuous neural networks. Appl. Math. Comput. 2023, 440, 127671. [Google Scholar] [CrossRef] [Scilit]
  25. Kolmanovskii, V.B.; Nosov, V.R. Stability of Functional Differential Equations; Mathematics in Science and Engineering; Academic Press: Cambridge, MA, USA, 1986; Volume 180. [Google Scholar]
  26. Shatyrko, A.; van Nooijen, R.R.P.; Kolechkina, A.; Khusainov, D. Stabilization of neutral-type indirect control systems to absolute stability state. Adv. Differ. Equ. 2015, 2015, 64. [Google Scholar] [CrossRef] [Scilit]
  27. Kolmanovskii, V.; Myshkis, A. Introduction to the Theory and Applications of Functional-Differential Equations; Mathematics and Its Applications; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1999; Volume 463. [Google Scholar]
  28. Chukwu, E.N. Stability and Time-Optimal Control of Hereditary Systems: With Application to the Economic Dynamics of the US; World Scientific: Singapore, 2001. [Google Scholar]
  29. Baker, C.T.H.; Bocharov, G.A.; Rihan, F.A. Neutral delay differential equations in the modelling of cell growth. J. Egypt. Math. Soc. 2008, 16, 133–160. [Google Scholar]
  30. Chukwu, E.N. Differential Models and Neutral Systems for Controlling the Wealth of Nations; World Scientific: Singapore, 2001. [Google Scholar]
  31. Hadeler, K.P.; Bocharov, G. Where to put delays in population models, in particular in the neutral case. Can. Appl. Math. Q. 2003, 11, 159–173. [Google Scholar]
  32. Aouiti, C.; Coirault, P.; Miaadi, F.; Moulay, E. Finite time boundedness of neutral high-order Hopfield neural networks with time delay in the leakage term and mixed time delays. Neurocomputing 2017, 260, 378–392. [Google Scholar] [CrossRef] [Scilit]
  33. Arik, S. A modified Lyapunov functional with application to stability of neutral-type neural networks with time delays. J. Frankl. Inst. 2019, 356, 276–291. [Google Scholar] [CrossRef] [Scilit]
  34. Arik, S. New criteria for stability of neutral-type neural networks with multiple time delays. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 1504–1514. [Google Scholar] [CrossRef] [Scilit]
  35. Dong, J.; Ma, W. Sufficient conditions for global attractivity of a class of neutral Hopfield-type neural networks. Neurocomputing 2015, 153, 89–95. [Google Scholar] [CrossRef] [Scilit]
  36. Faydasicok, O. A new Lyapunov functional for stability analysis of neutral-type Hopfield neural networks with multiple delays. Neural Netw. 2020, 129, 288–297. [Google Scholar] [CrossRef] [Scilit]
  37. Li, L.; Li, Y.; Yang, L. Almost periodic solutions for neutral delay Hopfield neural networks with time-varying delays in the leakage term on time scales. Adv. Differ. Equ. 2014, 2014, 178. [Google Scholar] [CrossRef] [Scilit]
  38. Li, Y.; Yang, L. Almost automorphic solution for neutral type high-order Hopfield neural networks with delays in leakage terms on time scales. Appl. Math. Comput. 2014, 242, 679–693. [Google Scholar] [CrossRef] [Scilit]
  39. Orman, Z. New sufficient conditions for global stability of neutral-type neural networks with time delays. Neurocomputing 2012, 97, 141–148. [Google Scholar] [CrossRef] [Scilit]
  40. Skvortsova, M.A. Systems of Neutral Type Equations and a Model of Hopfield Neural Network. Sib. Adv. Math. 2025, 35, 324–342. [Google Scholar] [CrossRef] [Scilit]
  41. Wan, L.; Zhou, Q.; Fu, H.; Zhang, Q. Exponential stability of Hopfield neural networks of neutral type with multiple time-varying delays. AIMS Math. 2021, 6, 8030–8043. [Google Scholar] [CrossRef] [Scilit]
  42. Wu, F. Global asymptotic stability for neutral-type Hopfield neural networks with multiple delays. J. Phys. Conf. Ser. 2021, 1883, 012089. [Google Scholar] [CrossRef] [Scilit]
  43. Zhu, J.; Zhang, Q.; Yang, C. Delay-dependent robust stability for Hopfield neural networks of neutral-type. Neurocomputing 2009, 72, 2609–2617. [Google Scholar] [CrossRef] [Scilit]
  44. Akça, H.; Covachev, V.; Covacheva, Z. Global asymptotic stability of Cohen–Grossberg neural networks of neutral type. J. Math. Sci. 2015, 205, 719–728. [Google Scholar] [CrossRef] [Scilit]
  45. Arik, S. An analysis of stability of neutral-type neural systems with constant time delays. J. Frankl. Inst. 2014, 351, 4949–4959. [Google Scholar] [CrossRef] [Scilit]
  46. Faydasicok, O. New criteria for global stability of neutral-type Cohen–Grossberg neural networks with multiple delays. Neural Netw. 2020, 125, 330–337. [Google Scholar] [CrossRef] [Scilit]
  47. Faydasicok, O. New results on stability of delayed Cohen–Grossberg neural networks of neutral type. Complexity 2020, 2020, 1973548. [Google Scholar] [CrossRef] [Scilit]
  48. Faydasicok, O. Further stability analysis of neutral-type Cohen–Grossberg neural networks with multiple delays. Discret. Contin. Dyn. Syst.-Ser. S 2021, 14, 1245–1258. [Google Scholar] [CrossRef] [Scilit]
  49. Faydasicok, O.; Arik, S. A novel Lyapunov stability analysis of neutral-type Cohen–Grossberg neural networks with multiple delays. Neural Netw. 2022, 155, 330–339. [Google Scholar] [CrossRef] [Scilit]
  50. Faydasicok, O.; Arik, S. The combined Lyapunov functionals method for stability analysis of neutral Cohen–Grossberg neural networks with multiple delays. Neural Netw. 2024, 180, 106641. [Google Scholar] [CrossRef] [Scilit]
  51. Gan, B.; Chen, H.; Xu, B.; Kang, W. A norm stability condition of neutral-type Cohen–Grossberg neural networks with multiple time delays. Chaos Solitons Fractals 2023, 175, 113958. [Google Scholar] [CrossRef] [Scilit]
  52. Jian, J.; Wang, B. Global Lagrange stability for neutral-type Cohen–Grossberg BAM neural networks with mixed time-varying delays. Math. Comput. Simul. 2015, 116, 1–25. [Google Scholar] [CrossRef] [Scilit]
  53. Kong, F.; Zhu, Q. New results on global stability analysis of discontinuous Cohen–Grossberg neural networks of neutral-type in Hale’s form. Int. J. Control 2020, 95, 516–525. [Google Scholar] [CrossRef] [Scilit]
  54. Ozcan, N. Stability analysis of Cohen–Grossberg neural networks of neutral-type: Multiple delays case. Neural Netw. 2019, 113, 20–27. [Google Scholar] [CrossRef] [Scilit]
  55. Samli, R.; Senan, S.; Yucel, E.; Orman, Z. Some generalized global stability criteria for delayed Cohen–Grossberg neural networks of neutral-type. Neural Netw. 2019, 116, 198–207. [Google Scholar] [CrossRef] [Scilit]
  56. Sriraman, R.; Rajchakit, G.; Kwon, O.M.; Lee, S.M. Stability analysis for delayed Cohen–Grossberg Clifford-valued neutral-type neural networks. Math. Methods Appl. Sci. 2022, 45, 10925–10945. [Google Scholar] [CrossRef] [Scilit]
  57. Wang, L.; Gan, B.; Chen, H. Neutral-Type CGNNs With Multiple Delays: A Frobenius Norm Approach to Stability. IEEE Access 2025, 13, 162845–162854. [Google Scholar] [CrossRef] [Scilit]
  58. Zhang, Z.; Liu, W.; Zhou, D. Global asymptotic stability to a generalized Cohen–Grossberg BAM neural networks of neutral type delays. Neural Netw. 2012, 25, 94–105. [Google Scholar] [CrossRef] [Scilit]
  59. Zheng, C.D.; Li, J.W.; Wang, Z. New stability criteria for neutral-type Cohen–Grossberg neural networks with discrete and distributed delays. Int. J. Comput. Math. 2012, 89, 443–466. [Google Scholar] [CrossRef] [Scilit]
Figure 1. The time response of states of system (1).
Figure 1. The time response of states of system (1).
Mathematics 14 03075 g001
Figure 2. The time response of states of system (1).
Figure 2. The time response of states of system (1).
Mathematics 14 03075 g002
Figure 3. The time response of states of system (1).
Figure 3. The time response of states of system (1).
Mathematics 14 03075 g003
Figure 4. The time response of system states (1).
Figure 4. The time response of system states (1).
Mathematics 14 03075 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

Altuntas, M.S.; Faydasicok, O.; Arik, S. A General Framework for Stability Analysis of Neutral Cohen–Grossberg Neural Networks with Discrete Delay Terms. Mathematics 2026, 14, 3075. https://doi.org/10.3390/math14173075

AMA Style

Altuntas MS, Faydasicok O, Arik S. A General Framework for Stability Analysis of Neutral Cohen–Grossberg Neural Networks with Discrete Delay Terms. Mathematics. 2026; 14(17):3075. https://doi.org/10.3390/math14173075

Chicago/Turabian Style

Altuntas, Melike Solak, Ozlem Faydasicok, and Sabri Arik. 2026. "A General Framework for Stability Analysis of Neutral Cohen–Grossberg Neural Networks with Discrete Delay Terms" Mathematics 14, no. 17: 3075. https://doi.org/10.3390/math14173075

APA Style

Altuntas, M. S., Faydasicok, O., & Arik, S. (2026). A General Framework for Stability Analysis of Neutral Cohen–Grossberg Neural Networks with Discrete Delay Terms. Mathematics, 14(17), 3075. https://doi.org/10.3390/math14173075

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