抄録
Robust stability and performance analysis are reduced to the computation of a structured singular value problem. However its computation is a difficult task and forms a bottleneck of the analysis because it is based on the numerical optimization. We show that this computational burden can be reduced in the case where the matrix under consideration is symmetric. In this case, the computation is equivalent to the maximization of spectral radius over (S+w-1)-parameters, where S is the number of the repeated scalar blocks and w is the total size of full blocks.
