IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v467y2024ics0096300323006690.html
   My bibliography  Save this article

Nonseparation analysis-based finite/fixed-time synchronization of fully complex-valued impulsive dynamical networks

Author

Listed:
  • Xiong, Kailong
  • Yu, Juan
  • Hu, Cheng
  • Wen, Shiping
  • Kong, Fanchao

Abstract

In this article, the impulsive effect is introduced into complex-variable networks (CO-VNs) and the finite/fixed-time synchronization (FI-T/FX-TS) of fully CO-VNs is discussed without using the classical decomposition approach. First of all, by applying the comparison principle, mathematical induction and the optimization method, two theorems are established to realize FI/FX-T stability of impulsive systems, and the estimated convergence time derived is more accurate. Furthermore, under the vector-valued signum function and different forms of norms in the complex field, several complex-valued control protocols are directly designed to realize synchronization. Besides, some effective conditions for FI/FX-TS are derived under the improved FI/FX-T stability results, which are simpler and easier to be verified than the previous decomposition results. To conclude, three numerical examples are provided to verify the obtained theoretical results.

Suggested Citation

  • Xiong, Kailong & Yu, Juan & Hu, Cheng & Wen, Shiping & Kong, Fanchao, 2024. "Nonseparation analysis-based finite/fixed-time synchronization of fully complex-valued impulsive dynamical networks," Applied Mathematics and Computation, Elsevier, vol. 467(C).
    • Handle: RePEc:eee:apmaco:v:467:y:2024:i:c:s0096300323006690
    DOI: 10.1016/j.amc.2023.128500
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323006690
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128500?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:467:y:2024:i:c:s0096300323006690. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.