Papers
Topics
Authors
Recent
Search
2000 character limit reached

Structured Singular Value of a Repeated Complex Full-Block Uncertainty

Published 11 Nov 2022 in eess.SY, cs.SY, and math.OC | (2211.05929v3)

Abstract: The structured singular value (SSV), or mu, is used to assess the robust stability and performance of an uncertain linear time-invariant system. Existing algorithms compute upper and lower bounds on the SSV for structured uncertainties that contain repeated (real or complex) scalars and/or non-repeated complex full blocks. This paper presents algorithms to compute bounds on the SSV for the case of repeated complex full blocks. This specific class of uncertainty is relevant for the input output analysis of many convective systems, such as fluid flows. Specifically, we present a power iteration to compute a lower bound on SSV for the case of repeated complex full blocks. This generalizes existing power iterations for repeated complex scalar and non-repeated complex full blocks. The upper bound can be formulated as a semi-definite program (SDP), which we solve using a standard interior-point method to compute optimal scaling matrices associated with the repeated full blocks. Our implementation of the method only requires gradient information, which improves the computational efficiency of the method. Finally, we test our proposed algorithms on an example model of incompressible fluid flow. The proposed methods provide less conservative bounds as compared to prior results, which ignore the repeated full block structure.

Citations (7)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.