An algorithm for computing the distance to uncontrollability

Elsner L, He C (1991)
Systems & Control Letters 17(6): 453-464.

Download
OA
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Autor
;
Abstract / Bemerkung
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.
Erscheinungsjahr
Zeitschriftentitel
Systems & Control Letters
Band
17
Zeitschriftennummer
6
Seite
453-464
ISSN
PUB-ID

Zitieren

Elsner L, He C. An algorithm for computing the distance to uncontrollability. Systems & Control Letters. 1991;17(6):453-464.
Elsner, L., & He, C. (1991). An algorithm for computing the distance to uncontrollability. Systems & Control Letters, 17(6), 453-464. doi:10.1016/0167-6911(91)90085-S
Elsner, L., and He, C. (1991). An algorithm for computing the distance to uncontrollability. Systems & Control Letters 17, 453-464.
Elsner, L., & He, C., 1991. An algorithm for computing the distance to uncontrollability. Systems & Control Letters, 17(6), p 453-464.
L. Elsner and C. He, “An algorithm for computing the distance to uncontrollability”, Systems & Control Letters, vol. 17, 1991, pp. 453-464.
Elsner, L., He, C.: An algorithm for computing the distance to uncontrollability. Systems & Control Letters. 17, 453-464 (1991).
Elsner, Ludwig, and He, Chunyang. “An algorithm for computing the distance to uncontrollability”. Systems & Control Letters 17.6 (1991): 453-464.
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
1970-01-01T00:00:00Z