TY  - JOUR
AB  - 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.
DA  - 1991
DO  - 10.1016/0167-6911(91)90085-S
KW  - Controllability
KW  - Newton's method
KW  - distance to uncontrollability
KW  - singular value decomposition
LA  - eng
IS  - 6
M2  - 453
PY  - 1991
SN  - 0167-6911
SP  - 453-464
T2  - Systems & Control Letters
TI  - An algorithm for computing the distance to uncontrollability
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17749868
Y2  - 2024-11-22T04:18:44
ER  -