Abstract
In [IEEE Trans Circ Syst II 2005;52(4):181–4], a criterion for the global asymptotic stability of a class of delayed neural networks has been presented. The criterion is based on the factorization B = B1B2, where B denotes the delayed connection weight matrix. In the present paper, this criterion is compared with the criterion reported in [Phys Lett A 2003;311(6):504–11]. It turns out that, as far as the case of a nonsingular matrix B1 is concerned, these two criteria are one and the same.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
