AN ALGORITHM FOR COMPUTING THE DISTANCE TO UNCONTROLLABILITY

被引:24
作者
ELSNER, L [1 ]
HE, C [1 ]
机构
[1] UNIV BIELEFELD,FAK MATH,W-4800 BIELEFELD 1,GERMANY
关键词
CONTROLLABILITY; DISTANCE TO UNCONTROLLABILITY; SINGULAR VALUE DECOMPOSITION; NEWTON METHOD;
D O I
10.1016/0167-6911(91)90085-S
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we present an algorithm to compute the distance to uncontrollability. The problem of computing the distance is an optimization problem of minimizing sigma(x, y) over the complete plane. This new approach is based on finding zero points of grad sigma(x, y). We obtain the explicit expression of the derivative matrix of grad sigma(x, y). The Newton's method and the bisection method are applied to approach these zero points. Numerical results show that these methods work well.
引用
收藏
页码:453 / 464
页数:12
相关论文
共 13 条
[1]   COMPUTING RANK-DEFICIENCY OF RECTANGULAR MATRIX PENCILS [J].
BOLEY, D .
SYSTEMS & CONTROL LETTERS, 1987, 9 (03) :207-214
[2]   MEASURING HOW FAR A CONTROLLABLE SYSTEM IS FROM AN UNCONTROLLABLE ONE [J].
BOLEY, DL ;
LU, WS .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1986, 31 (03) :249-251
[3]  
BOLEY DL, 1990, OCT SIAM J MATR AN A
[4]  
BYERS R, 1989, P INT S MTNS 89 AMST
[5]   BETWEEN CONTROLLABLE AND UNCONTROLLABLE [J].
EISING, R .
SYSTEMS & CONTROL LETTERS, 1984, 4 (05) :263-264
[6]  
EISING R, 1984, 1983 P MTNS, P303
[7]  
KENNEY C, 1988, MATH CONTROL SIGNALS
[8]   ON MINIMIZING THE MAXIMUM EIGENVALUE OF A SYMMETRIC MATRIX [J].
OVERTON, ML .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1988, 9 (02) :256-268
[10]  
SUN J, 1988, J COMPUT MATH, V6, P259