Abstract
We revisit the robust performance analysis problem for structured uncertainties whose frequency responses lie in the rather general class of diagonal matrices with blocks that are full ellipsoidal or repeated and contained in intersections of disks or circles or that are located in finitely generated convex sets. Based on the full block S-procedure we suggested LMI relaxations to verify robust performance. Our main purpose is to prove a general computationally verifiable condition for when these relaxations do not involve any conservatism. This allows to show the general exactness of the suggested relaxations for small block-structures, comprising an elementary proof for the structured singular value being exactly computable by convex optimization for three full complex blocks.
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.
