Published June 1993
| Published
Book Section - Chapter
Open
Computational complexity of μ calculation
Abstract
The structured singular value μ measures the robustness of uncertain Systems. Numerous researchers over the last decade have worked on developing efficient methods for computing μ. This paper considers the complexity of calculating μ with general mixed real/complex uncertainty in the framework of combinatorial complexity theory. In particular, it is proved that the μ 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 μ of general systems with pure real or mixed uncertainty for other than small problems.
Additional Information
© 1993 IEEE. Supported by the Fannie and John Hertz Foundation The authors thank Professor John Tsitsiklis at MIT for his comments.Attached Files
Published - 04793162.pdf
Files
04793162.pdf
Files
(237.9 kB)
Name | Size | Download all |
---|---|---|
md5:55b956be74e29ea28432ab0006190deb
|
237.9 kB | Preview Download |
Additional details
- Eprint ID
- 93998
- Resolver ID
- CaltechAUTHORS:20190320-132001216
- Fannie and John Hertz Foundation
- Created
-
2019-03-20Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field