Computation of the real structured singular value via pole migration

Summary The paper introduces a new computationally efficient algorithm to determine a lower bound on the real structured singular value μ. The algorithm is based on a pole migration approach where an optimization solver is used to compute a lower bound on real μ independent of a frequency sweep. A distinguishing feature of this algorithm from other frequency independent one-shot tests is that multiple localized optima (if they exist) are identified and returned from the search. This is achieved by using a number of alternative methods to generate different initial conditions from which the optimization solver can initiate its search from. The pole migration algorithm presented has also been extended to determine lower bounds for complex parametric uncertainties as well as full complex blocks. However, the results presented are for strictly real and repeated parametric uncertainty problems as this class of problem is the focus of this paper and are in general the most difficult to solve. Copyright © 2014 John Wiley & Sons, Ltd.