Calculation of the Structured Singular Value with a Reduced Number of Optimization Variables

Abstract

Optimal scaling techniques have become widely accepted tools in the analysis and design of systems in the presence of uncertainties. Among these are the block similarity scaling techniques, the so-called structured singular introduced by Doyle, which has been shown to apply to general block uncertainties. For the special case of an n × n uncertainty matrix with n2 nonzero 1 × 1 blocks, the singular value technique with similarity scaling suffers from the disadvantage of having to expand an n × n matrix problem to an n2 × n2 matrix optimization problem with n2 - 1 free variables. For this same class of uncertainties with scalar blocks, an alternative approach proposed by Kouvaritakis and Latchman employs a nonsimilarity scaling technique which preserves the original matrix dimension (n × n) and requires only 2(n - l) optimization parameters. The aim of this paper is to show that for scalar block uncertainties, the structure of the problem may be exploited to yield a similarity scaling method which uses no more than 2(n - 1) rather than n2 - 1 optimization parameters. A simple extension of this result shows that a reduction in the number of free variables is also possible for general block uncertainties. A more efficient implementation of the vector optimization method developed by Fan and Tits is also proposed. Several examples are included to illustrate the results.