Abstract:
The approach to the stability of uncertain plants by means of polytopic polynomials often leads to a combinatorial explosion of the number of edges of a polytope whose st...Show MoreMetadata
First Page of the Article
Abstract:
The approach to the stability of uncertain plants by means of polytopic polynomials often leads to a combinatorial explosion of the number of edges of a polytope whose stability has to be checked. To reduce the computational burden of this combinatorial explosion to a minimum a fast algorithm for checking the stability of the edges of a polytope is proposed. The major computation involved is the solution of the positive real roots of two polynomials with degree less than or equal to n/2 for each vertex. The computation required by the algorithm is mainly vertex dependent, and the burden of the combinatorial explosion of the number of edges is greatly reduced.<>
Date of Conference: 13-15 December 1989
Date Added to IEEE Xplore: 06 August 2002
First Page of the Article
Citations are not available for this document.
Cites in Papers - |
Cites in Papers - IEEE (1)
Select All
1.
B.-C. Chang, X.P. Li, H.H. Yeh, S.S. Banda, "Methods to check robust stability in the parameter space", Proceedings of the 28th IEEE Conference on Decision and Control,, pp.1858-1861 vol.2, 1989.
