Next Article in Journal
Infinite Sum of the Incomplete Gamma Function Expressed in Terms of the Hurwitz Zeta Function
Previous Article in Journal
Understanding Consumer Stockpiling during the COVID-19 Outbreak through the Theory of Planned Behavior
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stability Analysis of Pseudo-Almost Periodic Solution for a Class of Cellular Neural Network with D Operator and Time-Varying Delays

School of Aeronautics and Astronautics, Sun Yat-sen University, Guangzhou 510275, China
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(16), 1951; https://doi.org/10.3390/math9161951
Submission received: 23 July 2021 / Revised: 11 August 2021 / Accepted: 13 August 2021 / Published: 15 August 2021
(This article belongs to the Topic Dynamical Systems: Theory and Applications)

Abstract

:
Cellular neural networks with D operator and time-varying delays are found to be effective in demonstrating complex dynamic behaviors. The stability analysis of the pseudo-almost periodic solution for a novel neural network of this kind is considered in this work. A generalized class neural networks model, combining cellular neural networks and the shunting inhibitory neural networks with D operator and time-varying delays is constructed. Based on the fixed-point theory and the exponential dichotomy of linear equations, the existence and uniqueness of pseudo-almost periodic solutions are investigated. Through a suitable variable transformation, the globally exponentially stable sufficient condition of the cellular neural network is examined. Compared with previous studies on the stability of periodic solutions, the global exponential stability analysis for this work avoids constructing the complex Lyapunov functional. Therefore, the stability criteria of the pseudo-almost periodic solution for cellular neural networks in this paper are more precise and less conservative. Finally, an example is presented to illustrate the feasibility and effectiveness of our obtained theoretical results.

1. Introduction

In recent years, the cellular neural networks (CNN), first proposed by Chua and Yang [1,2], have received significant attention because of their wide applications in science and engineering technology fields. Extensive research has been conducted on CNN in the past few decades, and one of the primary problems in designing CNN is to deal with the dynamic curves of existing solutions. Regarding the existence, uniqueness, and stability of the periodic, almost periodic solutions of neural networks, there have been many results in the fields of classification, signal processing [3], associative memory [4,5], optimal control [6], and filter problem [7,8,9]. The state estimation problem of delayed static neural networks has been considered by Wang and Xia et al. [10]. Donkers et al. showed stability analysis results of networked control systems employing a switched linear systems approach [11]. Liang and Wang et al. [12], mainly examined the robust synchronization issue for two-dimension discrete-time coupled dynamical neural networks. Due to the limited bandwidth speed and the constraints of physical property for circuit equipment, information propagation inevitably give birth to the emergence of time delays, meanwhile arising other problems of the CNN. The appearance of time lags usually causes turbulence, instability, and chaos [13,14]. The stability of discrete-time systems with time-varying delays via a novel summation inequality was discussed in [15,16]. For the reason that information transmission between neurons has time delays behavior, the neural network model with delay described by the time delays functional differential equation has been widely examined and implemented in various fields.
Due to similarity to the circuit system’s connection, CNN is a practical and feasible alternative to the circuit system simulation [17]. Many scholars realized the vital of neural networks and introduced novel research methods to work with their dynamic behavior [18,19]. Subsequently, some scholars also proposed several different types of CNN models and discussed the dynamic characteristics of solution curves [20,21]. In 2018, hierarchical type stability criteria for delayed neural networks via canonical Bessel–Legendre inequalities had been demonstrated [22]. In particular, shunt suppression of artificial CNN has been widely used in various research fields such as pattern recognition [23], image processing [24], and combination optimization [25]. The dynamic characteristics of neural networks, such as the existence, uniqueness, and global asymptotic stability of the equilibrium point and periodic solution for time-delay CNN play a crucial role. However, most of the existing results on the dynamic behavior of CNN focus on stability or periodicity. Fewer have been done on the existence of periodic solutions or almost periodic solutions for Cohen–Grossberg neural networks with delays [26,27].
Many motion processes in the present world are approximate to periodic instead of strictly periodicity. Conventionally, to reduce computing tasks’ burden, the complex system is usually idealized as a periodic. However, the system may not have periodicity for various CNN systems, even though all its parameters are periodic due to the uncertainty of the system’s parameters’ periodicity. Hence, the complex system may have no periodic solution curves. Danish mathematicians Bohr [28] first proposed the concept of almost periodicity, which is a significant generalization for practical application. Following the work proposed by Bohr, some scholars have been put forward many different techniques to expand the research of almost periodic solutions of complex systems [29,30]. Similarly, the concept of pseudo-almost periodicity was proposed by Zhang [31] in 1992, and it was further extended from the natural almost periodic to the pseudo-almost periodic in the Bohr sense.
Including many commonly used forms that may exist, the dynamic behavior of pseudo-almost periodicity is more extensive and approximate to the actual [32]. Therefore, the described neural network characteristic has a high degree of complexity and importance significance [33]. In CNN systems, the process of information transmission and mutual reaction between neurons is exceptionally complicated, and various phenomena such as disturbance, instability, bifurcation, and chaos may occur [34]. Therefore, it is of both theoretical and practical vital to examine the dynamic behavior of CNN systems pseudo-almost periodicity. There is relatively tiny related literature on pseudo-almost periodic research so far. For example, Liu [35] studied the pseudo-almost periodic solutions for neutral-type CNN with continuously distributed leakage delays; and others investigated the pseudo-almost periodic solutions for a Lasota–Wazewska model with an oscillating death rate [36]. As far as we know, there is still a massive gap in the investigation of the pseudo-almost periodicity, insufficient work was done on the existence and stability of pseudo-almost periodic solutions on neural networks with proportional delays [37]. Therefore, based on the previous examined, further exploration of the pseudo-almost periodic solution is one of the targets for this work. The main contributions of this paper are as follows: (1) This work not only considered the D operator systems but also investigated the effects of time-delays on dynamical complex network systems. (2) The approach we utilized was completely different previous. (3) The stability criteria of the pseudo-almost periodic solution in this paper are more precise and less conservative. (4) Compared with previous studies on the stability criteria, analyzing the globally exponentially stable avoids constructing the complex Lyapunov functional.
By employing innovative fixed-point theory and exponential dichotomy methods, we derived the pseudo-almost periodic solutions stability issue, which is entirely different from earlier work. The obtained results in this paper are novel, meanwhile promoting and supplement some of the previous research work. The r-neighborhood of a cell x i j defines as follows:
N r 0 ( i , j ) = { x p q | d i j , p q = | p i | 2 + | q j | 2 r 2 , 1 p m , 1 q n } ,
where r 2 is a positive integer number. Since each cell of CNN is only connected to its neighboring areas, those cells that are not directly connected may be affected by continuous-time propagation effects and indirectly affect each other. Furthermore, due to the neural network’s increasing distance, the influence between different neurons in CNN is correspondingly weakened.
Several previous works are the motivation for us to propose the new r-neighborhood N r 0 ( i , j ) , we examined the novel types of cellular neural networks with D operator and time-varying delays as follows:
[ x i j ( t ) p i j ( t ) x i j ( t δ i j ( t ) ) ] = a i j ( t ) x i j ( t ) + i = 1 m j = 1 n b i j ( t ) f i j ( t , x i 1 j ( t ) , x i j 1 ( t ) , x i j + 1 ( t ) , x i + 1 j ( t ) ) + i = 1 m j = 1 n c i j ( t ) g i j ( t , x i 1 j τ ( t ) , x i j 1 τ ( t ) , x i j + 1 τ ( t ) , x i + 1 j τ ( t ) ) + L i j ( t ) ,
where x i j τ ( t ) = x i j ( t τ i j ( t ) ) , 1 i m , 1 j n .   x i j ( t ) corresponds to the state of the i j t h cell (at the (i, j) position of the lattice) at time t, a i j ( t ) > 0 represents the rates with which the i j t h cell will reset its potential to the resting state in isolation when disconnected from the networks and external inputs at time t; f i j ( ) , g i j ( ) denote the activation functions of signal transmission. p i j ( t ) , b i j ( t ) , c i j ( t ) denote the connection weights at time t, δ i j ( t ) 0 , τ i j ( t ) 0 corresponding to the transmission delays, and L i j ( t ) are the external inputs on the i j t h cell at time t.
The initial conditions of the system (1) are assumed to be
x i j ( s ) = ϕ i j ( s ) , s [ τ , 0 ] , 1 i m , 1 j n ,
where ϕ i j ( s ) is a continuous function,
τ = max 1 i m , 1 j n sup t { | δ i j ( t ) | , | x i 1 j ( t ) | , | x i j 1 ( t ) | , | x i j + 1 ( t ) | , | x i + 1 j ( t ) | } .
The paper is organized as follows. In Section 2, we will introduce some definitions and lemmas, which will be used to obtain our results. In Section 3, we state and demonstrate the existence and global exponential stability of the pseudo-almost periodic solution. In Section 4, an example illustrates the feasibility and effectiveness of obtained theoretical results. In Section 5, a brief conclusion is given.

2. Preliminaries

In this section, we recall briefly some basic definitions and properties of pseudo-almost periodic functions and the exponential dichotomy.
Definition 1.
Let u ( ) B C ( , n ) . u ( ) is said to be (Bohr) almost periodic on n , if for any ε > 0 , the set
T ( u , ε ) = { δ : u ( t + δ ) u ( t ) < ε , t } ,
is relatively dense, i.e., for any ε > 0 , it is possible to find a real number l = l ( ε ) > 0 with the property that for any interval with length l ( ε ) , there exists a number δ = δ ( ε ) in this interval such that
u ( t + δ ) u ( t ) < ε , t
Definition 2.
A function F B C ( × n , n ) is called (Bohr) almost periodic in t uniformly in x K , where K  is any bounded compact subset of n , that is, if for each ε > 0 , there exists l ( ε ) > 0  such that every interval of length l ( ε ) > 0 contains a number τ with the following property
sup t F ( t + τ , x ) F ( t , x ) < ε .
We denote by A P ( t × n , n ) the set of the almost periodic functions from × n to n . Additionally, we define a class function as follows:
P A P 0 ( × n ; n ) = { f B C ( × n ; n ) | lim T 1 2 T T T f ( t , x ) d t = 0 , x }
which is a closed subspace of B C ( × n ; n ) .
Definition 3.
A continuous function f B C ( × n ; n ) is called pseudo-almost periodic if it can be expressed as
f = f 1 + f 2 ,
where f 1 A P ( × n ; n )  and f 2 P A P 0 ( × n ; n ) . The collection of such functions is denoted P A P ( × n ; n ) .
Definition 4.
Let x l and Q ( t )  be a l × l  continuous matrix defined on . The linear system
x ( t ) = Q ( t ) x ( t )
is said to admit an exponential dichotomy on l  if exist positive constants k , λ > 0  and projection P  and the fundamental solution matrix X ( t ) of (4) satisfying
X ( t ) P X ( s ) < k e λ ( t s ) , t s ; X ( t ) ( I P ) X ( s ) < k e λ ( t s ) , t s .
Lemma 1.
Let c i ( ) be an almost periodic function on ,
M [ c i ] = lim t 1 T t t + T c i ( s ) d s > 0 , i = 1 , 2 , , l .
then the linear system
x ( t ) = d i a g ( c 1 ( t ) , c 2 ( t ) , , c l ( t ) ) x ( t )
admits an exponential dichotomy on l .
Lemma 2.
If the linear system x ( t ) = Q ( t ) x ( t ) has an exponential dichotomy, then almost periodic system
x ( t ) = Q ( t ) x ( t ) + g ( t )
has a unique pseudo-almost periodic solution x ( t ) which can be expressed as followings:
x ( t ) = t X ( t ) P X ( s ) g ( s ) d s t X ( t ) ( I P ) X ( s ) g ( s ) d s , g P A P ( , ) .
Definition 5.
Let x ( t ) = ( x 11 , , x 1 n , , x m 1 , , x m n ) T be a continuous differentiable pseudo-almost periodic solution of system (1) with the initial value ψ ( s ) = ( ψ 11 , , ψ 1 n , , ψ m 1 , , ψ m n ) T .
If there exist constants ω > 0 and M 1 such that for any solution y ( t ) = ( y 11 , , y 1 n , , y m 1 , , y m n ) T of system (1) with an initial value φ ( s ) = ( φ 11 , , φ 1 n , , φ m 1 , , φ m n ) T ,
y ( t ) x ( t ) = max 1 i m , 1 j n | y i j ( t ) x i j ( t ) | M φ ψ e ω t , t > 0 ,
where
φ ψ : = max 1 i m , 1 j n sup s [ τ , 0 ] { | φ i j ( s ) ψ i j ( s ) | } .
Then, x ( t ) is said to be globally exponentially stable.
Remark 1.
Let B C ( , m n ) denote the set of bounded continuous functions from to m n . Note that B C ( , m n ) is a Banach space with
h : = sup t max 1 i m , 1 j n | h i j ( t ) | .
Thus,
h B C ( , m n ) ,   we   let   h + = sup t | h i j ( t ) | , h = inf t | h i j ( t ) | .
Remark 2.
In this paper, the collection of pseudo-almost periodic functions will be denoted by P A P ( , m n ) , then ( P A P ( , m n ) , )  is a Banach space with supremum norm is given by u = sup t max 1 i m , 1 j n | u i j ( t ) | .
For the sake of convenience, we introduce the following notions:
Φ i j y x ( t ) f i j ( t , y i 1 j ( t ) , y i j 1 ( t ) , y i j + 1 ( t ) , y i + 1 j ( t ) ) f i j ( t , x i 1 j ( t ) , x i j 1 ( t ) , x i j + 1 ( t ) , x i + 1 j ( t ) )
Φ i j y τ x τ ( t ) g i j ( t , y i 1 j τ ( t ) , y i j 1 τ ( t ) , y i j + 1 τ ( t ) , y i + 1 j τ ( t ) ) g i j ( t , x i 1 j τ ( t ) , x i j 1 τ ( t ) , x i j + 1 τ ( t ) , x i + 1 j τ ( t ) )
F i j ( t , x ( t ) ) a i j ( t ) p i j ( t ) x i j ( t δ i j ( t ) ) + i = 1 m j = 1 n b i j ( t ) f i j ( t , x i 1 j ( t ) , x i j 1 ( t ) , x i j + 1 ( t ) , x i + 1 j ( t ) ) + i = 1 m j = 1 n c i j ( t ) g i j ( t , x i 1 j τ ( t ) , x i j 1 τ ( t ) , x i j + 1 τ ( t ) , x i + 1 j τ ( t ) ) ,
where,
x ( t ) = ( x 11 , , x 1 n , , x m 1 , , x m n ) T y ( t ) = ( y 11 , , y 1 n , , y m 1 , , y m n ) T

3. Main Results

In this section, we present some results on the existence and global exponential stability of pseudo-almost periodic solutions of the system (1).
We assume that the following conditions are adopted:
Hypothesis 1.
For all 1 i m , 1 j n , p i j , b i j , c i j , L i j P A P ( , ) , a i j A P ( , ) , and inf t a i j > 0 .
Hypothesis 2.
For all 1 i m , 1 j n , f i j , g i j C ( 5 , ) , f i j ( 0 ) = g i j ( 0 ) = 0 ,  and there exist positive constant numbers ρ , σ  such that for all x i j , y i j ,
| f i j ( t , y i 1 j , y i j 1 , y i j + 1 , y i + 1 j ) f i j ( t , x i 1 j , x i j 1 , x i j + 1 , x i + 1 j ) | < ρ i j ( | y i 1 j x i 1 j | + | y i j 1 x i j 1 | + | y i j + 1 x i j + 1 | + | y i + 1 j x i + 1 j | )
| g i j ( t , y i 1 j τ , y i j 1 τ , y i j + 1 τ , y i + 1 j τ ) g i j ( t , x i 1 j τ , x i j 1 τ , x i j + 1 τ , x i + 1 j τ ) | < σ i j ( | y i 1 j τ x i 1 j τ | + | y i j 1 τ x i j 1 τ | + | y i j + 1 τ x i j + 1 τ | + | y i + 1 j τ x i + 1 j τ | )
Hypothesis 3.
For M [ a i j ( t ) ] > 0 , i = 1 , 2 , , m , j = 1 , 2 , , n , there exist bounded and continuous functions: a i j : ( 0 , + ) and positive constant N i j such that
e s t [ a i j ( u ) λ ] d u N i j e s t [ a i j λ ] d u , t , s , t s 0 .
Hypothesis 4.
For all 1 i m , 1 j n , there exist positive constants χ , such that
Λ i j = sup t > τ { χ a i j ( t ) + N i j 1 p i j + e χ τ [ | a i j ( t ) p i j ( t ) | e χ τ + i = 1 m j = 1 n 4 ρ i j | b i j ( t ) | + i = 1 m j = 1 n 4 σ i j | c i j ( t ) | e χ τ ] } < 0 .
Theorem 1.
Suppose that Hypothesis 1–2 and
θ = max 1 i m , 1 j n { p i j + + 1 a i j [ a i j + p i j + + i = 1 m j = 1 n 4 ( ρ i j b i j + + σ i j c i j + ) ] } < 1
hold. Then, system (1) has only one pseudo-almost periodic solution in the region
Ω = { z | z P A P ( , m n ) , z z 0 θ Δ 1 θ } , Δ = max 1 i m , 1 j n { L i j + a i j } ,
z 0 ( t ) = t e s t a 11 ( u ) d u L 11 ( s ) d s , , t e s t a 1 n ( u ) d u L 1 n ( s ) d s , t e s t a m 1 ( u ) d u L m 1 ( s ) d s , , t e s t a m n ( u ) d u L m n ( s ) d s .
Proof. 
Let Y i j ( t ) = x i j ( t ) p i j ( t ) x i j ( t δ i j ( t ) ) , i = 1 , , m , j = 1 , , n . Then, we have
Y i j ( t ) = [ x i j ( t ) p i j ( t ) x i j ( t δ i j ( t ) ) ] = a i j ( t ) Y i j ( t ) + F i j ( t , x ( t ) ) + L i j ( t )
Since M [ a i j ] > 0 , then by Lemma 1, the linear system Y i j ( t ) = a i j ( t ) Y i j ( t ) admits an exponential dichotomy in the . According to Lemma 2, the system (6) has only one pseudo-almost periodic solution as follows:
Y i j ϕ ( t ) = t e s t a i j ( u ) d u [ F i j ( s , ϕ ( s ) ) + L i j ( s ) ] d s
where ϕ = ( ϕ 11 , , ϕ 1 n , , ϕ m 1 , , ϕ m m ) T , and
[ Y i j ϕ ( t ) ] = a i j ( t ) Y i j ϕ ( t ) + F i j ( t , ϕ ( t ) ) + L i j ( t ) ,
In addition, according to the property of pseudo-almost periodic function, we derive
p i j ϕ i j ( δ i j ( ) ) + Y i j ϕ P A P ( , m n ) , i = 1 , , m , j = 1 , , n .
Now, we define the nonlinear operator
Γ ϕ = ( Γ 11 ϕ , , Γ 1 n ϕ , , Γ m 1 ϕ , , Γ m m ϕ ) T = : Ω Ω
by setting
Γ i j ϕ ( t ) = p i j ( t ) ϕ i j ( t δ i j ( t ) ) + Y i j ϕ ( t ) , ϕ Ω ,
where
ϕ = ( ϕ 11 , , ϕ 1 n , , ϕ m 1 , , ϕ m m ) T   and   i = 1 , , m , j = 1 , , n .
For any z P A P ( , m n ) , set
Ω = { z | z P A P ( , m n ) , z z 0 θ Δ 1 θ }
Obviously, Ω is a closed convex subset of P A P ( , m n ) , and
z 0 max 1 i m , 1 j n sup t { t e s t a i j ( u ) d u | L i j ( s ) | d s } max 1 i m , 1 j n { L i j + a i j } = Δ
Therefore, for any z Ω , we have
z z z 0 + z 0 θ Δ 1 θ + Δ = Δ 1 θ .
Firstly, let us prove that the mapping Γ is a self-mapping from Ω to Ω . In fact, for any ϕ = ( ϕ 11 , , ϕ 1 n , , ϕ m 1 , , ϕ m m ) T P A P ( , m n ) , we have
Γ ϕ z 0 sup t max 1 i m , 1 j n { | p i j ( t ) ϕ i j ( t δ i j ( t ) ) | + t e s t a i j ( u ) d u | F i j ( s , ϕ ( s ) ) | d s } max 1 i m , 1 j n { p i j + } ϕ + sup t max 1 i m , 1 j n { t e a i j ( t s ) [ a i j + p i j + ϕ + i = 1 m j = 1 n b i j + ρ i j ( | ϕ i 1 j ( s ) | + | ϕ i j 1 ( s ) | + | ϕ i j + 1 ( s ) | + | ϕ i + 1 j ( s ) | ) + i = 1 m j = 1 n c i j + σ i j ( | ϕ i 1 j τ ( s ) | + | ϕ i j 1 τ ( s ) | + | ϕ i j + 1 τ ( s ) | + | ϕ i + 1 j τ ( s ) | ) ] d s } max 1 i m , 1 j n { p i j + + 1 a i j [ a i j + p i j + + i = 1 m j = 1 n 4 ( ρ i j b i j + + σ i j c i j + ) ] } ϕ θ Δ 1 θ ,
that is Γ ϕ Ω P A P ( , m n ) , then the mapping Γ is a self-mapping from Ω to Ω .
Next, we will prove that the mapping Γ is a contraction mapping in the Ω . For any x , y Ω , where
x ( t ) = ( x 11 , , x 1 n , , x m 1 , , x m n ) T , y ( t ) = ( y 11 , , y 1 n , , y m 1 , , y m n ) T
We have
Γ y Γ x sup t max 1 i m , 1 j n { | p i j ( t ) [ y i j ( t δ i j ( t ) ) x i j ( t δ i j ( t ) ) ] + t e s t a i j ( u ) d u [ a i j ( s ) p i j ( s ) [ y i j ( s δ i j ( s ) ) x i j ( s δ i j ( s ) ) ] + i = 1 m j = 1 n b i j ( s ) Φ i j y x ( s ) + i = 1 m j = 1 n c i j ( s ) Φ i j y τ x τ ( s ) ] d s | } max 1 i m , 1 j n { p i j + } y x + sup t max 1 i m , 1 j n { t e s t a i j ( u ) d u [ a i j + p i j + y x + i = 1 m j = 1 n b i j + ρ i j ( | y i 1 j ( s ) x i 1 j ( s ) | + | y i j 1 ( s ) x i j 1 ( s ) | + | y i j + 1 ( s ) x i j + 1 ( s ) | + | y i + 1 j ( s ) x i + 1 j ( s ) | ) + i = 1 m j = 1 n c i j + σ i j ( | y i 1 j τ ( s ) x i 1 j τ ( s ) | + | y i j 1 τ ( s ) x i j 1 τ ( s ) | + | y i j + 1 τ ( s ) x i j + 1 τ ( s ) | + | y i + 1 j τ ( s ) x i + 1 j τ ( s ) | ) ] d s } max 1 i m , 1 j n { p i j + + 1 a i j [ a i j + p i j + + i = 1 m j = 1 n 4 ( ρ i j b i j + + σ i j c i j + ) ] } y x θ y x .
It is clear that Γ is a contraction mapping of Ω . Thus, by virtue of the Banach fixed point theorem, the mapping Γ has a unique fixed point, x ( t ) = ( x 11 , , x 1 n , , x m 1 , , x m n ) T Ω which corresponds to the solution of the system (6) in Ω P A P ( , m n ) , such that x ( t ) = Γ x ( t ) , that is to say,
x i j ( t ) = p i j ( t ) x i j ( t δ i j ( t ) ) + Y i j x ( t )
Then, combining with Equation (8), we get
[ Y i j x ( t ) ] = [ x i j ( t ) p i j ( t ) x i j ( t δ i j ( t ) ) ]
Hence, the system (1) has only one pseudo-almost periodic solution x ( t ) . The proof is complete. □
Theorem 2.
Suppose that assumption Hypothesis 1–4 and η = 2 + max 1 i m , 1 j n { p i j + } hold, then system (1) has a unique pseudo-almost periodic solution x ( t ) that is globally exponentially stable.
Proof. 
It follows from Theorem 1 that system (1) has only one pseudo-almost periodic solution x ( t ) = ( x 11 , , x 1 n , , x m 1 , , x m n ) T Ω with the initial value ψ ( s ) = ( ψ 11 , , ψ 1 n , , ψ m 1 , , ψ m n ) T and let y ( t ) = ( y 11 , , y 1 n , , y m 1 , , y m n ) T be an arbitrary solution of system (1) with the initial value φ ( s ) = ( φ 11 , , φ 1 n , , φ m 1 , , φ m n ) T .
Now, let
z i j ( t ) = y i j ( t ) x i j ( t ) , Z i j ( t ) = z i j ( t ) p i j ( t ) z i j ( t δ i j ( t ) ) .
Then, we derive
Z i j ( t ) = [ z i j ( t ) p i j ( t ) z i j ( t δ i j ( t ) ) ] = a i j ( t ) [ Z i j ( t ) + p i j ( t ) z i j ( t δ i j ( t ) ) ] + i = 1 m j = 1 n b i j ( t ) Φ i j y x ( t ) + i = 1 m j = 1 n c i j ( t ) Φ i j y τ x τ ( t ) .
Multiplying the above equation by e 0 s a i j ( u ) d u and integrating on [0, t], we have
Z i j ( t ) = Z i j ( 0 ) e 0 t a i j ( u ) d u + 0 t e s t a i j ( u ) d u [ a i j ( s ) p i j ( s ) z i j ( s δ i j ( s ) ) ] + i = 1 m j = 1 n b i j ( s ) Φ i j y x ( s ) + i = 1 m j = 1 n c i j ( s ) Φ i j y τ x τ ( s ) ] d s .
From ( H 4 ) , for all 1 i m , 1 j n , we can choose a constant 0 < λ < min 1 < i < n { a i j ¯ } such that 1 p i j + e λ δ i j + > 0 . The norm defined by
φ ψ = max 1 i m , 1 j n sup s [ τ , 0 ] { | φ i j ( s ) ψ i j ( s ) | }
Thus, we have
Z ( 0 ) max 1 i m , 1 j n { | z i j ( 0 ) | + | p i j ( 0 ) | | z i j ( 0 δ i j ( 0 ) ) | } < [ 2 + max 1 i m , 1 j n { p i j + } ] φ ψ = η φ ψ .
For any t [ τ , 0 ] , we obtain that
Z ( t ) max 1 i m , 1 j n { | z i j ( t ) | | p i j ( t ) | | z i j ( t δ i j ( t ) ) | } < M 1 η φ ψ e λ t ,
where M 1 > max { N i j } + 1 is a constant.
Next, we will prove that, for all t > 0 ,
Z ( t ) = max 1 i m , 1 j n { | z i j ( t ) | | p i j ( t ) | | z i j ( t δ i j ( t ) ) | } < M 1 η φ ψ e λ t ,
Or else, there must exist i { 1 , , m } , j { 1 , , n } and t 1 > t > 0 such that
Z ( t 1 ) = max 1 i m , 1 j n { | z i j ( t 1 ) | | p i j ( t 1 ) | | z i j ( t 1 δ i j ( t 1 ) ) | } = M 1 η φ ψ e λ t 1 ,
and
Z ( t ) = max 1 i m , 1 j n { | z i j ( t ) | + | p i j ( t ) | | z i j ( t δ i j ( t ) ) | } < M 1 η φ ψ e λ t , t [ 0 , t 1 ) .
Hence, we have by (10) and (13) that
e λ υ Z ( υ ) max 1 i m , 1 j n { e λ υ | z i j ( υ ) p i j ( υ ) z i j ( υ δ i j ( υ ) ) | + e λ υ | p i j ( υ ) z i j ( υ δ i j ( υ ) ) | } max 1 i m , 1 j n { M 1 η φ ψ + p i j + e λ ( υ δ i j ( υ ) + λ δ i j ( υ ) ) | z i j ( υ δ i j ( υ ) ) | } max 1 i m , 1 j n { M 1 η φ ψ + p i j + e λ δ i j + sup s [ τ , t ] e λ s | z i j ( s ) | } ,
for all υ [ τ , t ] , t [ 0 , t 1 ] , and 1 i m , 1 j n , which entail that
e λ t | Z ( t ) | sup s [ τ , t ] e λ s | z ( s ) | M 1 η φ ψ 1 p i j + e λ δ i j + .
Thus, combining with (14), Hypothesis 2–4, we derive
Z i j ( t 1 ) η φ ψ e 0 t 1 [ a i j ( u ) λ ] d u e λ t 1 + 0 t 1 e s t 1 [ a i j ( u ) λ ] d u e λ ( t 1 s ) [ | a i j ( s ) p i j ( s ) z i j ( s δ i j ( s ) ) | + i = 1 m j = 1 n | b i j ( s ) | | Φ i j y x ( s ) | + i = 1 m j = 1 n | c i j ( s ) | | Φ i j y τ x τ ( s ) | ] d s e λ t 1 { η φ ψ e 0 t 1 [ a i j ( u ) λ ] d u + 0 t 1 e s t 1 [ a i j ( u ) λ ] d u [ | a i j ( s ) p i j ( s ) | e λ [ s δ i j ( s ) + δ i j ( s ) ] | z i j ( s δ i j ( s ) ) | + i = 1 m j = 1 n | b i j ( s ) | ρ i j [ e λ s | z i 1 j ( s ) | + e λ s | z i j 1 ( s ) | + e λ s | z i j + 1 ( s ) | + e λ s | z i + 1 j ( s ) | ] + i = 1 m j = 1 n | c i j ( s ) | σ i j [ e λ [ s τ i 1 j ( s ) + τ i 1 j ( s ) ] | z i 1 j τ ( s ) | + e λ τ i j 1 ( s ) ] | z i j 1 τ ( s ) | e λ [ s τ i j 1 ( s ) ] + e λ [ s τ i j + 1 ( s ) + τ i j + 1 ( s ) ] | z i j + 1 τ ( s ) | + e λ [ s τ i + 1 j ( s ) + τ i + 1 j ( s ) ] | z i + 1 j τ ( s ) | ) ] ] d s } M 1 η φ ψ e λ t 1 { 1 M 1 e 0 t 1 [ a i j ( u ) λ ] d u + 0 t 1 e s t 1 [ a i j ( u ) λ ] d u [ | a i j ( s ) p i j ( s ) | e λ δ i j + 1 p i j + e λ δ i j + + i = 1 m j = 1 n ( | b i j ( s ) | 4 ρ i j 1 p i j + e λ δ i j + + σ i j | c i j ( s ) | e λ τ i 1 j + + e λ τ i j 1 + + e λ τ i j + 1 + + e λ τ i + 1 j + 1 p i j + e λ δ i j + ) ] d s } M 1 η φ ψ e λ t 1 { N i j M 1 e 0 t 1 [ a i j ( u ) λ ] d u + 0 t 1 e s t 1 [ a i j ( u ) λ ] d u [ N i j 1 p i j + e λ δ i j + [ | a i j ( s ) p i j ( s ) | e λ τ + i = 1 m j = 1 n 4 ρ i j | b i j ( s ) | + i = 1 m j = 1 n 4 σ i j | c i j ( s ) | e λ τ ] d s } M 1 η φ ψ e λ t 1 [ ( N i j M 1 1 ) e 0 t 1 [ a i j ( u ) λ ] d u + 1 ] M 1 η φ ψ e λ t 1 .
Hence, for all t > τ , we derive that
Z ( t 1 ) = max 1 i m , 1 j n { | z i j ( t 1 ) | | p i j ( t 1 ) | | z i j ( t 1 δ i j ( t 1 ) ) | } < M 1 η φ ψ e λ t 1 ,
Which are contradicts the equality Equation (12). Then, Equation (11) holds, and for all t > τ , we obtain
Z ( t ) < M 1 η φ ψ e λ t .
By the same way, for all 1 i m , 1 j n , according to (14), we have
e λ t | z ( t ) | sup s [ τ , 0 ] e λ s | z ( s ) | M 1 η φ ψ max 1 i m , 1 j n { 1 p i j + e λ δ i j + } ,
Then
| z ( t ) | M φ ψ e λ t , t > 0 , M = M 1 η max 1 i m , 1 j n { 1 p i j + e λ δ i j + } .
Therefore, the unique pseudo-almost periodic solution of the system (1.1.) is globally exponentially stable. The proof is complete. □

4. Example

In this section, we give an example to demonstrate the effectiveness and feasibility of the obtained theoretical results. Consider the following generalized cellular neural networks with D operator and time-varying delays:
[ x i j ( t ) p i j ( t ) x i j ( t δ i j ( t ) ) ] = a i j ( t ) x i j ( t ) + i = 1 m j = 1 n b i j ( t ) f i j ( t , x i 1 j ( t ) , x i j 1 ( t ) , x i j + 1 ( t ) , x i + 1 j ( t ) ) + i = 1 m j = 1 n c i j ( t ) g i j ( t , x i 1 j τ ( t ) , x i j 1 τ ( t ) , x i j + 1 τ ( t ) , x i + 1 j τ ( t ) ) + L i j ( t ) ,
where
x i j τ ( t ) = x i j ( t τ i j ( t ) ) , 1 i 3 , 1 j 3 .
We have the follows:
p i j ( t ) = [ 1 20 | cos t | 1 20 cos t 2 1 10 | cos 2 t | 1 30 cos t 2 0.02 | cos t + 3 sin t | 0.025 | 3 cos t + sin t | 1 25 cos t 2 1 30 sin t 1 30 sin 2 t ]
a i j ( t ) = [ 1.01 + 0.001 cos π 2 t 1.12 + 0.06 cos π 2 t 1.45 + 0.05 sin π 2 t 1.26 + 0.04 sin π 2 t 1.06 + 0.05 sin π 2 t 1.12 + 0.03 cos π 2 t 1.05 + 0.05 sin π 2 t 1.21 + 0.01 cos π 2 t 1.22 + 0.01 sin π 2 t ]
b i j ( t ) = [ 0.02 ( sin t + cos 2 t ) 0.01 ( c o s t + e sin t ) 0.02 ( c o s t + e cos t ) 0.01 ( cos t + e cos t ) 0.02 ( c o s t + cos 2 t ) 0.03 ( sin t + sin 2 t ) 0.03 ( c o s π t + e cos t ) 0.05 cos 2 t 0.03 ( c o s π t + e cos t ) ]
c i j ( t ) = [ 0.01 ( cos t + cos 2 t ) 0.02 ( c o s t + e sin 2 t ) 0.02 ( sin t + sin 2 t ) 0.01 ( cos t + e cos t ) 0.02 ( sin t + sin 2 t ) 0.02 ( cos t + 0.01 ) 0.02 ( sin t + sin 2 t ) 0.02 ( cos t + e sin 3 t ) 0.02 ( c o s t + e sin 3 t ) ]
τ i j ( t ) = [ 1 5 | cos t | 1 3 | cos 2 t | 1 4 | sin t | 1 2 | sin t | 1 3 | cos t | 1 6 | sin t | 1 6 | cos t | 1 4 | sin t | 1 3 | sin 2 t | ]
δ i j ( t ) = [ | sin 2 t | | cos 2 t | | cos 5 t | | sin 3 t | | sin 6 t | | sin 2 t | | cos 2 t | | sin 2 t | | sin 3 t | ]
L i j ( t ) = [ 5 2 + sin 2 t 1 + c o s 2 3 t 3 2 + sin 2 t 3 2 + c o s 2 t 1 + c o s 2 t 1 + | sin 2 t | 1 + sin 2 2 t 3 2 + c o s 2 t 1 + sin 2 t ]
f i j ( x ) = g i j ( x ) = 1 40 [ | x i 1 j + 1 | | x i 1 j 1 | 2 + | x i j 1 + 1 | | x i j 1 1 | 2 + | x i + 1 j + 1 | | x i + 1 j 1 | 2 + | x i j + 1 + 1 | | x i j + 1 1 | 2 ] .
Obviously, ρ i j = σ i j = 1 10 , a i j + = 1.5 , a i j = 1.0 , p i j + = 1 10 , and
θ = max 1 i m , 1 j n { p i j + + 1 a i j [ a i j + p i j + + i = 1 m j = 1 n 4 ( ρ i j b i j + + σ i j c i j + ) ] } = 0.702 < 1 .
This example is simulated through MATLAB according to the given parameters. Figure 1, Figure 2, and Figure 3 display the state trajectories x 11 ( t ) , x 22 ( t ) , and x 33 ( t ) of the pseudo-almost periodic solution for the neural network system (15) with three different initial values ( 2.5 , 3.0 , 3.5 ) , ( 1.0 , 1.5 , 2.0 ) , ( 1.0 , 1.5 , 1.8 ) , respectively. Even with the change of initial points, the shapes of the trajectories are not changed. As can be seen that simulated the solution tends to be the pseudo-almost periodic solution of the neural network system (4.1). Figure 4 shows the dynamic behavior of the pseudo-almost solution x 11 ( t ) and x 22 ( t ) of the neural network system (15) with the same initial values x 11 ( 0 ) = x 22 ( 0 ) = 4 . Similarly, Figure 5 exhibits the dynamic behavior of the pseudo-almost solution x 11 ( t ) and x 33 ( t ) , and Figure 6  x 22 ( t ) and x 33 ( t ) . The validity of the conclusions can be judged by comparing the two-state trajectories with each other.
Figure 7a,b demonstrates the phase responses of state variables x 11 ( t ) and x 22 ( t ) for the neural network system (15) with different initial values ( 4.0 , 2.5 ) , ( 1.0 , 0.5 ) . Figure 7c describes the space behavior of the state variables x 11 ( t ) , x 22 ( t ) for the neural network system (15). Similarly, Figure 8a,b shows the phase responses of state variables x 11 ( t ) and x 33 ( t ) for the neural network system (15) with different initial values ( 3.5 , 1.0 ) , ( 0.5 , 1.5 ) . Figure 8c space behavior of the state variables x 11 ( t ) , x 33 ( t ) for the neural network system (15); and Figure 9a,b depict phase diagram x 22 ( t ) and x 33 ( t ) with ( 2.0 , 1.5 ) , ( 0.5 , 1.0 ) , Figure 9c reveals the space behavior of the state variables x 22 ( t ) and x 33 ( t ) . Figure 7d, Figure 8d, and Figure 9d exhibitions the 3D space behavior of the state variables x 11 ( t ) , x 22 ( t ) and x 33 ( t ) for the neural network system (15) with three different initial values ( 0.5 , 1.0 , 0.5 ) , ( 0.5 , 1.5 , 1.5 ) , ( 0.5 , 2.5 , 1.5 ) . The time response confirms that our theoretical results’ sufficient conditions are effective for the neural network system (15). Moreover, the phase response represents a bunch of pseudo-almost periodic trajectories, which gives an idea of pseudo-almost periodic solutions for our described neural network system (15). Considered the above relative parameters, all the conditions of Theorems 1 and 2 are satisfied. Therefore, the neural network system (15) has precisely one continuously differential pseudo-almost periodic solution, which is also globally exponentially stable.

5. Conclusions

In this paper, the existence and stability criteria of the pseudo-almost periodic solution for the novel type complex networks are examined. Based on the Banach fixed-point theorem and the exponential dichotomy of linear equations, the existence and uniqueness of pseudo-almost periodic solutions are investigated. Through an integral variable transformation, the global exponential stability condition of the CNN is evaluated. Compared with the previous work on the stability analysis of periodic solutions, the derived pseudo-almost periodic results are more precise and less conservative. The proposed variable substitution can induce stability flexibility, overcome the bottleneck problem of constructing the complicated Lyapunov functional, and ensure the convergence results from more validity. The approach has a fast convergence speed, which is suitable for applications of complex systems. The obtained results in this work are valuable in the design of neural network systems, which are used to solve efficiency and optimal control problems arising in practical engineering applications. The existence and stability conditions are expressed in simple algebraic form, and their verification is done.
In future work, the analysis method can also be applied to more complicated neural network systems such as fuzzy systems and fractional-order neural networks that arise in the various disciplines of engineering and scientific fields. Such as, Mittag-Leffer stability of the fractional-order neural networks with discontinuous activation functions and time-varying delays will also be explored. Moreover, synchronization and state estimation of the fractional-order memristor-based neural networks and stochastic delayed systems will also be examined in the future.

Author Contributions

Conceptualization, W.L., J.H., and Q.Y.; methodology, W.L., J.H., and Q.Y.; software, W.L.; validation, W.L., J.H., and Q.Y.; formal analysis, W.L.; visualization, W.L.; investigation, W.L.; resources, Q.Y.; writing—original draft preparation, W.L.; writing—review and editing, W.L., J.H., and Q.Y.; supervision, J.H. and Q.Y.; project administration, Q.Y.; funding acquisition, Q.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the national key R&D program for international collaboration and for HPC, grant numbers 2018YFE9103900 and 2020YFA0712502. The Natural Science Foundation of China (NSFC), grant number 11972384, and Guangdong MEPP Fund, grant number GDOE[2019] A01, also supported this work.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors are thankful to the area editor and the reviewers for giving valuable comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Chua, L.; Yang, L. Cellular neural networks: Theory. IEEE Trans. Circuits Syst. 1988, 35, 1257–1272. [Google Scholar] [CrossRef]
  2. Chua, L.; Yang, L. Cellular neural networks: Applications. IEEE Trans. Circuits Syst. 1988, 35, 1273–1290. [Google Scholar] [CrossRef]
  3. Jiang, H.; Cao, J. Global exponential stability of periodic neural networks with time-varying delays. Neurocomputing 2006, 70, 343–350. [Google Scholar] [CrossRef]
  4. Li, H.; Jiang, H.; Hu, C. Existence and global exponential stability of periodic solution of memristor-based BAM neural networks with time-varying delays. Neural Netw. 2016, 75, 97–109. [Google Scholar] [CrossRef]
  5. Yang, W.; Yu, W.; Cao, J. Global exponential stability of impulsive fuzzy high-order BAM neural networks with continuously distributed delays. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 3682–3700. [Google Scholar] [PubMed]
  6. Wang, H.; Duan, S.; Huang, T.; Li, C.; Wang, L. Novel stability criteria for impulsive memristive neural networks with time-varying delays. Circuits Syst. Signal Process. 2016, 35, 3935–3956. [Google Scholar] [CrossRef]
  7. Wen, C.; Wang, Z.; Geng, T.; Alsaadi, F. Event-based distribute d recursive filtering for state-saturated systems with redundant channels. Inf. Fusion 2018, 39, 96–107. [Google Scholar] [CrossRef]
  8. Liu, Q.; Wang, Z.; He, X.; Zhou, D.H. Event-triggered resilient filtering with measurement quantization and random sensor failures: Monotonicity and convergence. Automatica 2018, 94, 458–464. [Google Scholar] [CrossRef]
  9. Wang, F.; Wang, Z.; Liang, J.; Yang, J. Locally minimum-variance filtering of 2-D systems over sensor networks with measurement degradations: A distributed recursive algorithm. IEEE Trans. Cybern. 2020, 99, 1–13. [Google Scholar] [CrossRef] [PubMed]
  10. Wang, Y.; Xia, Y.; Zhou, P.; Duan, D. A new result on H state estimation of delayed static neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2017, 28, 3096–3101. [Google Scholar] [CrossRef] [PubMed]
  11. Donkers, M.; Heemels, W.; van de Wouw, N.; Hetel, L. Stability analysis of networked control systems using a switched linear systems approach. IEEE Trans. Autom. Control 2011, 56, 2101–2115. [Google Scholar] [CrossRef] [Green Version]
  12. Liang, J.; Wang, Z.; Liu, X.; Louvieris, P. Robust synchronization for 2-D discrete-time coupled dynamical networks. IEEE Trans. Neural Netw. Learn. Syst. 2012, 23, 942–953. [Google Scholar] [CrossRef] [Green Version]
  13. Sharkovsky, A.N. Chaos from a time-delayed Chua’s circuit. IEEE Trans. Circuits Syst. I Fundam. Theory Appl. 1993, 40, 781–783. [Google Scholar] [CrossRef]
  14. Ge, C.; Hua, C.; Guan, X. New delay-dependent stability criteria for neural networks with time-varying delay using delay-decomposition approach. IEEE Trans. Neural Netw. Learn. Syst. 2014, 25, 1378–1383. [Google Scholar]
  15. Seuret, A.; Gouaisbaut, F.; Fridman, E. Stability of discrete-time systems with time-varying delays via a novel summation inequality. IEEE Trans. Autom. Control 2015, 60, 2740–2745. [Google Scholar] [CrossRef] [Green Version]
  16. Liang, J.; Wang, Z.; Liu, X. Exponential synchronization of stochastic delayed discrete-time complex networks. Nonlinear Dyn. 2008, 53, 153–165. [Google Scholar] [CrossRef]
  17. Ou, C. Almost periodic solutions for shunting inhibitory cellular neural networks. Nonlin. Anal. RWA 2009, 10, 2652–2658. [Google Scholar] [CrossRef]
  18. Zhang, X.; Han, Q. Global asymptotic stability for a class of generalized neural networks with interval time-varying delay. IEEE Trans. Neural Netw. 2011, 22, 1180–1192. [Google Scholar] [CrossRef]
  19. Gong, W.; Liang, J.; Cao, J. Matrix measure method for global exponential stability of complex-valued recurrent neural networks with time-varying delays. Neural Netw. 2015, 70, 81–89. [Google Scholar] [CrossRef]
  20. Miraoui, M. μ-Pseudo-Almost Automorphic Solutions for some Differential Equations with Reflection of the Argument. Numer. Funct. Anal. Optim. 2017, 38, 376–394. [Google Scholar] [CrossRef]
  21. Cherif, F. Sufficient Conditions for Global Stability and Existence of Almost Automorphic Solution of a Class of RNNs. Differ. Equ. Dyn. Syst. 2014, 22, 191–207. [Google Scholar] [CrossRef]
  22. Zhang, X.; Han, Q.; Zeng, Z. Hierarchical type stability criteria for delayed neural networks via canonical Bessel-Legendre inequalities. IEEE Trans. Cybern. 2018, 48, 1660–1671. [Google Scholar] [CrossRef]
  23. Saratha, S.; Sai Sundara Krishnan, G.; Bagyalakshmi, M. Analysis of a fractional epidemic model by fractional generalised homotopy analysis method using modified Riemann-Liouville derivative. Appl. Math. Model. 2021, 92, 525–545. [Google Scholar] [CrossRef]
  24. Liu, P.; Wang, G. Optimal periodic preventive maintenance policies for systems subject to shocks. Appl. Math. Model. 2021, 93, 101–114. [Google Scholar] [CrossRef]
  25. Wang, L.; Wang, Z.; Wei, G.; Alsadi, F. Finite-time state estimation for recurrent delayed neural networks with component-based event-triggering protocol. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 1046–1057. [Google Scholar] [CrossRef] [PubMed]
  26. Kang, H.; Fu, X.; Sun, Z. Global exponential stability of periodic solutions for impulsive Cohen-Grossberg neural networks with delays. Appl. Math. Model. 2015, 39, 1526–1535. [Google Scholar] [CrossRef]
  27. Mandal, S.; Majee, N. Existence of periodic solutions for a class of Cohen-Grossberg type neural networks with neutral delays. Neurocomputing 2011, 74, 1000–1007. [Google Scholar] [CrossRef]
  28. Bohr, H. Zur theorie der fast periodischen funktionen: I. eine verallgemeinerung der theorie der fourierreihen. Acta Math. 1925, 45, 29–127. [Google Scholar] [CrossRef]
  29. Shao, J.; Wang, L.; Ou, C. Almost periodic solutions for shunting inhibitory cellular neural networks without global Lipschitz activaty functions. Appl. Math. Model. 2009, 33, 2575–2581. [Google Scholar] [CrossRef]
  30. Wang, K.; Zhu, Y. Stability of almost periodic solution for a generalized neutral-type neural networks with delays. Neurocomputing 2010, 73, 3300–3307. [Google Scholar] [CrossRef]
  31. Zhang, C. Pseudo Almost Periodic Functions and Their Applications. Ph.D. Thesis, University of Western Ontario, London, ON, Canada, 1992. [Google Scholar]
  32. Ding, H.; Liang, J.M.; N’Guérékat, G.; Xiao, T. Pseudo-almost periodicity of some nonautonomous evolution equations with delay. Nonlinear Anal. Theory Methods Appl. 2007, 67, 1412–1418. [Google Scholar] [CrossRef]
  33. Mhamdi, M.; Aouiti, C.; Touati, A. Weighted pseudo almost-periodic solutions of shunting inhibitory cellular neural networks with mixed delays. Acta. Math. Sci. 2016, 36, 1662–1682. [Google Scholar] [CrossRef]
  34. Amdouni, M.; Cherif, F. The pseudo almost periodic solutions of the new class of Lotka-Volterra recurrent neural networks with mixed delays. Chaos Solut. Fractals 2018, 113, 79–88. [Google Scholar] [CrossRef]
  35. Liu, B. Pseudo almost periodic solutions for neutral type CNNs with continuously distributed leakage delays. Neurocomputing 2015, 148, 445–454. [Google Scholar] [CrossRef]
  36. Shao, J. Pseudo almost periodic solutions for a Lasota-Wazewska model with an oscillating death rate. Appl. Math Lett. 2015, 43, 90–95. [Google Scholar] [CrossRef]
  37. Zhang, A. Almost Periodic Solutions for SICNNs with Neutral Type Proportional Delays and D Operator. Neural Process Lett. 2018, 47, 57–70. [Google Scholar] [CrossRef]
Figure 1. The state trajectory of x 11 , and initial values are 2.5 , 3.0 , 3.5 , respectively.
Figure 1. The state trajectory of x 11 , and initial values are 2.5 , 3.0 , 3.5 , respectively.
Mathematics 09 01951 g001
Figure 2. The state trajectory of x 22 , and initial values are 1.0 , 1.5 , 2.0 , respectively.
Figure 2. The state trajectory of x 22 , and initial values are 1.0 , 1.5 , 2.0 , respectively.
Mathematics 09 01951 g002
Figure 3. The state trajectory of x 33 , and initial values are 1.0 , 1.5 , 1.8 , respectively.
Figure 3. The state trajectory of x 33 , and initial values are 1.0 , 1.5 , 1.8 , respectively.
Mathematics 09 01951 g003
Figure 4. The state trajectory of x 11 and x 22 , and initial values are x 11 ( 0 ) = x 22 ( 0 ) = 4.0 .
Figure 4. The state trajectory of x 11 and x 22 , and initial values are x 11 ( 0 ) = x 22 ( 0 ) = 4.0 .
Mathematics 09 01951 g004
Figure 5. The state trajectory of x 11 and x 33 , and initial values are x 11 ( 0 ) = x 33 ( 0 ) = 4.0 .
Figure 5. The state trajectory of x 11 and x 33 , and initial values are x 11 ( 0 ) = x 33 ( 0 ) = 4.0 .
Mathematics 09 01951 g005
Figure 6. The state trajectory of x 22 and x 33 , and initial values are x 22 ( 0 ) = x 33 ( 0 ) = 2.0 .
Figure 6. The state trajectory of x 22 and x 33 , and initial values are x 22 ( 0 ) = x 33 ( 0 ) = 2.0 .
Mathematics 09 01951 g006
Figure 7. The state trajectory of x 11 x 22 , 3D graphs and initial values are (a) ( 4.0 , 2.5 ) , (b) ( 1.0 , 0.5 ) , (c) ( 0.0 , 2.5 , 0.5 ) , and (d) ( 0.5 , 1.0 , 0.5 ) , respectively.
Figure 7. The state trajectory of x 11 x 22 , 3D graphs and initial values are (a) ( 4.0 , 2.5 ) , (b) ( 1.0 , 0.5 ) , (c) ( 0.0 , 2.5 , 0.5 ) , and (d) ( 0.5 , 1.0 , 0.5 ) , respectively.
Mathematics 09 01951 g007aMathematics 09 01951 g007b
Figure 8. The state trajectory of x 11 x 33 , 3D graphs and initial values are (a) ( 3.5 , 1.0 ) (b) ( 0.5 , 1.5 ) , (c) ( 0.0 , 1.5 , 2.5 ) , and (d) ( 0.5 , 1.5 , 1.5 ) , respectively.
Figure 8. The state trajectory of x 11 x 33 , 3D graphs and initial values are (a) ( 3.5 , 1.0 ) (b) ( 0.5 , 1.5 ) , (c) ( 0.0 , 1.5 , 2.5 ) , and (d) ( 0.5 , 1.5 , 1.5 ) , respectively.
Mathematics 09 01951 g008aMathematics 09 01951 g008b
Figure 9. The state trajectory of x 22 x 33 , 3D graphs and initial values are (a) ( 2.0 , 1.5 ) , (b) ( 0.5 , 1.0 ) , (c) ( 0.0 , 6.0 , 1.0 ) , and (d) ( 0.5 , 2.5 , 1.5 ) , respectively.
Figure 9. The state trajectory of x 22 x 33 , 3D graphs and initial values are (a) ( 2.0 , 1.5 ) , (b) ( 0.5 , 1.0 ) , (c) ( 0.0 , 6.0 , 1.0 ) , and (d) ( 0.5 , 2.5 , 1.5 ) , respectively.
Mathematics 09 01951 g009aMathematics 09 01951 g009b
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Liu, W.; Huang, J.; Yao, Q. Stability Analysis of Pseudo-Almost Periodic Solution for a Class of Cellular Neural Network with D Operator and Time-Varying Delays. Mathematics 2021, 9, 1951. https://doi.org/10.3390/math9161951

AMA Style

Liu W, Huang J, Yao Q. Stability Analysis of Pseudo-Almost Periodic Solution for a Class of Cellular Neural Network with D Operator and Time-Varying Delays. Mathematics. 2021; 9(16):1951. https://doi.org/10.3390/math9161951

Chicago/Turabian Style

Liu, Weide, Jianliang Huang, and Qinghe Yao. 2021. "Stability Analysis of Pseudo-Almost Periodic Solution for a Class of Cellular Neural Network with D Operator and Time-Varying Delays" Mathematics 9, no. 16: 1951. https://doi.org/10.3390/math9161951

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