Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Alternate Admissibility LMI Criteria for Descriptor Fractional Order Systems with 0 < α < 2

Version 1 : Received: 25 June 2023 / Approved: 26 June 2023 / Online: 27 June 2023 (07:55:03 CEST)

A peer-reviewed article of this Preprint also exists.

Di, Y.; Zhang, J.-X.; Zhang, X. Alternate Admissibility LMI Criteria for Descriptor Fractional Order Systems with 0 < α < 2. Fractal Fract. 2023, 7, 577. Di, Y.; Zhang, J.-X.; Zhang, X. Alternate Admissibility LMI Criteria for Descriptor Fractional Order Systems with 0 &lt; &alpha; &lt; 2. Fractal Fract. 2023, 7, 577.

Abstract

The paper focuses on the admissibility problem of descriptor fractional-order systems (DFOSs). The alternate admissibility criteria are addressed for DFOSs with order in (0,2) which involve a non-strict linear matrix inequality (LMI) method and a strict LMI method, respectively. The forms of non-strict and strict LMIs are brand-new and distinguished with the existing literature, which fill the gaps of studies for admissibility. These approaches are available to the order in (0,2) without separating the order ranges into (0,1) and [1,2). In addition, a method involved least real decision variables in terms of strict LMIs is derived which is more convenient to process the practical solution. Three numerical examples are given to illustrate the validity of proposed results.

Keywords

descriptor fractional order systems; admissibility; unified criterion; linear matrix inequality

Subject

Engineering, Automotive Engineering

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.