Properties of the mixed μ problem and its bounds

Upper and lower bounds for the mixed mu problem have recently been developed, and here we examine the relationship of these bounds to each other and to mu. A number of interesting properties are developed and the implications of these properties for the robustness analysis of linear systems and the...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 1996, Vol.41 (1), p.155-159
Main Authors: YOUNG, P. M, DOYLE, J. C
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Control theory. Systems
Exact sciences and technology
System theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Upper and lower bounds for the mixed mu problem have recently been developed, and here we examine the relationship of these bounds to each other and to mu. 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 mu 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 mu and "Kharitonov-type" analysis methods
ISSN:0018-9286
1558-2523
DOI:10.1109/9.481624