Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 1993 | Published
Book Section - Chapter Open

Computational complexity of μ calculation


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 (237.9 kB)
Name Size Download all
237.9 kB Preview Download

Additional details

August 20, 2023
October 20, 2023