IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v223y2024icp601-616.html
   My bibliography  Save this article

Low conservative stability criteria for discrete-time Lur’e systems with sector and slope constrained nonlinearities

Author

Listed:
  • Yang, Hanhua
  • Yan, Mengqing
  • Duan, Wenyong
  • Chen, Chong

Abstract

Lur’e system is an important nonlinear system in engineering, which is composed of a feedback connection of a linear dynamic system and a nonlinear system that satisfies the sector constraint. In this paper, for nominal and uncertain discrete Lur’e systems with time-varying delays, the absolute and robustly absolute stability are studied in detail with the nonlinearity satisfying the sector and slope constraints. Firstly, an augmented Lyapunov–Krasovskii functional (LKF) is designed, in which some augmented vectors are selected to increase the coupling information between the delay intervals and other system state variables. At the same time, some effective integral terms of nonlinear state variables are extended in the LKF according to the characteristics of sector constraint and slope constraint. Secondly, a general lemma of summation inequality for free-weighted matrices is given, which adds some coupling information between vectors and extends the search range for solving linear matrix inequalities (LMIs). Thirdly, by synthesizing the general summation inequality and the newly constructed LKF, different absolute stability criteria are derived respectively, and the absolute stability criteria are extended to robustly absolute stability cases with uncertain parameters. The stability criteria reduce the conservatism of some previously proposed results. Finally, some common numerical examples and simulations are used to verify the results of this paper.

Suggested Citation

  • Yang, Hanhua & Yan, Mengqing & Duan, Wenyong & Chen, Chong, 2024. "Low conservative stability criteria for discrete-time Lur’e systems with sector and slope constrained nonlinearities," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 223(C), pages 601-616.
  • Handle: RePEc:eee:matcom:v:223:y:2024:i:c:p:601-616
    DOI: 10.1016/j.matcom.2024.04.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424001630
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2024.04.037?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:matcom:v:223:y:2024:i:c:p:601-616. 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: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.