Scholarlink

<p>This paper investigates the finite-time stability (FTS) characteristics of a discrete generalized Gray–Scott reaction–diffusion system (GS-RDs). In contrast to most existing studies, which establish only asymptotic or exponential stability, we derive verifiable conditions that guarantee the global stabilization of the system’s unique equilibrium point (EP) within a finite number of discrete time steps. By constructing suitable Lyapunov functions (LFs) and combining summation-by-parts formulas with eigenvalue estimates, an explicit closed-form upper bound on the settling time (ST) is obtained. The sharpness of this analytical bound is validated via numerical simulations on a master–slave configuration, for which the system converges precisely within 29 steps, demonstrating exact agreement with the theoretical prediction. The novelty of this work resides in providing a rigorous framework for FTS in discrete RDs, thereby bridging the gap between continuous-time theory and discrete models. Moreover, the proposed methodology extends naturally to synchronization problems. These contributions advance the state of the art in stability analysis of RDs and broaden the applicability of FTS techniques to chemical, biological, and complex networked systems.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Guaranteed finite-time convergence in discrete generalized Gray–Scott reaction–diffusion system

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年7月23日

查看全文
  • Iqbal Jebril

摘要

This paper investigates the finite-time stability (FTS) characteristics of a discrete generalized Gray–Scott reaction–diffusion system (GS-RDs). In contrast to most existing studies, which establish only asymptotic or exponential stability, we derive verifiable conditions that guarantee the global stabilization of the system’s unique equilibrium point (EP) within a finite number of discrete time steps. By constructing suitable Lyapunov functions (LFs) and combining summation-by-parts formulas with eigenvalue estimates, an explicit closed-form upper bound on the settling time (ST) is obtained. The sharpness of this analytical bound is validated via numerical simulations on a master–slave configuration, for which the system converges precisely within 29 steps, demonstrating exact agreement with the theoretical prediction. The novelty of this work resides in providing a rigorous framework for FTS in discrete RDs, thereby bridging the gap between continuous-time theory and discrete models. Moreover, the proposed methodology extends naturally to synchronization problems. These contributions advance the state of the art in stability analysis of RDs and broaden the applicability of FTS techniques to chemical, biological, and complex networked systems.