Young, Peter M. and Doyle, John C. (1996) Properties of the mixed μ problem and its bounds. IEEE Transactions on Automatic Control, 41 (1). pp. 155-159. ISSN 0018-9286 http://resolver.caltech.edu/CaltechAUTHORS:YOUieeetac96
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:YOUieeetac96
Upper and lower bounds for the mixed μ problem have recently been developed, and here we examine the relationship of these bounds to each other and to μ. A number of interesting properties are developed and the implications of these properties for the robustness analysis of linear systems and the development of practical computation schemes are discussed. In particular we find that current techniques can only guarantee easy computation for large problems when μ equals its upper bound, and computational complexity results prohibit this possibility for general problems. In this context we present some special cases where computation is easy and make some direct comparisons between mixed μ and “Kharitonov-type” analysis methods.
|Additional Information:||© Copyright 1996 IEEE. Reprinted with permission. Manuscript received January 14, 1994; revised January 10, 1995.|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||05 Jan 2007|
|Last Modified:||26 Dec 2012 09:28|
Repository Staff Only: item control page