COMPUTATIONAL-COMPLEXITY OF MU-CALCULATION

被引：248

作者：

BRAATZ, RP ^{[1
]}

YOUNG, PM ^{[1
]}

DOYLE, JC ^{[1
]}

MORARI, M ^{[1
]}

机构：

[1] CALTECH,DEPT ELECT ENGN,PASADENA,CA 91125

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 1994年 / 39卷 / 05期

关键词：

D O I：

10.1109/9.284879

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1000 / 1002

页数：3

共 10 条

[1]

CHEN J, 1991, CONTROL SYSTEMS INEX, P15

[2]

Dorato P., 1990, RECENT ADV ROBUST CO

[3] ANALYSIS OF FEEDBACK-SYSTEMS WITH STRUCTURED UNCERTAINTIES [J].