Next Article in Journal
KECA Similarity-Based Monitoring and Diagnosis of Faults in Multi-Phase Batch Processes
Next Article in Special Issue
Stationary-State Statistics of a Binary Neural Network Model with Quenched Disorder
Previous Article in Journal
Complex Valued Risk Diversification
Previous Article in Special Issue
Modeling of a Neural System Based on Statistical Mechanics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stability Analysis for Memristor-Based Complex-Valued Neural Networks with Time Delays

1
School of Management, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
2
School of Management Science and Engineering, Central University of Finance and Economics, Beijing 100080, China
3
School of Sciences, Southwest Petroleum University, Chengdu 610500, China
4
School of Computer Science, Northwestern Polytechnical University, Xi’an 710072, China
*
Author to whom correspondence should be addressed.
Entropy 2019, 21(2), 120; https://doi.org/10.3390/e21020120
Submission received: 6 December 2018 / Revised: 19 January 2019 / Accepted: 21 January 2019 / Published: 28 January 2019
(This article belongs to the Special Issue Statistical Mechanics of Neural Networks)

Abstract

:
In this paper, the problem of stability analysis for memristor-based complex-valued neural networks (MCVNNs) with time-varying delays is investigated extensively. This paper focuses on the exponential stability of the MCVNNs with time-varying delays. By means of the Brouwer’s fixed-point theorem and M-matrix, the existence, uniqueness, and exponential stability of the equilibrium point for MCVNNs are studied, and several sufficient conditions are obtained. In particular, these results can be applied to general MCVNNs whether the activation functions could be explicitly described by dividing into two parts of the real parts and imaginary parts or not. Two numerical simulation examples are provided to illustrate the effectiveness of the theoretical results.

1. Introduction

In the past few decades, complex-valued neural networks (CVNNs) which extend the real-valued neural network (RVNNs) have aroused widespread concern because of their extensive application in various fields, such as engineering optimization, electromagnetic wave imaging, pattern recognition, and so forth [1,2]. Some conclusions about CVNNs have been obtained in [3,4]. Since the physical implementation of the nanoscale memristor in 2008 [5], memristor-based neural networks (MNNs) have attracted a remarkable amount of attention [6,7,8,9,10,11], owing to their memory characteristics and nanometer dimensions. Therefore, it is important to research the properties of MNNs which play a significant role in the system design. There exist many research results concerning the existence, uniqueness, and stability for the equilibrium of MNNs [12,13,14,15].
Figure Compared with real-valued neural networks, the complex-valued neural network (CVNN) is a frame that processes information in the complex plane—namely, their input and output signals, state variables, connection weights, and activation functions are all complex-valued [16]. In recent years, the MCVNNs which replace the real-valued MNNs (RVMNNs) in the VLSI circuits have attracted numerous researchers to study the properties of MCVNNs [17,18]. Nevertheless, it is complicated to investigate the stability of MCVNNs, since the states and the connected weights are complex-valued. In [17,18], the n-dimensional MCVNNs were converted into 2 n -dimensional RVMNNs, and some sufficient conditions have been derived aiming to guarantee the existence, uniqueness, and exponential stability of the equilibrium. Nevertheless, not every activation functions could be explicitly described by dividing into two parts, i.e., the real part and the imaginary one. There are a few results to be applied to general MCVNNs where activation functions cannot explicitly separate the real parts and imaginary parts.
Figure Undoubtedly, due to the limited switching speed of the amplifier and the transmission delay during communication between neurons, time delays are inevitably encountered in the neural network, and the presence of time delays may cause instability or oscillation to the neural network. Therefore, it is meaningful to discuss the dynamics of neural networks with time delays [11,19,20].
Motivated by the above analysis, the exponential stability problem of MCVNNs with time-varying delays is investigated in this paper. Novel MCVNNs with time-varying delays is first presented. with the adoption of Brouwer’s fixed-point theorem, some sufficient conditions of the existence and uniqueness of the equilibrium point are achieved. Then, based on the properties of the M-matrix, a sufficient condition is obtained to guarantee the exponential stability for the MCVNNs with time delays. Among these sufficient conditions, the condition of the activation functions is relaxed, not to be divided into real parts and imaginary parts, but only to meet the Lipschitz condition. Therefore, the obtained method in this paper is more general than that in [17,18].
The rest of the paper is outlined as follows: in Section 2, the preliminaries, including some lemmas and necessary definitions, are stated, and the model of the MCVNNs is described; in Section 3, some sufficient conditions are achieved about the existence and the uniqueness of the equilibrium point, and several criteria are obtained to guarantee the exponential stability for the MCVNNs with time delays, while two examples are presented in Section 4.
Notation: The solutions of all the systems are considered in the sense of Filippov [21]. Let C and R be the sets of complex numbers and real numbers, respectively. C n , R n and R + n denote the n-dimensional complex, and the real and positive real vector space. z = a + i b indicates a complex number, and z ¯ = a + i ( b ) denotes the conjugate number of z, where a , b R , i = 1 , | z | = a 2 + b 2 . If z = ( z 1 , , z n ) T C n , then [ | z | ] = ( | z 1 | , | z 2 | , , | z n | ) T R n .

2. Preliminaries

In this section, we will construct a class of memristor-based complex-valued neural networks, which is described as follows:
d z p ( t ) d t = d p z p ( t ) + q = 1 n a p q ( z p ( t ) ) f q ( z q ( t ) ) + q = 1 n b p q ( z q ( t τ q ( t ) ) ) g q ( z q ( t τ q ( t ) ) ) + J p ,
where p = 1 , 2 , , n , z p ( t ) = x p ( t ) + i y p ( t ) C , d p > 0 denotes the neuron self-inhibitions, τ q ( t ) ( q = 1 , , n ) are the transmission delays that satisfy 0 τ q ( t ) τ max , where τ max indicates the upper bound of the delays.
Then, (1) could be rewritten equivalently in the matrix form being illustrated as follows:
d Z ( t ) d t = Λ Z ( t ) + A ( Z ( t ) ) F ( Z ( t ) ) + B ( Z ( t ) ) G ( Z ( t τ ( t ) ) ) + J ,
where Z ( t ) = ( z 1 ( t ) , , z n ( t ) ) T C n represents the state vector; Λ = d i a g { d 1 , , d n } ; f q ( · ) and g q ( · ) indicate the complex-valued activation functions respectively; F ( Z ( t ) ) = ( f 1 ( z 1 ( t ) ) , f 2 ( z 2 ( t ) ) , , f n ( z n ( t ) ) ) T and G ( Z ( t τ ( t ) ) ) = ( g 1 ( z 1 ( t τ 1 ( t ) ) ) , , g n ( z n ( t τ n ( t ) ) ) ) T ; A ( Z ( t ) ) = [ a p q ( z q ( t ) ) ] n × n and B ( Z ( t ) ) = [ b p q ( z q ( t ) ) ] n × n ; J = [ J 1 , , J n ] T C n denotes an external input vector.
Remark 1.
When both the activation functions, f q and g q , are real functions which can be defined by f q ( s ) = g q ( s ) = ( | s + 1 | | s 1 | ) / 2 , MCVNN (1) becomes the one studied in [22]; if τ p q = 0 , MCVNN (1) is degenerated, the model is investigated in [18]; when the connection weight matrices A and B are independent of the feedback states, MCVNN (1) is reduced to CVNNs with delays investigated in [23,24]. Therefore, the model in this paper is more general than than those proposed in previous literature, and all the results in the following are applicable to those special cases.
According to the properties of the memristor, the complex-valued connection weights a p q ( z q ( t ) ) and b p q ( z q ( t ) ) could be described as follows:
a p q ( z q ( t ) ) = sign p q M p q C p = a ^ p q , | z q ( t ) | 1 a ˇ p q , | z q ( t ) | > 1
b p q ( z q ( t ) ) = sign p q N p q C p = b ^ p q , | z q ( t ) | 1 b ˇ p q , | z q ( t ) | > 1
where M p q and N p q represent the memductances of memristors G p q and H p q , respectively, G p q stands for the memristor between the activation function f q ( z q ( t ) ) and z q ( t ) , H p q denotes the memristor between g q ( z q ( t τ q ( t ) ) ) and z q ( t ) , C p represents the capacitor, and sign p q represents the sign function, which is provided as
sign p q = 1 , p q , 1 , p = q ,
where the complex-valued constants a ^ p q , a ˇ p q , b ^ p q , b ˇ p q are the switching jumps.
Next, we will introduce some useful definitions and assumptions.
Definition 1.
Let E C n , x F ( x ) be a set-valued map from E C n , if there exists a nonempty set F ( x ) C n for any point x E C n . A nonempty set-valued map F is upper-semi-continuous at x 0 E C n , if, for any open set N containing F ( x 0 ) , there exists a neighborhood M of x 0 such that F ( M ) N . F ( x ) is called a closed (convex, compact) image if for all x E .
Definition 2.
For d x d t = f ( t , x ) , x C n , where f ( t , x ) is discontinuous in x and the set-valued map of f ( t , x ) is defined as:
F ( t , x ) = δ > 0 μ ( N ) = 0 co [ f ( B ( x , δ ) \ N ) ] ,
where B ( x , δ ) = { y : | y x | δ } is the ball with a center x and radius δ; and the intersection is applied to all sets N of measure zero and all δ > 0 ; while μ ( N ) denotes the Lebesgue measure of set N. A Filippov solution of the Cauchy problem with initial condition x ( 0 ) = x 0 is absolutely continuous on any subinterval t [ t 1 , t 2 ] of [ 0 , T ] , which satisfies x ( 0 ) = x 0 and the differential inclusion:
d x d t F ( t , x ) , for a . a . t [ 0 , T ] .
In this paper, a p q ( z p ( t ) ) and b p q ( z q ( t τ q ( t ) ) ) are dependent on the states, and they are discontinuous. Therefore, the solutions of all systems are intended in Filippov’s sense.
Under Definition 1, (1) could be rewritten as follows:
d z p ( t ) d t d p z p ( t ) + q = 1 n c o { a ^ p q , a ˇ p q } f q ( z q ( t ) ) + q = 1 n c o { b ^ p q , b ˇ p q } g q ( z q ( t τ q ( t ) ) ) + J p ,
or equivalently, for all p , q { 1 , 2 , , n } , t 0 , there exit measurable functions a ˜ p q ( t ) c o { a ^ p q , a ˇ p q } and b ˜ p q ( t ) c o { b ^ p q , b ˇ p q } such that
d z p ( t ) d t = d p z p ( t ) + q = 1 n a ˜ p q ( t ) f q ( z q ( t ) ) + q = 1 n b ˜ p q ( t ) g q ( z q ( t τ q ( t ) ) ) + J p ,
Then, (9) could be transformed into the matrix format, which is provided as follows
d Z ( t ) d t = Λ Z ( t ) + A ˜ ( t ) F ( Z ( t ) ) + B ˜ ( t ) G ( Z ( t τ ( t ) ) ) + J ,
where A ˜ ( t ) = [ a ˜ p q ( t ) ] n × n C n × n and B ˜ ( t ) = [ b ˜ p q ( t ) ] n × n C n × n .
Before giving our main results, an assumption should be given.
Assumption 1.
For q = 1 , , n , the Lipschitz continuity condition of the activation functions f q ( · ) and g q ( · ) should be satisfied in the complex field—that is, there exist constants l q f > 0 and l q g > 0 , such that, for any z 1 , z 2 C , we have
| f q ( z 1 ) f q ( z 2 ) | l q f | z 1 z 2 | , | g q ( z 1 ) g q ( z 2 ) | l q g | z 1 z 2 |
where l q f and l q g denote Lipschitz constants, respectively.
Remark 2.
In [18,25,26], it is necessary to ensure that the activation functions can be explicitly expressed by separating into real and imaginary parts, which is provided as
f q ( z ( t ) ) = f q R ( x ( t ) , y ( t ) ) + i f q I ( x ( t ) , y ( t ) )
where f q R ( · , · ) : R 2 R and f q I ( · , · ) : R 2 R denote the real and imaginary parts of f q ( · ) , respectively. In addition, it is always required that f j R x j , f j R y j , f j I x j , a n d f j I y j are existent, continuous, and bounded, aiming to guarantee the stability of the system considered in [27]. In fact, these necessary conditions are conservative, since not every activation function could be explicitly separated into real parts and imaginary parts. In this paper, f q ( · ) and g q ( · ) are only necessary in order to satisfy Assumption 1. Moreover, if the conditions in [18,25,26], the activation functions f q ( · ) and g q ( · ) could satisfy the Assumption 1. Hence, the obtained results seem to be more general and less conservative than those which appeared in [17,18,25,26,27].
Definition 3.
For any given initial time t 0 R , the complex-valued function Z ( t ) C [ [ t 0 τ , + ) , C n ] is designated a solution of (10) through ( t 0 , ϕ ) , if Z ( t ) satisfies the initial condition
Z ( t 0 + s ) = ϕ ( s ) , s [ τ , 0 ] ,
for t t 0 , denoted by Z ( t , t 0 , ϕ ) (or Z for short). Particularly, a point Z ( t ) * C n is named an equilibrium point of (10), if Z ( t ) = Z * is the solution of (10).
Lemma 1.
[24]: Let P = ( p i j ) n × n with p i j 0 for i j and Q = ( q i j ) n × n 0 . Suppose ( P + Q ) be an M-matrix. For any time b ( t 0 , + ) , let u ( t ) = ( u 1 ( t ) , , u n ( t ) ) T C ( [ t 0 , b ) , R + n ) satisfies the following delay differential inequality for any initial condition u ( s ) C ( [ t 0 τ , t 0 ] , R + n ) :
D + u ( t ) P u ( t ) + Q [ | u ( t ) | ] τ
where t t 0 , [ | u ( t ) | ] τ = ( | u 1 ( t ) | τ , , | u n ( t ) | τ ) T , | u p ( t ) | τ = sup τ s 0 | u p ( t + s ) | for p = 1 , 2 , , n . Then, u ( t ) ξ e λ ( t t 0 ) , t t 0 , as long as u ( s ) ξ e λ ( s t 0 ) , t 0 τ s t 0 , where ξ = ( ξ 1 , , ξ n ) T is a positive real vector, and λ > 0 is decided by the inequality: ( λ I + P + Q e λ τ ) ξ < 0 .
Definition 4.
[24] The equilibrium point z * of (8) is said to be exponentially stable when there are constants λ > 0 and M 1 , such that for all t t 0 the inequality | Z ( t ) Z * | M | ϕ ( s ) Z * | e λ ( t t 0 ) is satisfied.

3. Main Results

In the following, we will firstly propose several sufficient conditions to ensure that (1) has a unique equilibrium point, and then corresponding proof is provided, aiming to ensure that the unique equilibrium point is global exponentially stable.
Theorem 1.
Suppose Assumption 1 is satisfied and Λ Φ L f Ψ L g is an M-matrix, there is a unique equilibrium point Z * for (1), where Φ = ( w p q ) n × n with w p q = sup t 0 ( | a ˜ p q ( t ) | ) and Ψ = ( v p q ) n × n with v p q = sup t 0 ( | b ˜ p q ( t ) | ) , L f = diag { l 1 f , , l n f } and L g = diag { l 1 g , , l n g } .
Proof. 
Firstly, we will try to illustrate that (10) has an equilibrium point Z * —that is, we should prove Z * is a solution of the following equation
Λ Z + A ˜ ( t ) F ( Z ) + B ˜ ( t ) G ( Z ) + J = 0 .
Consider the following operator according to the differential Equation (9)
H p ( z ) = d p 1 ( q = 1 n a ˜ p q f q ( z q ) + q = 1 n b ˜ p q g q ( z q ) + J p ) .
Then, (16) could be transformed into the following matrix format:
H ( Z ) = Λ 1 ( A ˜ F ( Z ) + B ˜ G ( Z ) + J ) ,
where z C n , H ( Z ) = ( H 1 ( z ) , , H n ( z ) ) T , F ( Z ) = ( f 1 ( z 1 ) , , f n ( z n ) ) T and G ( Z ) = ( g 1 ( z 1 ) , , g n ( z n ) ) T .
with the adoption of Assumption 1, one has
| H p ( z ) | d p 1 ( q = 1 n | a ˜ p q | | f q ( z q ) | + q = 1 n | b ˜ p q | | g q ( z q ) | + | J p | ) = d p 1 ( q = 1 n | a ˜ p q | | f q ( z q ) f q ( 0 ) + f q ( 0 ) | + q = 1 n | b ˜ p q | | g q ( z q ) g q ( 0 ) + g q ( 0 ) | + | J p | ) d p 1 ( q = 1 n | a ˜ p q | ( | f q ( z q ) f q ( 0 ) | + | f q ( 0 ) | ) + q = 1 n | b ˜ p q | ( | g q ( z q ) g q ( 0 ) | + | g q ( 0 ) | ) + | J p | ) d p 1 ( q = 1 n w p q ( | f q ( z q ) f q ( 0 ) | ) + q = 1 n v p q ( | g q ( z q ) g q ( 0 ) | ) + | J ˜ p | ) d p 1 ( q = 1 n w p q l q f | z q | + q = 1 n v p q l q g | z q | + | J ˜ p | )
where | J ˜ p | = q = 1 n w p q | f q ( 0 ) | + q = 1 n v p q | g q ( 0 ) | + | J p | . Then, one can get
[ | H ( Z ) | ] Λ 1 ( ( Φ L f + Ψ L g ) [ | Z | ] + [ | J ˜ | ] ) ,
where [ | H ( z ) | ] = ( | H 1 ( z ) | , , | H 1 ( z ) | ) T , [ | Z | ] = ( | z 1 | , , | z n | ) T and [ | J ˜ | ] = ( | J ˜ 1 | , , | J ˜ n | ) T . Since Λ Φ L f Ψ L g is an M-matrix, there is a positive vector ξ R n such that
[ | J ˜ | ] ( Λ Φ L f Ψ L g ) ξ ,
yielding
Λ 1 [ | J ˜ | ] ( I Λ 1 ( Φ L f + Ψ L g ) ) ξ ,
or
Λ 1 ( ( Φ L f + Ψ L g ) ) ξ + [ | J ˜ | ] ) ξ .
Consider B = { Z C n | [ | Z | ] ξ } . Therefore, for any Z B , one has [ | H ( Z ) | ] ξ . That is, the continuous operator H maps convex and compact set B into B . According to Brouwer’s fixed-point theorem, H has a fixed point z * B , and z * is also the equilibrium point of (10).
Next, we will prove the equilibrium point Z * B of (10) is unique. By means of apagoge, if it is not true, there exists another equilibrium point Z * * B with Z * Z * * . Then,
Z * = Λ 1 ( A ˜ F ( Z * ) + B ˜ G ( Z * ) + J ) , z * * = Λ 1 ( A ˜ F ( Z * * ) + B ˜ G ( Z * * ) + J )
As a result, one has | Z * Z * * | Λ 1 ( Φ L f + Ψ L g ) | Z * Z * * | . When Z * Z * * , we have [ | Z * Z * * | ] > 0 . Then, one has ρ ( Λ 1 ( Φ L f + Ψ L g ) ) 1 . On the other hand, Λ Φ L f Ψ L g is an M-matrix, which implies that ρ ( Λ 1 ( Φ L f + Ψ L g ) ) 1 . This contradiction indicates that Z * = Z * * —that is, there exists a unique equilibrium point for (10). □
Theorem 2.
Suppose Assumption 1 holds. If the condition in Theorem 1 is satisfied, the unique equilibrium point Z * is global exponentially stable.
Proof. 
Under Assumption 1, there exists a unique equilibrium point for (10) if the condition in Theorem 1 is satisfied. Suppose Z * is the unique equilibrium point of (10). Then, using the translation Z ˜ ( t ) = Z ( t ) Z * , we can transfer the equilibrium point to the origin. Hence, we obtain
d Z ˜ ( t ) d t = Λ Z ˜ ( t ) + A ˜ ( t ) F ˜ ( Z ˜ ( t ) ) + B ˜ ( t ) G ˜ ( Z ˜ ( t τ ( t ) ) ) , t 0
where Z ˜ ( t ) = ( z ˜ 1 ( t ) , , z ˜ n ( t ) ) T , F ˜ ( Z ˜ ( t ) ) = F ( Z ˜ ( t ) + Z * ) F ( Z * ) and G ˜ ( Z ˜ ( t τ ( t ) ) ) = G ( Z ˜ ( t τ ( t ) ) + Z * ) G ( Z * ) .
By using (19), we can have
d d t [ | Z ˜ ( t ) | ] 2 = 2 R e ( Z ˜ H ( t ) Z ˜ ˙ ( t ) ) = 2 R e ( Z ˜ H ( t ) ( Λ Z ˜ ( t ) + A ˜ ( t ) F ˜ ( Z ˜ ( t ) ) + B ˜ ( t ) G ˜ ( Z ˜ ( t τ ( t ) ) ) ) ) = 2 R e ( Z ˜ H ( t ) Λ Z ˜ ( t ) ) + 2 R e ( Z ˜ H ( t ) A ˜ ( t ) F ˜ ( Z ˜ ( t ) ) ) + 2 R e ( Z ˜ H ( t ) B ˜ ( t ) G ˜ ( Z ˜ ( t τ ( t ) ) ) ) )
where [ | Z ˜ ( t ) | ] = ( | z ˜ 1 ( t ) | , , | z ˜ n ( t ) | ) T and [ | Z ˜ ( t ) | ] 2 = ( | z ˜ 1 ( t ) | 2 , , | z ˜ n ( t ) | 2 ) T .
Because Λ is a real diagonal matrix Λ = d i a g { d 1 , , d n } , one has
R e ( Z ˜ H ( t ) Λ Z ˜ ( t ) ) = p = 1 n d p z ˜ ¯ p ( t ) z ˜ p ( t ) = [ | Z ˜ ( t ) | ] T Λ [ | Z ˜ ( t ) | ] ,
where z ˜ ¯ p ( t ) is the conjugator of z ˜ p ( t ) .
According to Assumption 1, we could get
R e ( Z ˜ H ( t ) A ˜ ( t ) F ˜ ( z ˜ ( t ) ) ) = R e ( p = 1 n q = 1 n a ˜ p q ( t ) z ˜ ¯ p ( t ) f ˜ q ( z ˜ q ( t ) ) ) p = 1 n q = 1 n | a ˜ p q ( t ) | | z ˜ ¯ p ( t ) | | f ˜ q ( z ˜ q ( t ) ) | p = 1 n q = 1 n | w p q ( t ) | l q f | z ˜ p ( t ) | | z ˜ q ( t ) | = [ | Z ˜ ( t ) | ] T Φ L f [ | Z ˜ ( t ) | ]
Similar with (23), we have
R e ( Z ˜ H ( t ) B ˜ ( t ) G ˜ ( Z ˜ ( t τ ( t ) ) ) ) = R e ( p = 1 n q = 1 n b ˜ p q ( t ) z ˜ ¯ p ( t ) g ˜ q ( z ˜ q ( t τ ( t ) ) ) ) p = 1 n q = 1 n | b ˜ p q ( t ) | | z ˜ ¯ p ( t ) | | g ˜ q ( z ˜ q ( t τ ( t ) ) ) | p = 1 n q = 1 n | v p q ( t ) | l q g | z ˜ p ( t ) | | z ˜ q ( t τ ( t ) ) | = [ | Z ˜ ( t ) | ] T Ψ L g [ | Z ˜ ( t τ ( t ) ) | ]
Combining (21), (22), and (23) into (20) and noticing that d d t [ | Z ˜ ( t ) | ] 2 = 2 [ | Z ˜ ( t ) | ] T d d t [ | Z ˜ ( t ) | ] , one gets
2 [ | Z ˜ ( t ) | ] T d d t [ | Z ˜ ( t ) | ] 2 [ | Z ˜ ( t ) | ] T ( Λ [ | Z ˜ ( t ) | ] Φ L f [ | Z ˜ ( t ) | ] Ψ L g [ | Z ˜ ( t τ ( t ) ) | ] ) , t 0
that is,
d d t [ | Z ˜ ( t ) | ] ( Λ [ | Z ˜ ( t ) | ] Φ L f [ | Z ˜ ( t ) | ] Ψ L g [ | Z ˜ ( t τ ( t ) ) | ] ) , t 0
Since Λ Φ L f Ψ L g is an M-matrix, there exists a vector ξ such that ( Λ Φ L f Ψ L g ) ξ > 0 .
For any given initial condition ϕ ˜ ( s ) = ϕ ( s ) Z * , s [ τ , 0 ] , by Lemma 1, we could obtain
[ | Z ˜ ( t ) | ] Θ [ | ϕ ˜ ( s ) | τ ] e λ ( t t 0 ) , t t 0
where Θ = max { 1 , max 1 k n { ξ k } min 1 k n { | ϕ ˜ k | τ } } , λ is decided by the inequality ( λ I Λ + Φ L f + Ψ L g e λ τ ) ξ < 0 . This leads to the result
| Z ˜ ( t ) | Θ [ | ϕ ˜ ( s ) | τ ] e λ ( t t 0 ) , t t 0
The proof completes. □
Figure In this section, some sufficient conditions are achieved about the existence and uniqueness of the equilibrium point, and several criteria are obtained to guarantee the exponential stability for the MCVNNs with time delays. These results obtained can be applied to more general MCVNNs whether the activation functions are explicitly described by either dividing the real parts and imaginary parts, or not.

4. Examples

In this section, two examples are given to demonstrate the validity of the obtained results.
Example 1.
Consider a two-order MCVNN, as follows:
d z p ( t ) d t = d p z p ( t ) + q = 1 2 a p q ( z p ( t ) ) f q ( z q ( t ) ) + q = 1 2 b p q ( z q ( t τ q ( t ) ) ) g q ( z q ( t τ q ( t ) ) ) + J p , p = 1 , 2 ,
where z p ( t ) = x p ( t ) + i y p ( t ) , d 1 = 5 , d 2 = 6 , J 1 = 1.5 2.5 i , J 2 = 1 0.5 i and the time delays τ q ( t ) = e t 1 + e t ,
a 11 ( z 1 ( t ) ) = 1.8 + 2 i , | z 1 ( t ) | 1 , 1.5 + 2 i , | z 1 ( t ) | > 1 , a 12 ( z 1 ( t ) ) = 2.8 + 1.2 i , | z 1 ( t ) | 1 , 2.5 + i , | z 1 ( t ) | > 1 ,
a 21 ( z 2 ( t ) ) = 1 + i , | z 1 ( t ) | 1 , 0.8 + i , | z 1 ( t ) | > 1 , a 22 ( z 2 ( t ) ) = 1 + i , | z 1 ( t ) | 1 , 0.8 + i , | z 1 ( t ) | > 1 ,
b 11 ( z 1 ( t τ 1 ( t ) ) ) = 3.5 + i , | z 1 ( t τ 1 ( t ) ) | 1 , 3.2 + i , | z 1 ( t τ 1 ( t ) ) | > 1 ,
b 12 ( z 1 ( t τ 1 ( t ) ) ) = 0.5 + i , | z 1 ( t τ 1 ( t ) ) | 1 , 0.1 + i , | z 1 ( t τ 1 ( t ) ) | > 1 ,
b 21 ( x 2 ( t τ 2 ( t ) ) ) = 0.1 + i , | z 2 ( t τ 2 ( t ) ) | 1 , 0.2 + i , | z 2 ( t τ 2 ( t ) ) | > 1 ,
b 22 ( z 2 ( t τ 2 ( t ) ) ) = 3.6 + i , | z 2 ( t τ 2 ( t ) ) | 1 , 3.2 + i , | z 2 ( t τ 2 ( t ) ) | > 1 .
Therefore, one can get
Φ = 7.24 9.28 2 2 Ψ = 13.25 1.25 1.04 13.96
Assume the activation functions of (29) as follows:
f q ( z q ) = 0.5 | y q | + 0.5 i | x q | , g q ( z q ) = 1 e y q 1 + e y q + i 1 1 + e x q , q = 1 , 2 .
Then, through simple calculation, one can get the activation functions which satisfy Assumption 1. That is, for any z q = x q + i y q , z ˜ q = x ˜ q + i y ˜ q C , one can have
| f q ( z q ) f q ( z ˜ q ) | = 0.5 | ( | y q | | y ˜ q | ) + i ( | x q | | x ˜ q | ) | = 0.5 ( | x q | | x ˜ q | ) 2 + ( | y q | | y ˜ q | ) 2 0.5 ( x q x ˜ q ) 2 + ( y q y ˜ q ) 2 = 0.5 | z q z ˜ q |
| g q ( z q ) g q ( z ˜ q ) | = | ( 1 e y q 1 + e y q 1 e y ˜ q 1 + e y ˜ q ) + i ( 1 1 + e x q 1 1 + e x ˜ q ) | = ( 1 e y q 1 + e y q 1 e y ˜ q 1 + e y ˜ q ) 2 + ( 1 1 + e x q 1 1 + e x ˜ q ) 2 0.0625 ( x q x ˜ q ) 2 + 0.25 ( y q y ˜ q ) 2 0.5 | z q z ˜ q |
Then, one has L f = L g = diag ( 0.5 , 0.5 ) .
We have that
Λ Φ L f Ψ L g = 1.8346 2.0822 1.2170 3.4247
is an M matrix, then the conditions of Theorem 1 are satisfied. Let the initial values of (29) be z 1 ( s ) = , z 2 ( s ) = for s [ 1 , 0 ] . Figure 1 and Figure 2 show that the equilibrium point of (29) is existent, unique, and exponentially stable.
Example 2.
Consider the MCVNNs with d 1 = 4 , d 2 = 5 , J 1 = 1.2 1.5 i , J 2 = 0.1 2.5 i and the time-varying delays τ q ( t ) = 2 + 0.5 s i n ( t ) ,
a 11 ( z 1 ( t ) ) = 1.2 + 0.2 i , | z 1 ( t ) | 1 , 1.0 + 0.2 i , | z 1 ( t ) | > 1 , a 12 ( z 1 ( t ) ) = 1.8 + 1.2 i , | z 1 ( t ) | 1 , 1.5 + i , | z 1 ( t ) | > 1 , a 21 ( z 2 ( t ) ) = 1 + i , | z 2 ( t ) | 1 , 0.8 + i , | z 2 ( t ) | > 1 , a 22 ( z 2 ( t ) ) = 1.2 + i , | z 2 ( t ) | 1 , 1.8 + i , | z 2 ( t ) | > 1 ,
b 11 ( z 1 ( t τ 1 ( t ) ) ) = 1.5 + 1.5 i , | z 1 ( t τ 1 ( t ) ) | 1 , 1.2 + 1.2 i , | z 1 ( t τ 1 ( t ) ) | > 1 ,
b 12 ( z 1 ( t τ 1 ( t ) ) ) = 0.5 + 2 i , | z 1 ( t τ 1 ( t ) ) | 1 , 0.3 + 1.8 i , | z 1 ( t τ 1 ( t ) ) | > 1 ,
b 21 ( z 2 ( t τ 2 ( t ) ) ) = 0.1 + i , | z 2 ( t τ 2 ( t ) ) | 1 , 0.2 + i , | z 2 ( t τ 2 ( t ) ) | > 1 ,
b 22 ( z 2 ( t τ 2 ( t ) ) ) = 2.6 + i , | z 2 ( t τ 2 ( t ) ) | 1 , 2.2 + i , | z 2 ( t τ 2 ( t ) ) | > 1 .
Therefore, one can get
Φ = 1.48 4.68 2 4.68 Ψ = 4.5 4.25 1.04 7.76
Assume the activation functions of (29) are as follows:
f q ( z q ) = 0.5 z ¯ q , g q ( z q ) = 1 e z ¯ q 1 + | z q | 1 + e z ¯ q 1 + | z q | , q = 1 , 2 .
Similarly, one has L f = L g = diag ( 0.5 , 0.5 ) .
We have that
Λ Φ L f Ψ L g = 2.3311 2.1124 1.2170 2.5255
is an M matrix, then the conditions of Theorem 1 are satisfied and the CVMRNN system (29) is global exponentially stable. Numerical simulations are shown in Figure 3 and Figure 4.
Remark 3.
Examples 1 and 2 show that the constraints on the activation functions are more relaxed. In Example 1, f q ( · ) and g q ( · ) only need to satisfy the Lipschitz condition, and the partial derivative of f q ( · ) and g q ( · ) need not be existent, bounded, and continuous, unlike in [3,27]—that is, f j R x j , f j R y j , f j I x j , f j I y j need not be existent, bounded, and continuous. In Example 2, f q ( · ) and g q ( · ) need not be explicitly described by dividing their real and imaginary parts, unlike in [3,17,18,25,26,27,28,29,30].

5. Conclusions

In this paper, the existence, uniqueness, and exponential stability of the equilibrium point for a class of MCVNNs with time delays were investigated. Several sufficient conditions were obtained by means of the M-matrix theorem and Brouwer’s fixed-point theorem. These results obtained can be applied to general MCVNNs where the activation functions are explicitly described by either dividing the real parts and imaginary parts or not. Two numerical examples were provided, while our corresponding analysis demonstrates that the theoretic results obtained are viable for the design and application of MCVNNs with time delays.

Author Contributions

Conceptualization, P.H.; Methodology, J.G.; Software, J.H.; Validation, P.Z.; Formal Analysis, J.G.

Funding

This work is supported by the National Key R&D Program of China under Grant 2017YFD0401005, and the Natural Science Foundation of the Jiangsu Higher Education Institutions of China under Grant 18KJB520038.

Acknowledgments

We gratefully acknowledge the kind cooperation of Peican Zhu in the preparation of this Application note.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hirose, A. Complex-Valued Neural Networks; Springer Science and Business Media: Berlin, Germany, 2006. [Google Scholar]
  2. Valle, M.E. Complex-Valued Recurrent Correlation Neural Networks. IEEE Trans. Neural Netw. Learn. Syst. 2014, 25, 1600–1612. [Google Scholar] [CrossRef] [PubMed]
  3. Hu, J.; Wang, J. Global Stability of Complex-Valued Recurrent Neural Networks with Time-Delays. IEEE Trans. Neural Netw. Learn. Syst. 2012, 23, 853–865. [Google Scholar] [CrossRef] [PubMed]
  4. Zhou, B.; Song, Q. Boundedness and Complete Stability of Complex-Valued Neural Networks with Time Delay. IEEE Trans. Neural Netw. Learn. Syst. 2013, 24, 1227–1238. [Google Scholar] [CrossRef] [PubMed]
  5. Strukov, D.B.; Snider, G.S.; Stewart, D.R.; Williams, R.S. The missing memristor found. Nature 2008, 453, 80–83. [Google Scholar] [CrossRef] [PubMed]
  6. Hu, J.; Wang, J. Global uniform asymptotic stability of memristor-based recurrent neural networks with time delays. In Proceedings of the 2010 International Joint Conference on Neural Networks (IJCNN), Barcelona, Spain, 18–23 July 2010; pp. 1–8. [Google Scholar]
  7. Li, H.-J.; Wang, L. Multi-scale asynchronous belief percolation model on multiplex networks. New J. Phys. 2019, 21, 015005. [Google Scholar] [CrossRef]
  8. Wang, Z.; Ding, S.; Huang, Z.; Zhang, H. Exponential Stability and Stabilization of Delayed Memristive Neural Networks Based on Quadratic Convex Combination Method. IEEE Trans. Neural Netw. Learn. Syst. 2015, 129, 2029–2035. [Google Scholar] [CrossRef] [PubMed]
  9. Bu, Z.; Li, H.J.; Cao, J.; Wang, Z.; Gao, G. Dynamic Cluster Formation Game for Attributed Graph Clustering. IEEE Trans. Cybern. 2017, 49, 328–341. [Google Scholar] [CrossRef]
  10. Li, H.-J.; Bu, Z.; Li, Y.; Zhang, Z.; Chu, Y.; Li, G.; Cao, J. Evolving the attribute flow for dynamical clustering in signed networks. Chaos Sol. Fractals 2018, 110, 20–27. [Google Scholar] [CrossRef]
  11. Gao, J.; Zhu, P.; Alsaedi, A.; Alsaadi, F.E.; Hayat, T. A new switching control for finite-time synchronization of memristor-based recurrent neural networks. Neural Netw. 2017, 86, 1–9. [Google Scholar] [CrossRef]
  12. 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]
  13. Li, H.J.; Bu, Z.; Wang, Z.; Cao, J.; Shi, Y. Enhance the Performance of Network Computation by a Tunable Weighting Strategy. IEEE Trans. Emerg. Top. Comput. Intell. 2018, 2, 214–223. [Google Scholar] [CrossRef]
  14. Zhang, W.; Li, C.; Huang, T.; Huang, J. Stability and synchronization of memristor-based coupling neural networks with time-varying delays via intermittent control. Neurocomputing 2016, 173, 1066–1072. [Google Scholar] [CrossRef]
  15. Xu, C.; Li, P.; Pang, Y. Exponential stability of almost periodic solutions for memristor-based neural networks with distributed leakage delays. Neural Comput. 2016, 28, 2726–2756. [Google Scholar] [CrossRef]
  16. Gao, J.; Cao, J. Aperiodically intermittent synchronization for switching complex networks dependent on topology structure. Adv. Differ. Equ. 2017, 2017, 244. [Google Scholar] [CrossRef]
  17. Rakkiyappan, R.; Velmurugan, G.; Cao, J. Finite-time stability analysis of fractional-order complex-valued memristor-based neural networks with time delays. Nonlinear Dyn. 2014, 78, 2823–2836. [Google Scholar] [CrossRef]
  18. Wang, H.; Duan, S.; Huang, T.; Wang, L.; Li, C. Exponential stability of complex-valued memristive recurrent neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2016, 99, 1–6. [Google Scholar] [CrossRef]
  19. Gao, J.; Zhu, P.; Xiong, W.; Gao, J.; Zhang, L. Asymptotic synchronization for stochastic memristor-based neural networks with noise disturbance. J. Frankl. Inst. 2016, 353, 3271–3289. [Google Scholar] [CrossRef]
  20. Gao, J.; Zhu, P. Global exponential synchronization of networked dynamical systems under event-triggered control schemes. Adv. Differ. Equ. 2016, 2016, 286. [Google Scholar] [CrossRef]
  21. Filippov, A.F. Differential Equations with Discontinuous Righthand Sides; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1988; pp. 377–390. [Google Scholar]
  22. Guo, Z.; Wang, J.; Yan, Z. Attractivity analysis of memristor-based cellular neural networks with time-varying delays. IEEE Trans. Neural Netw. Learn. Syst. 2014, 25, 704–717. [Google Scholar] [CrossRef]
  23. Liu, X.; Chen, T. Global exponential stability for complex-valued recurrent neural networks with asynchronous time delays. IEEE Trans. Neural Netw. Learn. Syst. 2016, 27, 593–606. [Google Scholar] [CrossRef]
  24. Pan, J.; Liu, X.; Xie, W. Exponential stability of a class of complex-valued neural networks with time-varying delays. Neurocomputing 2015, 164, 293–299. [Google Scholar] [CrossRef]
  25. Liu, D.; Zhu, S.; Chang, W. Input-to-state stability of memristor-based complex-valued neural networks with time delays. Neurocomputing 2017, 221, 159–167. [Google Scholar] [CrossRef]
  26. Chen, X.; Song, Q. Global stability of complex-valued neural networks with both leakage time delay and discrete time delay on time scales. Neurocomputing 2013, 121, 254–264. [Google Scholar] [CrossRef]
  27. Xu, X.; Zhang, J.; Shi, J. Exponential stability of complex-valued neural networks with mixed delays. Neurocomputing 2014, 128, 483–490. [Google Scholar] [CrossRef]
  28. Mathiyalagan, K.; Anbuvithya, R.; Sakthivel, R.; Park, J.H.; Prakash, P. Non-fragile H-infinity synchronization of memristor-based neural networks using passivity theory. Neural Netw. 2016, 74, 85–100. [Google Scholar] [CrossRef]
  29. Zhang, R.; Park, J.H.; Zeng, D.; Liu, Y.; Zhong, S. A new method for exponential synchronization of memristive recurrent neural networks. Inf. Sci. 2018, 466, 152–169. [Google Scholar] [CrossRef]
  30. Zhang, R.; Zeng, D.; Ju, H.P.; Zhong, S.; Yu, Y. Novel discontinuous control for exponential synchronization of memristive recurrent neural networks with heterogeneous time-varying delays. J. Frankl. Inst. 2018, 355, 2826–2848. [Google Scholar] [CrossRef]
Figure 1. Curves of z 1 and z 2 .
Figure 1. Curves of z 1 and z 2 .
Entropy 21 00120 g001
Figure 2. Curves of the real and imaginary parts of z 1 and z 2 .
Figure 2. Curves of the real and imaginary parts of z 1 and z 2 .
Entropy 21 00120 g002
Figure 3. Curves of z 1 and z 2 .
Figure 3. Curves of z 1 and z 2 .
Entropy 21 00120 g003
Figure 4. Curves of the real and imaginary parts of z 1 and z 2 .
Figure 4. Curves of the real and imaginary parts of z 1 and z 2 .
Entropy 21 00120 g004

Share and Cite

MDPI and ACS Style

Hou, P.; Hu, J.; Gao, J.; Zhu, P. Stability Analysis for Memristor-Based Complex-Valued Neural Networks with Time Delays. Entropy 2019, 21, 120. https://doi.org/10.3390/e21020120

AMA Style

Hou P, Hu J, Gao J, Zhu P. Stability Analysis for Memristor-Based Complex-Valued Neural Networks with Time Delays. Entropy. 2019; 21(2):120. https://doi.org/10.3390/e21020120

Chicago/Turabian Style

Hou, Ping, Jun Hu, Jie Gao, and Peican Zhu. 2019. "Stability Analysis for Memristor-Based Complex-Valued Neural Networks with Time Delays" Entropy 21, no. 2: 120. https://doi.org/10.3390/e21020120

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