Computational complexity of μ calculation

The structured singular value mu measures the robustness of uncertain systems. Numerous researchers over the last decade have worked on developing efficient methods for computing mu. This paper considers the complexity of calculating mu with general mixed real/complex uncertainty in the framework of...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 1994-05, Vol.39 (5), p.1000-1002
Main Authors: BRAATZ, R. P, YOUNG, P. M, DOYLE, J. C, MORARI, M
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Control system analysis
Control theory. Systems
Exact sciences and technology
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:The structured singular value mu measures the robustness of uncertain systems. Numerous researchers over the last decade have worked on developing efficient methods for computing mu. This paper considers the complexity of calculating mu with general mixed real/complex uncertainty in the framework of combinatorial complexity theory. In particular, it is proved that the mu recognition problem with either pure real or mixed real/complex uncertainty is NP-hard. This strongly suggests that it is futile to pursue exact methods for calculating mu of general systems with pure real or mixed uncertainty for other than small problems
ISSN:0018-9286
1558-2523
DOI:10.1109/9.284879