Conference proceeding
A fast algorithm for checking the stability of the convex combination of stable polynomials
Proceedings of the 28th IEEE Conference on Decision and Control, v 3, pp 1888-1889
1989
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.< >
Metrics
8 Record Views
Details
- Title
- A fast algorithm for checking the stability of the convex combination of stable polynomials
- Creators
- H Bouguerra - Drexel UniversityB.C Chang - Drexel UniversityH.H YehS.S BandaIEEE
- Publication Details
- Proceedings of the 28th IEEE Conference on Decision and Control, v 3, pp 1888-1889
- Conference
- 28th IEEE Conference on Decision and Control, 28th
- Publisher
- IEEE
- Number of pages
- 1
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Mechanical Engineering and Mechanics
- Web of Science ID
- WOS:A1989BP96Z00427
- Other Identifier
- 991019205015804721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Engineering, Electrical & Electronic
- Mathematics, Applied