Computational Complexity of Robust Schur Stability Analysis by the Generalized Stability Feeler

被引：0

作者：

Matsuda, Tadasuke ^{[1
]}

Matsui, Hajime ^{[2
]}

Kawanishi, Michihiro ^{[2
]}

Narikiyo, Tatsuo ^{[2
]}

机构：

[1] Tokyo Univ Sci, Dept Elect Engn, Fac Engn Div 2, Tokyo 162, Japan

[2] Toyota Technol Inst, Nagoya, Aichi 468, Japan

来源：

2014 4TH AUSTRALIAN CONTROL CONFERENCE (AUCC) | 2014年

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

The paper gives the computational complexity of the robust Schur stability analysis by the generalized stability feeler. Computational complexity of robust stability analysis is considered as an important characteristic to evaluate robust stability analysis methods. We derive the computational complexity from the algorithm of the generalized stability feeler. The result shows that the robust Schur stability can be checked in polynomial time.

引用

页码：55 / 59

页数：5

共 10 条

[1] Barmish B.R., 1994, New tools for robustness of linear systems
[2] Bhattacharyya S. P., 1995, Robust control: the parametric approach
[3] A survey of computational complexity results in systems and control
Blondel, VD
Tsitsiklis, JN
[J]. AUTOMATICA, 2000, 36 (09) : 1249 - 1274
[4] COMPUTATIONAL-COMPLEXITY OF MU-CALCULATION
BRAATZ, RP
YOUNG, PM
DOYLE, JC
MORARI, M
[J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1994, 39 (05) : 1000 - 1002
[5] Cox D., 1997, Ideals, Varieties, and Algorithms
[6] Hildebrand F. B., 1987, Introduction to Numerical Analysis
[7] Matsuda T., 2011, 18 IFAC WORLD C, p11 368
[8] Matsuda T., 2014, P SICE MULT CONTR SY
[9] Matsuda T., 2010, INT J COMPUTATIONAL, V2, P59
[10] TEMPO R, 1991, PROCEEDINGS OF THE 30TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-3, P2103, DOI 10.1109/CDC.1991.261507

← 1 →