A study of the gap between the structured singular value and its convex upper bound for low-rank matrices

The size of the smallest structured destabilizing perturbation for a linear time-invariant system can be calculated via the structured singular value (/spl mu/). The function /spl mu/ can be bounded above by the solution of a convex optimization problem, and in general there is a gap between /spl mu/ and the convex bound. This paper gives an alternative characterization of /spl mu/ which is used to study this gap for low-rank matrices. The low-rank characterization provides an easily computed bound which can potentially be significantly better than the standard convex bound. This is used to find new examples with larger gaps than previously known.

[1]  John C. Doyle.  Analysis of Feedback Systems with Structured Uncertainty , 1982 .

[2]  A. Megretski.  On the gap between structured singular values and their upper bounds , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[3]  Stephen P. Boyd,et al.  Control System Analysis and Synthesis via Linear Matrix Inequalities , 1993, 1993 American Control Conference.

[4]  A. L. Tits,et al.  m-form numerical range and the computation of the structured singular value , 1988 .

[5]  Andrew Packard,et al.  The complex structured singular value , 1993, Autom..

[6]  H. Ozbay,et al.  On the /spl Nscr//spl Pscr/-hardness of the purely complex /spl mu/ computation, analysis/synthesis, and some related problems in multidimensional systems , 1995, Proceedings of 1995 American Control Conference - ACC'95.

[7]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[8]  Carolyn L. Beck,et al.  Mixed mu upper bound computation , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[9]  J. Doyle,et al.  Minimizing Conservativeness of Robustness Singular Values , 1984 .