Abstract

This article is concerned with the investigation of finite-time boundedness and exponential (Q,S,R)-dissipative performance for a class of discretized competitive neural networks (CNNs) with time-varying delays. Initially, by employing the semi-discretization technique, a discrete analog of the continuous-time CNNs is formulated, which preserves the dynamical behaviors of their continuous-time counterpart. An appropriate state estimator is developed for the discretized CNNs so that the dynamics of the associated estimation error system attain finite-time exponential (Q,S,R)-dissipative performance. Further, to obtain a tighter summation bound, two novel weighted summation inequalities are proposed, which linearize the quadratic summable terms occurring in the finite difference of the considered Lyapunov–Krasovskii functional. Finally, to refine our prediction, an illustrative example is provided that demonstrates the sustainability and merits of the proposed method.

Full Text
Paper version not known

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 call

Disclaimer: 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.