On synchronization of coupled neural networks with discrete and unbounded distributed delays

Authors: Liu, Yurong1; Wang, Zidong2; Liu, Xiaohui2

Source: International Journal of Computer Mathematics, Volume 85, Number 8, August 2008 , pp. 1299-1313(15)

Publisher: Taylor and Francis Ltd

Buy & download fulltext article:

OR

Price: $56.94 plus tax (Refund Policy)

Abstract:

In this paper, we deal with the synchronization problem for an array of linearly coupled neural networks with simultaneous presence of both the discrete and unbounded distributed time-delays. By utilizing a novel Lyapunov-Krasovskii functional and the Kronecker product, it is shown that the addressed synchronization problem is solvable if several linear matrix inequalities (LMIs) are feasible. Hence, different from the commonly used matrix norm theories (such as the M-matrix method), a unified LMI approach is developed to establish sufficient conditions for the coupled neural networks to be globally synchronized, where the LMIs can be easily solved by using the Matlab LMI toolbox and no tuning of parameters is required. It is also shown that the synchronization of coupled neural networks with bounded distributed delays is just a special case of our main results. A numerical example is provided to show the usefulness of the proposed global synchronization condition.

Keywords: synchronization; neural networks; discrete time-delay; distributed time-delay; linear matrix inequality

Document Type: Research article

DOI: http://dx.doi.org/10.1080/00207160701636436

Affiliations: 1: Department of Mathematics, Yangzhou University, Yangzhou, P. R. China 2: Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex

Publication date: 2008-08-01

More about this publication?
Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page