Abstract
This paper derives the bounded real lemmas corresponding to L ∞ norm and H ∞ norm (L-BR and H-BR) of fractional order systems. The lemmas reduce the original computations of norms into linear matrix inequality (LMI) problems, which can be performed in a computationally efficient fashion. This convex relaxation is enlightened from the generalized Kalman-Yakubovich-Popov (KYP) lemma and brings no conservatism to the L-BR. Meanwhile, an H-BR is developed similarly but with some conservatism. However, it can test the system stability automatically in addition to the norm computation, which is of fundamental importance for system analysis. From this advantage, we further address the synthesis problem of H ∞ control for fractional order systems in the form of LMI. Three illustrative examples are given to show the effectiveness of our methods.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
