Young, Peter M. | Engineering Papers

NASA NTRS1992

Practical computation of the mixed mu problem

The computational aspects of the recently developed upper and lower bounds for the mixed mu problem are examined. In particular, a practical algorithm is developed to compute the bounds. This has been implemented as a Matlab function (m-file) and will be available in a test version in conjunction with the mu-Tools toolbox. The algorithm performance is very encouraging, in terms of both accuracy of the resulting bounds and growth rate in required computation with problem size. In particular, it appears that one can handle medium-size problems (less than 100 perturbations) with reasonable computational requirements.

Young, Peter M.↗

NASA NTRS1991

mu analysis with real parametric uncertainty

The authors give a broad overview, from a LFT (linear fractional transformation)/mu perspective, of some of the theoretical and practical issues associated with robustness in the presence of real parametric uncertainty, with a focus on computation. Recent results on the properties of mu in the mixed case are reviewed, including issues of NP completeness, continuity, computation of bounds, the equivalence of mu and its bounds, and some direct comparisons with Kharitonov-type analysis methods. In addition, some advances in the computational aspects of the problem, including a novel branch and bound algorithm, are briefly presented together with numerical results. The results suggest that while the mixed mu problem may have inherently combinatoric worst-case behavior, practical algorithms with modest computational requirements can be developed for problems of medium size (less than 100 parameters) that are of engineering interest.

Young, Peter M.↗