AI帮你理解科学
AI 生成解读视频
AI抽取解析论文重点内容自动生成视频
生成解读视频
AI 溯源
AI解析本论文相关学术脉络
AI 精读
AI抽取本论文的概要总结
微博一下：
Computational complexity of μ calculation
Automatic Control, IEEE Transactions , no. 5 (1994): 1000-1002
EI WOS
摘要
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 partic...更多
代码：
数据：
简介
- Robust stability and performance anlysis with real parametric and dynamic uncertainties can be naturally formuated as a structured sinular valu(orj problem,where the bloc structured unertainty de thon is algoW to contain both reel and complex blocks
- It iass that the reader is familar with this type of robustne analyse, as space constraints preclude c this her For a collection of papers desseceri[b3i]ngantdhetheenrgenrenecigmcooattaiinod and the within.
重点内容
- Robust stability and performance anlysis with real parametric and dynamic uncertainties can be naturally formuated as a structured sinular valu(orj problem,where the bloc structured unertainty de thon is algoW to contain both reel and complex blocks
- It iass that the reader is familar with this type of robustne analyse, as space constraints preclude c this her For a collection of papers desseceri[b3i]ngantdhetheenrgenrenecigmcooattaiinod and the within
- We show that thisir ti problem is NP-had, ie. at leas - had - the NP-complete
- It is important to note computed m polynomial th being NP-complee is a property of the poblem itelf, not of any particular aith The fact that the mi p problem is NP-hard strongly est, any algorithm to compute p, there will be probl for which the algo rithm cannot find The terminolo theoaf cnompuinttpoiloyanomcoimapllteixmiet.y theory is used extensively in this pap
- First we show that indefinite quadratic programmingt can be cast as a p problem of "roughly" the same siz
结论
- TheTmain resls srongly xugges that it is futile to p e xct mh e aulatm#gojmal systems with pue real or mixed poaellxytawl tha a ei p m In pa real l, one s d not at
Tniznda w kh that p eacty hs results do not mean, artlnwoet e Practical algthms for other
NP-hard - exis _, b y ~ .
hranch-and-hwxmin, .eor local e hf5, stonlysggest that a ammiatadtee rets fYoungeta techniques whic taes iInItIo account the structure of which aoximatesp the p c polynomial
In poblem cal time for typical yield an algonthm problems.
The anthors thank Profeor John Tsitsikiis at MIT for his comments.
RePerences [1]J.
标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果，我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问，可以通过电子邮件方式联系我们：report@aminer.cn