An algorithm for computing the distance to uncontrollability

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

Download
OA
Journal Article | Published | English
Author
;
Abstract
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.
Publishing Year
ISSN
PUB-ID

Cite this

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.
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.
Main File(s)
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar