IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i24p3891-d1540730.html
   My bibliography  Save this article

A New Varying-Factor Finite-Time Recurrent Neural Network to Solve the Time-Varying Sylvester Equation Online

Author

Listed:
  • Haoming Tan

    (School of Electric and Electronic Enginnering, Shanghai University of Engineering Science, Shanghai 201620, China)

  • Junyun Wu

    (School of Mathematics and Computer Sciences, Nanchang University, Nanchang 330031, China
    Jiangxi Provincial Key Laboratory of Intelligent Systems and Human-Machine Interaction, Nanchang 330031, China)

  • Hongjie Guan

    (School of Information Engineering, Nanchang University, Nanchang 330031, China)

  • Zhijun Zhang

    (School of Automation Science and Engineering, South China University of Technology, Guangzhou 510640, China)

  • Ling Tao

    (Jiangxi Provincial Key Laboratory of Intelligent Systems and Human-Machine Interaction, Nanchang 330031, China
    School of Information Engineering, Nanchang University, Nanchang 330031, China)

  • Qingmin Zhao

    (Jiangxi Provincial Key Laboratory of Intelligent Systems and Human-Machine Interaction, Nanchang 330031, China
    School of Information Engineering, Nanchang University, Nanchang 330031, China)

  • Chunquan Li

    (Jiangxi Provincial Key Laboratory of Intelligent Systems and Human-Machine Interaction, Nanchang 330031, China
    School of Information Engineering, Nanchang University, Nanchang 330031, China)

Abstract

This paper presents a varying-parameter finite-time recurrent neural network, called a varying-factor finite-time recurrent neural network (VFFTRNN), which is able to solve the solution of the time-varying Sylvester equation online. The proposed neural network makes the matrix coefficients vary with time and can achieve convergence in a finite time. Apart from this, the performance of the network is better than traditional networks in terms of robustness. It is theoretically proved that the proposed neural network has super-exponential convergence performance. Simulation results demonstrate that this neural network has faster convergence speed and better robustness than the return to zero neural networks and can track the theoretical solution of the time-varying Sylvester equation effectively.

Suggested Citation

  • Haoming Tan & Junyun Wu & Hongjie Guan & Zhijun Zhang & Ling Tao & Qingmin Zhao & Chunquan Li, 2024. "A New Varying-Factor Finite-Time Recurrent Neural Network to Solve the Time-Varying Sylvester Equation Online," Mathematics, MDPI, vol. 12(24), pages 1-22, December.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:24:p:3891-:d:1540730
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/24/3891/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/24/3891/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:12:y:2024:i:24:p:3891-:d:1540730. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.