Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
This paper investigates the fixed-time synchronization problem of memristive neural networks with time-varying delays by proposing a novel fixed-time stability theorem. Compared with existing results such as Lemmas 2.3 and 2.4, the proposed theorem provides a tighter upper bound estimate of the settling time, making the calculated convergence time closer to the actual evolution process of the system. Furthermore, the theorem removes the parameter constraints inherent in Lemma 2.5, thereby offering broader applicability. Based on the derived criteria, the influence of power function coefficients on the actual convergence rate is explored in detail. Finally, numerical simulations are provided to demonstrate the effectiveness and superiority of the theoretical results.
This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)
Comments on this article