Computing bounds for the mixed μ problem

doi:10.1002/rnc.4590050604

Computing bounds for the mixed μ problem

2007-03-07

0

PRE

AI

DOI：10.1002/rnc.4590050604

原文链接

原文求助

摘要

En 中文

AbstractRobustness problems involving real parametric uncertainty can be reformulated as mixed μ problems, where the block‐structured uncertainty description is allowed to contain both real and complex blocks. Upper and lower bounds for the mixed μ problem have recently been developed, and this paper examines the computational aspects of these bounds. In particular a practical algorithm is developed to compute the bounds. This has been implemented as a Matlab function (m‐file), which is currently available in conjunction with the μ‐Tools toolbox. Some results from our extensive numerical experience with the algorithm are presented. The algorithm performance is very encouraging, in terms both of accuracy of the resulting bounds, and of growth rate in required computation with problem size. In particular it appears that one can handle medium‐size problems (fewer than 100 perturbations) with reasonable computational requirements.

Computing bounds for the mixed μ problem

摘要

AI总结

期刊

机构

引用论文