Please use this identifier to cite or link to this item: https://doi.org/10.1109/TCSI.2005.853940
Title: Global convergence of Lotka-Volterra recurrent neural networks with delays
Authors: Yi, Z.
Tan, K.K. 
Keywords: Delay
Global convergence
Lotka-Volterra recurrent neural networks
Issue Date: Nov-2005
Source: Yi, Z., Tan, K.K. (2005-11). Global convergence of Lotka-Volterra recurrent neural networks with delays. IEEE Transactions on Circuits and Systems I: Regular Papers 52 (11) : 2482-2489. ScholarBank@NUS Repository. https://doi.org/10.1109/TCSI.2005.853940
Abstract: Recurrent neural networks of the Lotka-Volterra model have been proven to possess characteristics which are desirable in some neural computations. A clear understanding of the dynamical properties of a recurrent neural network is necessary for efficient applications of the network. This paper studies the global convergence of general Lotka-Volterra recurrent neural networks with variable delays. The contributions of this paper are: 1) sufficient conditions are established for lower positive boundedness of the networks; 2) global exponential stability conditions are obtained for the networks. These conditions are totally independent of the variable delays which are therefore allowed to be uncertain; 3) novel Lyapunov functionals are constructed to establish delays dependent conditions for global asymptotic stability, and 4) simulation results and examples are provided to supplement and illustrate the theoretical contributions presented. © 2005 IEEE.
Source Title: IEEE Transactions on Circuits and Systems I: Regular Papers
URI: http://scholarbank.nus.edu.sg/handle/10635/56147
ISSN: 10577122
DOI: 10.1109/TCSI.2005.853940
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

22
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

19
checked on Nov 22, 2017

Page view(s)

27
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.