Paper Info
Title
The edge theorem and graphical tests for robust stability of neutral time-delay systems
Abstract
We consider the robust stability problem for a class of uncertain neutral time-delay systems where the characteristic equations involve a polytope p of quasipolynomials of neutral type. Given a stability region D in the complex plane our goal is to find a constructive technique to verify the D -stability of p (i.e. to verify whether the roots of every quasipolynomial in p all belong to D ). We first show that, under a certain assumption on the stability region D , p is D -stable if and only if the edges of p are D -stable. Hence, the D -stability problem of a higher dimensional polytope is reduced to the D -stability problem of a finite number of pairwise convex combinations of vertices. Based on this result, we then give an effective graphical test for checking the D -stability of a polytope of quasipolynomials of neutral type.
Year
DOI
Venue
1991
10.1016/0005-1098(91)90068-D
Automatica
Keywords
Field
DocType
Robust stability,time-delay systems,robustness,uncertain systems,parametric perturbation
Discrete mathematics,Mathematical optimization,Finite set,Vertex (geometry),Polynomial,Control theory,Regular polygon,Robustness (computer science),Complex plane,Polytope,Transfer function,Mathematics
Journal
Volume
Issue
ISSN
27
4
0005-1098
Citations 
PageRank 
References 
6
8.22
0
Authors
3
Name
Order
Citations
PageRank
Minyue Fu11878221.17
Andrzej W. Olbrot268.56
Michael P. Polis32612.66