Logo image
Back
Fast stability checking for the convex combination of stable polynomials
Journal article   Peer reviewed

Fast stability checking for the convex combination of stable polynomials

H Bouguerra, B.C Chang, H.H Yeh and S.S Banda
IEEE transactions on automatic control, v 35(5), pp 586-588
May 1990
DOI: https://doi.org/10.1109/9.53530
Featured in Collection :   UN Sustainable Development Goals @ Drexel

Abstract

Robust stability H infinity control Hypercubes Explosions Iterative algorithms Eigenvalues and eigenfunctions Partitioning algorithms Combinatorial mathematics Testing Polynomials
A fast algorithm is proposed for checking the stability of the edges of a polytope where most of the computations involved depend on the number of vertices rather than on the number of edges. This algorithm is based on the segment lemma derived by H. Chapellat et al. (1988). Although the segment lemma is an important result on its own, no explicit algorithm was given there. Some important properties of the lemma are revealed, and it is shown how they lead to a fast algorithm. In this algorithm, the major computations involved are those of solving for the positive real roots of two polynomials with degree less than or equal to n/2 for each vertex. The computations required by the algorithm are mainly vertex-dependent, and the burden of the combinatoric explosion of the number of edges is greatly reduced.

Metrics

6 Record Views
13 citations in Web of Science
17 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Automation & Control Systems
Engineering, Electrical & Electronic
Logo image