• 検索結果がありません。

EXISTENCE AND GLOBAL STABILITY OF PERIODIC SOLUTION FOR DELAYED DISCRETE HIGH-ORDER HOPFIELD-TYPE NEURAL NETWORKS

N/A
N/A
Protected

Academic year: 2022

シェア "EXISTENCE AND GLOBAL STABILITY OF PERIODIC SOLUTION FOR DELAYED DISCRETE HIGH-ORDER HOPFIELD-TYPE NEURAL NETWORKS"

Copied!
17
0
0

読み込み中.... (全文を見る)

全文

(1)

EXISTENCE AND GLOBAL STABILITY OF PERIODIC SOLUTION FOR DELAYED DISCRETE HIGH-ORDER HOPFIELD-TYPE NEURAL NETWORKS

HONG XIANG, KE-MING YAN, AND BAI-YAN WANG Received 6 February 2005

By using coincidence degree theory as well as a priori estimates and Lyapunov functional, we study the existence and global stability of periodic solution for discrete delayed high- order Hopfield-type neural networks. We obtain some easily verifiable sufficient condi- tions to ensure that there exists a unique periodic solution, and all theirs solutions con- verge to such a periodic solution.

1. Introduction

It is well known that studies on neural dynamical systems not only involve discussion of stability property, but also involve other dynamics behaviors such as periodic oscillatory, bifurcation and chaos. In many applications, the property of periodic oscillatory solu- tions are of great interest. For example, the human brain has been in periodic oscillatory or chaos state, hence it is of prime importance to study periodic oscillatory and chaos phenomenon of neural networks. Recently, Liu and Liao [8], Zhou and Liu [15] consider the existence and global exponential stability of periodic solutions of delayed Hopfield neural networks and delayed cellular neural networks. Liu et al. [7] address the existence and global exponential stability of periodic solutions of delayed BAM neural networks.

Since high-order neural networks have stronger approximation property, faster conver- gence rate, greater storage capacity, and higher fault tolerance than lower-order neural networks, they have attracted considerable attention (see, e.g., [1,2,4,5,10,11,13,14]).

In our previous paper [12], we study the global exponential stability and existence of periodic solutions of the following high-order Hopfield-type neural networks

dxi(t)

dt = −ai(t)xi(t) + m j=1

bi j(t)fjxj(t) +

m j=1

bi j(t)fjxjtτi j(t)+ m j=1

m l=1

ei jl(t)fjxj(t)flxl(t) +

m j=1

m l=1

ei jl(t)fjxjtσi jl(t)flxltσi jl(t)+Ii(t),

(1.1)

Copyright©2005 Hindawi Publishing Corporation

Discrete Dynamics in Nature and Society 2005:3 (2005) 281–297 DOI:10.1155/DDNS.2005.281

(2)

wherei=1, 2,...,m,t >0,xi(t) denotes the potential (or voltage) of the celliat timet.

ai(t) are positiveω-periodic functions, they denote the rate with which the cellireset their potential to the resting state when isolated from the other cells and inputs.bi j(t),ei jl(t) are the first-and second-order connection weights of the neural network, respectively;

Ii(t) denote theith component of an external input source introduced from outside the network to the celli.

In [6], Li investigates global stability and existence of periodic solutions of discrete de- layed cellular neural networks. However, few authors have studies the dynamical behav- iors of the discrete-time analogues of delayed high-order Hopfield-type neural networks with variable coefficient. In this paper, we are concerned with the following discrete ana- logue of (1.1) of the form

xi(n+ 1)=eai(n)hxi(n) +θi(h) n j=1

bi j(n)fjxj(n) +θi(h)

n j=1

bi j(n)fj

xj

nτi j(n)+θi(h) n j=1

n l=1

ei jl(n)fj

xj(n)fl

xl(n)

+θi(h) n j=1

n l=1

ei jl(n)fj

xj

nσi jl(n)fl

xl

tσi jl(n) +θi(h)Ii(n), i=1, 2,...,m,

(1.2) in whichθi,ai,bi j,ei jl,i,j,l=1, 2,...,m, will be specified in the next section.

With the help of Mawhin’s continuation theorem of coincidence degree theory and constructing Lyapunov functional, we obtain some sufficient conditions ensure that for the discrete networks (1.2) there exists a unique periodic solution, and all theirs solutions converge to such a periodic solution. To the best of our knowledge, this is the first time to study the existence and global attractivity of the periodic solution for the discrete-time analogues of delayed high-order Hopfield-type neural networks with variable coefficient.

The tree of this paper is as follows. InSection 2, following the semi-discretization tech- nique [6,9], we obtain a discrete-time analogue of (1.1). InSection 3, with the help of Mawhin’s continuation theorem of coincidence degree theory, we study the existence of the periodic solution of (1.2). InSection 4, by constructing Lyapunov functional, we de- rive sufficient conditions to ensure that the periodic solution of (1.2) is globally asymp- totically stable.

2. Discrete-time analogues

There is no unique way of deriving discrete time version of dynamical equations corre- sponding to continuous time formulation. First, following [6,9], we reformulate system (1.1) by an approximation of the form

dxi(t) dt = −ai

t h

h

xi(t) + m j=1

bi j t

h

h

fj

xj t

h

h

+ m j=1

bi j t

h

h

fj

xj t

h

h

τi j t

h

h

(3)

+ m j=1

m l=1

ei jl t

h

h

fj

xj t

h

h

fl

xl t

h

h

+ m j=1

m l=1

ei jl

t h

h

fj

xj

t h

h

σi jl

t h

h

×fl

xl

t h

h

σi jl

t h

h

+Ii

t h

h

,

(2.1)

wherehis a positive number denoting a uniform discretization step size and [t/h] denotes the greatest integer int/h. For convenience, we denote [t/h]=n,nZ0+, andai(nh)= ai(n),bi j(nh)=bi j(n),bi j(nh)=bi j(n),ei jl(nh)=ei jl(n),ei jl(nh)=ei jl(n),τi j(nh)=τi j, σi jl(nh)=σi jl,xi(nh)=xi(n),Ii(nh)=Ii. Thus (2.1) takes on the form

dxi(t)

dt = −ai(n)xi(t) + m j=1

bi j(n)fj

xj(n)

+ m j=1

bi j(n)fj

xj

nτi j(n)

+ m j=1

m l=1

ei jl(n)fj

xj(n)fl xl(n) +

m j=1

m l=1

ei jl(n)fj

xj

nσi jl(n)

×flxlnσi jl(n)+Ii(n), nZ0+.

(2.2)

Integrate it over the interval [nh,t] fort <(n+ 1)hto obtain

xi(t)eai(n)txi(n)eai(n)nh

=eai(n)teai(n)nh ai(n)

m j=1

bi j(n)fj

xj(n)+ m j=1

bi j(n)fj

xj

nτi j(n)

+ m j=1

m l=1

ei jl(n)fj

xj(n)fl

xl(n)

+ m j=1

m l=1

ei jl(n)fj

xj(n)fl

xl(n)fl

xl

nσi jl(n)

+Ii(n)

, i=1, 2,...,m.

(2.3)

(4)

We lett(n+ 1)hand obtain

xi(n+ 1)=xi(n)eai(n)h+θi(h) m j=1

bi j(n)fj

xj(n)

+θi(h) m j=1

bi j(n)fj

xj

nτi j(n)

+θi(h) m j=1

m l=1

ei jl(n)fj

xj(n)fl

xl(n)

+θi(h) m j=1

m l=1

ei jl(n)fj

xj

nσi jl(n)fl

xl

nσi jl(n) +θi(h)Ii(n), i=1, 2,...,m,nZ0+,

(2.4)

where

θi(h)=1eai(n)h

ai(n) , i=1, 2,...,m,nZ0+. (2.5) It is not difficult to verify thatθi(h)>0 ifai,h >0 andθi(h)h+o(h2) for smallh >0.

Also, one can see that (1.2) converges towards (1.1) whenh0+. The system (1.2) is supplemented with initial values given by

xi(s)=ϕi(s), s

τ, 0Z,τ= max

1i,j,lm

maxnZ

τi j(n),σi jl(n). (2.6)

In this paper, we assume that

(H1)ai:Z(0,),bi j,bi j,ei jl,ei jl,IiZR,τi j,σi jl:ZZ0+,i,j,l=1, 2,...,m, h(0,).

(H2) fjare Lipschitzian with Lipschitz constantsLj>0,

fj(x)fj(y)Lj|xy| (2.7)

for anyx,yR, (j∈ {1,...,m}).

(H3) There exist positive constantsNj>0,j∈ {1,...,m}such that

fj(x)Nj, j∈ {1,...,m}. (2.8)

For convenience, we will introduce the notation:

Iω= {0, 1,...,ω1}, u= 1 ω

ω1 k=0

u(k), (2.9)

(5)

whereu(k) anω-perodic sequence of real numbers defined forkZand notations:

ai=min

nIω

ai(n), i=1, 2,...,m, IM=max

nIω

Ii(n),i=1, 2,...,m, M=sup

uR

fj(u), j=1, 2,...,m, bMi j =max

nIω

bi j(n), bMi j =max

nIω

bi j(n) eMi jl=max

nIω

ei jl(n), eMi jl=max

nIωei jl(n).

(2.10)

3. Existence of periodic solution

In this section, based on the Mawhin’s continuation theorem and Lyapunov functional, we will study the existence of periodic solutions of discrete-time high-order Hopfield- type neural networks (1.2).

First, we will make some preparations.

LetXandZbe two Banach spaces. Consider an operator equation

Lx=λNx, λ(0, 1), (3.1)

whereL: DomLXZis a linear operator andλis a parameter. LetPandQdenote two projectors such that

P:XDomL−→KerL, Q:Z−→ Z

ImL. (3.2)

Denote byH: ImQKerLis an isomorphism of ImQonto KerL. In the sequel, we will use the following result of Mawhin [3, page 40].

Lemma3.1. LetX andZbe two Banach spaces andLa Fredholm mapping of index zero.

Assume thatN:ΩZisL-compact onwithopen bounded inX. Furthermore assume:

(a)for eachλ(0, 1),y∂ΩDomL,

Lx=λNx; (3.3)

(b)for eachx∂ΩKerL,

QNx=0, deg{HQNx,ΩKerL, 0} =0. (3.4) Then the equationLx=Nxhas at least one solution indomLΩ.

Recall that a linear mapping L: DomLxZ with KerL=L1(0) and ImL= L(DomL), will be called a Fredholm mapping if the following two conditions hold:

(i) KerLhas a finite dimension;

(ii) ImLis closed and has a finite codimension.

(6)

Recall also that the codimension of ImLis the dimension ofZ/ImL, that is, the di- mension of the cokernel cokerLofL.

WhenLis a Fredholm mapping, its index is the integer IndL=dim kerL-codim ImL.

We will say that a mappingNisL-compact onΩif the mappingQN:ΩZis contin- uous,QN(Ω) is bounded, andKp(IQ)N:ΩY is compact, that is, it is continuous andKp(IQ)N(Ω) is relatively compact, whereKp: ImLDomLKerPis a inverse of the restrictionLpofLto DomLKerP, so thatLKp=IandKpL=IP.

Next, we will state and prove the existence of periodic solutions of system (1.2).

Theorem3.2. Assume that the condition(H1),(H2), and(H3)are satisfied. Furthermore, assume that

(H4)ai,bi j,bi j,ei jl,ei jl,Ii,i,j,l=1, 2,...,m, are allω-periodic functions.

Then system (1.2) has at least oneω-periodic solution.

Proof. Similar to that of [6], we define

lm= x=

x(k):x(k)Rm,kZ. (3.5)

Letlωlmdenote the subspace of allωperiodic sequences equipped with the usual supre- mum norm · , that is,

x =

x1(k),...,xm(k)T

=m

i=1

maxkIω

xi(k), for anyx=

x1(k),...,xm(k):kZlω.

(3.6)

It is not difficult to show thatlωis a finite-dimensional Banach space.

Let

lω0 = x=

x(k)lω:

ω1 k=0

x(k)=0

, lωc =

x=

x(k)lω:x(k)=hRm,kZ,

(3.7)

then it follows thatl0ωandlωc are both closed linear subspaces oflωand

lω=l0ωlωc, dimlωc =m. (3.8)

(7)

In order to useLemma 3.1to system (1.2), we takeX=Y=lω, (Lx)(k)=x(k+ 1)x(k), and let

Nx(n)=

x1(n)ea1(n)h1+θ1(h) m j=1

b1j(n)fjxj(n)+ ...

xm(n)eam(n)h1+θm(h) m j=1

bm j(n)fjxj(n)+ θ1(h)

m j=1

b1j(n)fjxjnτ1j(n)+θ1(h)I1(n) ...

θm(h) m j=1

bm j(n)fjxjnτm j(n)+θm(h)Im(n) +θ1(h)

m j=1

m l=1

e1jl(n)fjxj(n)flxl(n)+ ...

m(h) m j=1

m l=1

em jl(n)fjxj(n)flxl(n)+ θ1(h)

n j=1

n l=1

e1jl(n)fjxjnσ1jl(n)flxltσ1jl(n) ...

θm(h) n j=1

n l=1

em jl(n)fjxjnσm jl(n)flxltσm jl(n)

.

(3.9)

It is trivial to see thatLis a bounded linear operator and

KerL=lωc, ImL=l0ω, (3.10)

as well as

dim KerL=m=codim ImL; (3.11)

then it follows thatLis a Fredholm mapping of index zero.

Define

Px= 1 ω

ω1 s=0

x(s), xX, Qz= 1 ω

ω1 s=0

z(s), zY. (3.12) It is not difficult to show thatPandQare continuous projectors such that

ImP=KerL, ImL=KerQ=Im(IQ). (3.13)

(8)

Furthermore, the generalized inverse (toL)Kp: ImLKerPdomLhas the form

Kp(z)=k 1 s=0

z(s) 1 ω

ω1 s=0

s)z(s). (3.14)

Clearly, QN and Kp(IQ)N are continuous. Since X is a finite-dimensional Banach space, using the Arzela-Ascoli theorem, it is not difficult to show thatQN(Ω),Kp(I Q)N(Ω) are relatively compact for any open bounded setX. Hence,NisL-compact onΩ, hereΩis any open bounded set inX.

Now we reach the position to search for an appropriate open, bounded subsetΩfor the application of the Lemma 3.1. Corresponding to the operator equationLx=λNx, λ(0, 1), we have

xi(n+ 1)xi(n)=λ

xi(n)eai(n)h1+θi(h) m j=1

bi j(n)fj

xj(n)

+θi(h) m j=1

bi j(n)fj

xj

nτi j(n)

+θi(h) m j=1

m l=1

ei jl(n)fj

xj(n)fl

xl(n)

+θi(h) m j=1

m l=1

ei jl(n)fj

xj

nσi jl(n)fl

xl

nσi jl(n)

+θi(h)Ii(n)

, i=1, 2,...,m.

(3.15)

Assume that x(n)=(x1(n),...,xm(n))X is a solution of system (3.15) for some λ (0, 1), from (3.15), we obtain

maxnIω

xi(n)=max

nIω

xi(n+ 1)

1 +λeai(n)h1xi(n)+λθi(h) m j=1

bi j(n)fj

xj(n

+λθi(h) m j=1

bi j(n)fj

xj

nτi j(n)

+λθi(h) m j=1

m l=1

ei jl(n)fj

xj(n)fl

xl(n)

+λθi(h) m j=1

m l=1

ei jl(n)fjxjnσi jl(n)flxlnσi jl(n)+λθi(h)Ii(n)

(9)

1 +λeai(n)h1max

nIω

xi(n)+λθi(h)mbM+λθi(h)mbM +λθi(h)m2eM2+λθi(h)m2eM2+λθi(h)IM, i=1, 2,...,m.

(3.16) Hence,

1eai(n)hmax

nIω

xi(n)

θi(h)mbM+mbM+m2eM2+m2eM 2+IM, i=1, 2,...,m.

(3.17) That is

maxnIω

xi(n)θi(h)mbM+mbM +m2eM2+m2eM2+IM

1eai(n)h :=Ai. (3.18) DenoteA=m

i=1Ai+E, whereEis taken sufficiently large such thatx< A, clearly,A is independent ofλ. Now, we take= {uX:x< A}. It is clear thatΩsatisfies the requirement (a) inLemma 3.1.

Whenx∂ΩKerL,x is a constant vector inRm withx =A. Furthermore, take H: ImQKerL,rr. we can letAbe greater such that

x1,...,xmHQN

x1

... xm

=n

i=1

xi2

ω1 s=0

eai(s)h1 ω

+θi(h)xi

m j=1

bi jfj xj

xi

+θi(h)xi

m j=1

bi jfj xj

xi+θi(h) m j=1

m l=1

ei jlfj xj

fl xl

xi

+θi(h) m j=1

m l=1

ei jlfj

xj

fl

xl

xi+θi(h)Iixi

<0.

(3.19)

So for anyx∂ΩKerL,QNx=0. Furthermore, letΨ(r;u)= −rx+ (1r)JQNx, then for anyx∂ΩKerL,xTΨ(r;x)<0, we get

deg{HQNx,KerL, 0} =deg{−x,KerL, 0} =0. (3.20) Condition (b) ofLemma 3.1is also satisfied. By now we have prove that Ωsatisfies all the requirements inLemma 3.1. Hence, system (1.2) has at least oneω-periodic solution.

The proof is complete.

4. Global stability of the periodic solution

In this section, we will obtain sufficient conditions for the global asymptotic stability and global exponential stability of the periodic solution of discrete high-order Hopfield-type networks (1.2).

(10)

Theorem4.1. Assume that condition(H1),(H2),(H3), and(H4)are satisfied. Further- more, assume thatτi j(n)=τi jZ+i jl(n)=σi jlZ+, and

(H5)There exists a positive real number sequenceαisuch that λi=αi

1eaiLi

m j=1

αjθj(h)bMji Li

m j=1

αjθj(h)bMji Li

m j=1

m l=1

αjθj(h)eMjilM

Li

m j=1

m l=1

αjθj(h)eMjilMLi

m j=1

m l=1

αjθj(h)eMjliM

Li

m j=1

m l=1

αjθj(h)eMjliM >0, i=1, 2,...,m.

(4.1)

Then theω-periodic solution of (1.2) is unique and all other solutions of (1.2) converges to its uniqueω-periodic solutions.

Proof. According toTheorem 3.2, we know that (1.2) has aω-periodic solutionx(n)= (x1(n),x2(n),...,xm(n))T. Obviously, if this periodic solution is globally attractivity, then it is unique. Letx(n)=(x1(n),x2(n),...,xm(n))T is an arbitrary solution of (1.2) and let

xi(n+ 1)xi(n+ 1)= −eai(n)hxi(n)xi(n) +θi(h)

m j=1

bi j(n)fj

xj(n)fj

xj(n)

+θi(h) m j=1

bi j(n)fj

xj

nτi j

fj

xjnτi j

+θi(h) m j=1

m l=1

ei jl(n)fj

xj(n)fl

xl(n)fj

xj(n)fl

xl (n)

+θi(h) m j=1

m l=1

ei jl(n)fj

xj

nσi jl

fl

xl

nσi jl

+fjxjnσi jlflxlnσi jl, i=1, 2,...,m.

(4.2) Hence,

xi(n+ 1)xi (n+ 1)

≤ −eaixi(n)xi(n) +θi(h)

m j=1

bMi jLjxj(n)xj(n) +θi(h)

m j=1

bMi jLjxjnτi jxjnτi j

参照

関連したドキュメント