Volume 2013, Issue 1 427827
Research Article
Open Access

Asymptotic Stability of Impulsive Cellular Neural Networks with Infinite Delays via Fixed Point Theory

Yutian Zhang

Corresponding Author

Yutian Zhang

School of Mathematics and Statistics, Nanjing University of Information Science and Technology, Nanjing 210044, China nuist.edu.cn

Search for more papers by this author
Yuanhong Guan

Yuanhong Guan

School of Mathematics and Statistics, Nanjing University of Information Science and Technology, Nanjing 210044, China nuist.edu.cn

Search for more papers by this author
First published: 25 March 2013
Academic Editor: Qi Luo

Abstract

We employ the new method of fixed point theory to study the stability of a class of impulsive cellular neural networks with infinite delays. Some novel and concise sufficient conditions are presented ensuring the existence and uniqueness of solution and the asymptotic stability of trivial equilibrium at the same time. These conditions are easily checked and do not require the boundedness and differentiability of delays.

1. Introduction

Cellular neural networks (CNNs), proposed by Chua and Yang in 1988 [1, 2], have become a hot topic for their numerous successful applications in various fields such as optimization, linear and nonlinear programming, associative memory, pattern recognition, and computer vision.

Due to the finite switching speed of neurons and amplifiers in the implementation of neural networks, it turns out that the time delays should not be neglected, and therefore, the model of delayed cellular neural networks (DCNNs) is put forward, which is naturally of better realistic significances. In fact, besides delay effects, stochastic and impulsive as well as diffusing effects are also likely to exist in neural networks. Accordingly many experts are showing a growing interest in the research on the dynamic behaviors of complex CNNs such as impulsive delayed reaction-diffusion CNNs and stochastic delayed reaction-diffusion CNNs, with a result of many achievements [39] obtained.

Synthesizing the reported results about complex CNNs, we find that the existing research methods for dealing with stability are mainly based on Lyapunov theory. However, we also notice that there are still lots of difficulties in the applications of corresponding results to specific problems; correspondingly it is necessary to seek some new techniques to overcome those difficulties.

Encouragingly, in recent few years, Burton and other authors have applied the fixed point theory to investigate the stability of deterministic systems and obtained some more applicable results; for example, see the monograph [10] and papers [1122]. In addition, more recently, there have been a few publications where the fixed point theory is employed to deal with the stability of stochastic (delayed) differential equations; see [2329]. Particularly, in [2426], Luo used the fixed point theory to study the exponential stability of mild solutions to stochastic partial differential equations with bounded delays and with infinite delays. In [27, 28], Sakthivel used the fixed point theory to investigate the asymptotic stability in pth moment of mild solutions to nonlinear impulsive stochastic partial differential equations with bounded delays and with infinite delays. In [29], Luo used the fixed point theory to study the exponential stability of stochastic Volterra-Levin equations.

Naturally, for complex CNNs which have high application values, we wonder if we can utilize the fixed point theory to investigate their stability, not just the existence and uniqueness of solution. With this motivation, in the present paper, we aim to discuss the stability of impulsive CNNs with infinite delays via the fixed point theory. It is worth noting that our research skill is the contraction mapping theory which is different from the usual method of Lyapunov theory. We employ the fixed point theorem to prove the existence and uniqueness of solution and the asymptotic stability of trivial equilibrium all at once. Some new and concise algebraic criteria are provided, and these conditions are easy to verify and, moreover, do not require the boundedness and differentiability of delays.

2. Preliminaries

Let Rn denote the n-dimensional Euclidean space and let  ∥·∥ represent the Euclidean norm. 𝒩≜{1,2, …, n}. R+ = [0, ). C[X, Y] corresponds to the space of continuous mappings from the topological space X to the topological space Y.

In this paper, we consider the following impulsive cellular neural network with infinite delays:
()
()
where i𝒩 and n is the number of neurons in the neural network. xi(t) corresponds to the state of the ith neuron at time t. fj(·),    gj(·) ∈ C[R, R] denote the activation functions, respectively. τj(t) ∈ C[R+,   R+] corresponds to the known transmission delay satisfying τj(t) → and tτj(t) → as t. Denote ϑ = inf {tτj(t),   t ≥ 0, j𝒩}. The constant bij represents the connection weight of the jth neuron on the ith neuron at time t. The constant cij denotes the connection strength of the jth neuron on the ith neuron at time tτj(t). The constant ai > 0 represents the rate with which the ith neuron will reset its potential to the resting state when disconnected from the network and external inputs. The fixed impulsive moments tk (k = 1,2, …) satisfy 0 = t0 < t1 < t2 < ⋯ and lim ktk = . xi(tk + 0) and xi(tk − 0) stand for the right-hand and left-hand limits of xi(t) at time tk, respectively. Iik(xi(tk)) shows the abrupt change of xi(t) at the impulsive moment tk and Iik(·) ∈ C[R, R].

Throughout this paper, we always assume that fi(0) = gi(0) = Iik(0) = 0 for i𝒩 and k = 1,2, …. Thereby, problem (1) and (2) admits a trivial equilibrium x = 0.

Denote by the solution to (1) and (2) with the initial condition
()
where and φi(s) ∈ C[[ϑ, 0], R]. Denote |φ| = sup s∈[ϑ,0]φ(s)∥.
The solution x(t)≜x(t; s, φ) ∈ Rn of (1)–(3) is, for the time variable t, a piecewise continuous vector-valued function with the first kind discontinuity at the points tk (k = 1,2, …), where it is left continuous; that is, the following relations are valid:
()

Definition 1. The trivial equilibrium x = 0 is said to be stable, if, for any ε > 0, there exists δ > 0 such that for any initial condition φ(s) ∈ C[[ϑ, 0], Rn] satisfying  |φ| < δ:

()

Definition 2. The trivial equilibrium x = 0 is said to be asymptotically stable if the trivial equilibrium x = 0 is stable, and for any initial condition φ(s) ∈ C[[ϑ, 0], Rn], lim tx(t; s, φ)∥ = 0 holds.

The consideration of this paper is based on the following fixed point theorem.

Theorem 3 (see [30].)Let Υ be a contraction operator on a complete metric space Θ, then there exists a unique point ζ ∈ Θ for which Υ(ζ) = ζ.

3. Main Results

In this section, we will consider the existence and uniqueness of solution and the asymptotic stability of trivial equilibrium by means of the contraction mapping principle. Before proceeding, we introduce some assumptions listed as follows.
  • (A1)

    There exist nonnegative constants lj such that, for any η, υR,

    ()

  • (A2)

    There exist nonnegative constants kj such that, for any η, υR,

    ()

  • (A3)

    There exist nonnegative constants pjk such that, for any η, υR,

    ()

Let = 1 × ⋯×n, and let i (i𝒩) be the space consisting of functions ϕi(t) : [ϑ, ) → R, where ϕi(t) satisfies the following:
  • (1)

    ϕi(t) is continuous on ttk (k = 1,2, …);

  • (2)

    and exist; furthermore, for k = 1,2, …;

  • (3)

    ϕi(s) = φi(s) on s ∈ [ϑ, 0];

  • (4)

    ϕi(t) → 0 as t;

here tk (k = 1,2, …) and φi(s) (s ∈ [ϑ, 0]) are defined as shown in Section 2. Also is a complete metric space when it is equipped with the following metric:
()
where and .

In what follows, we will give the main result of this paper.

Theorem 4. Assume that conditions (A1)–(A3) hold. Provided that

  • (i)

    there exists a constant μ such that inf k=1,2,…{tktk−1} ≥ μ,

  • (ii)

    there exist constants pi such that pikpiμ for i𝒩 and k = 1,2, …,

  • (iii)

    ,

  • (iv)

    , where ,

then the trivial equilibrium x = 0 is asymptotically stable.

Proof. Multiplying both sides of (1) with gives, for t > 0 and ttk,

()
which yields after integrating from tk−1 + ε (ε > 0) to t ∈ (tk−1, tk) (k = 1,2, …)
()

Letting ε → 0 in (11), we have

()
for t ∈ (tk−1, tk) (k = 1,2, …). Setting t = tkε (ε > 0) in (12), we get
()
which generates by letting ε → 0
()

Noting xi(tk − 0) = xi(tk), (14) can be rearranged as

()

Combining (12) and (15), we reach that

()
is true for t ∈ (tk−1, tk] (k = 1,2, …). Further,
()
holds for t ∈ (tk−1, tk] (k = 1,2, ⋯). Hence,
()
which produces, for t > 0,
()

Note xi(0) = φi(0) in (19). We then define the following operator π acting on , for :

()
where π(yi)(t) : [ϑ, ) → R (i𝒩) obeys the rules as follows:
()
on t ≥ 0 and π(yi)(s) = φi(s) on s ∈ [ϑ, 0].

The subsequent part is the application of the contraction mapping principle, which can be divided into two steps.

Step 1. We need to prove π() ⊂ . Choosing yi(t) ∈ i (i𝒩), it is necessary to testify π(yi)(t) ⊂ i.

First, since π(yi)(s) = φi(s) on s ∈ [ϑ, 0] and φi(s) ∈ C[[ϑ, 0], R], we know π(yi)(s) is continuous on s ∈ [ϑ, 0]. For a fixed time t > 0, it follows from (21) that

()
where
()
()

Owing to yi(t) ∈ i, we see that yi(t) is continuous on ttk (k = 1,2, …); moreover, and exist, and .

Consequently, when ttk (k = 1,2, …) in (22), it is easy to find that Qi → 0 as r → 0 for i = 1, …, 4, and so π(yi)(t) is continuous on the fixed time ttk (k = 1,2, …).

On the other hand, as t = tk (k = 1,2, …) in (22), it is not difficult to find that Qi → 0 as r → 0 for i = 1,2, 3. Furthermore, if letting r < 0 be small enough, we derive

()
which implies as t = tk. While letting  r > 0  tend to zero gives
()
which yields as t = tk.

According to the above discussion, we find that π(yi)(t) : [ϑ, ) → R is continuous on ttk (k = 1,2, …); moreover, and exist; in addition, .

Next, we will prove π(yi)(t) → 0 as t. For convenience, denote

()
where , , , and.

Due to yj(t) ∈ j (j𝒩), we know lim tyj(t) = 0. Then for any ε > 0, there exists a Tj > 0 such that tTj implies |yj(t)  | < ε. Choose T* = max j𝒩{Tj}. It is derived from (A1) that, for tT*,

()
Moreover, as , we can find a for the given ε such that implies , which leads to
()
namely,
()

On the other hand, since tτj(t) → as t, we get lim tyj(tτj(t)) = 0. Then for any ε > 0, there also exists a such that implies |yj(sτj(s))| < ε. Select . It follows from (A2) that

()
which results in
()

Furthermore, from (A3), we know that |Iik(yi(tk))| ≤ pik|yi(tk)|. So

()

As yi(t) ∈ i, we have lim tyi(t) = 0. Then for any ε > 0, there exists a nonimpulsive point Ti > 0 such that sTi implies |yi(s)| < ε. It then follows from conditions (i) and (ii) that

()
which produces
()

From (30), (32), and (35), we deduce π(yi)(t) → 0 as t for i𝒩. We therefore conclude that π(yi)(t) ⊂ i (i𝒩) which means π() ⊂ .

Step 2. We need to prove π is contractive. For and , we estimate

()
where ,.

Note

()

It hence follows from (37) that

()
which implies
()

Therefore,

()

In view of condition (iii), we see π is a contraction mapping, and, thus there exists a unique fixed point of π in which means the transposition of is the vector-valued solution to (1)–(3) and its norm tends to zero as t.

To obtain the asymptotic stability, we still need to prove that the trivial equilibrium x = 0 is stable. For any ε > 0, from condition (iv), we can find δ satisfying 0 < δ < ε such that . Let |φ| < δ. According to what has been discussed above, we know that there exists a unique solution to (1)–(3); moreover,

()
here , , , and .

Suppose there exists t* > 0 such that ∥x(t*; s, φ)∥ = ε and ∥x(t; s, φ)∥ < ε as 0 ≤ t < t*. It follows from (41) that

()
As
()
we obtain |xi(t*)| < δ + λiε.

So . This contradicts the assumption of ∥x(t*; s, φ)∥ = ε. Therefore, ∥x(t; s, φ)∥ < ε holds for all t ≥ 0. This completes the proof.

Corollary 5. Assume that conditions (A1)–(A3) hold. Provided that

  • (i)

    inf k=1,2,…{tktk−1} ≥ 1,

  • (ii)

    there exist constants pi such that pikpi for i𝒩 and k = 1,2, …,

  • (iii)

    ,

  • (iv)

    , where ,

then the trivial equilibrium x = 0 is asymptotically stable.

Proof. Corollary 5 is a direct conclusion by letting μ = 1 in Theorem 4.

Remark 6. In Theorem 4, we can see it is the fixed point theory that deals with the existence and uniqueness of solution and the asymptotic analysis of trivial equilibrium at the same time, while Lyapunov method fails to do this.

Remark 7. The presented sufficient conditions in Theorems 4 and Corollary 5 do not require even the boundedness and differentiability of delays, let alone the monotone decreasing behavior of delays which is necessary in some relevant works.

Provided that Iik(·) ≡ 0, (1) and (2) will become the following cellular neural network with infinite delays and without impulsive effects:
()
where ai, bij, cij, fj(·), gj(·), τj(t), and  xi(t) are the same as defined in Section 2. Obviously, (44) also admits a trivial equilibrium x = 0. From Theorem 4, we reach the following.

Theorem 8. Assume that conditions (A1)-(A2) hold. Provided that

  • (i)

    ,

  • (ii)

    , where ,

then the trivial equilibrium x = 0 is asymptotically stable.

4. Example

Consider the following two-dimensional impulsive cellular neural network with infinite delays:
()
with the initial conditions x1(s) = cos (s), x2(s) = sin(s) on −1 ≤ s ≤ 0, where τj(t) = 0.4t + 1, a1 = a2 = 7, bij = 0, c11 = 3/7, c12 = 2/7, c21 = 0, c22 = 1/7, fj(s) = gj(s) = (|s + 1| − |s − 1|)/2, and tk = tk−1 + 0.5k.
It is easy to see that μ = 0.5, lj = kj = 1, and pik = 0.4. Let pi = 0.8 and compute
()
where . From Theorem 4, we conclude that the trivial equilibrium x = 0 of this two-dimensional impulsive cellular neural network with infinite delays is asymptotically stable.

5. Conclusions

This work is devoted to seeking new methods to investigate the stability of complex neural networks. From what has been discussed above, we find that the fixed point theory is feasible. With regard to a class of impulsive cellular neural networks with infinite delays, we utilize the contraction mapping principle to deal with the existence and uniqueness of solution and the asymptotic analysis of trivial equilibrium at the same time, for which Lyapunov method feels helpless. Now that there are different kinds of fixed point theorems and complex neural networks, our future work is to continue the study on the application of fixed point theory to the stability analysis of complex neural networks.

Acknowledgment

This work is supported by the National Natural Science Foundation of China under Grants 60904028, 61174077, and 41105057.

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.