Abstract

The strictly positive real (SPR) lemma for discrete-time descriptor systems is addressed. The relationship between strict positive realness and bounded realness (BR) of transfer matrices for such systems is developed. Based on this development, an LMI-based necessary and sufficient condition for a descriptor system being admissible and simultaneously SPR is established.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.