Finite-time boundedness analysis of a class of neutral type neural networks with time delays

14Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, the finite time boundedness (FTB) for certain and uncertain neutral type neural networks are investigated. The concept of FTB for time delay system is extended first. Then, based on the Lyapunov stability theory and linear matrix inequality (LMI) technique, some sufficient conditions are derived to guarantee FTB, and our results are less conservative than exiting results. Finally, some examples are given to demonstrate the effectiveness and improvement of the proposed results. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, J., Jian, J., & Yan, P. (2009). Finite-time boundedness analysis of a class of neutral type neural networks with time delays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5551 LNCS, pp. 395–404). https://doi.org/10.1007/978-3-642-01507-6_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free