Further Results on Exponentially Robust Stability of Uncertain Connection Weights of Neutral-Type Recurrent Neural Networks

Wenxiao Si, Tao Xie, Biwen Li and Yue Song

Complexity, 2021, vol. 2021, 1-15

Abstract: Further results on the robustness of the global exponential stability of recurrent neural network with piecewise constant arguments and neutral terms (NPRNN) subject to uncertain connection weights are presented in this paper. Estimating the upper bounds of the two categories of interference factors and establishing a measuring mechanism for uncertain dual connection weights are the core tasks and challenges. Hence, on the one hand, the new sufficient criteria for the upper bounds of neutral terms and piecewise arguments to guarantee the global exponential stability of NPRNN are provided. On the other hand, the allowed enclosed region of dual connection weights is characterized by a four-variable transcendental equation based on the preceding stable NPRNN. In this way, two interference factors and dual uncertain connection weights are mutually restricted in the model of parameter-uncertainty NPRNN, which leads to a dynamic evolution relationship. Finally, the numerical simulation comparisons with stable and unstable cases are provided to verify the effectiveness of the deduced results.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/6941701.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/6941701.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6941701

DOI: 10.1155/2021/6941701

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().