DocumentCode
3468290
Title
Some robust stability theorems for polygons of discrete polynomials
Author
Peterson, James ; Pujara, L.R.
Author_Institution
Dept. of Electr. Eng., Wright State Univ., Dayton, OH, USA
fYear
1993
fDate
1-3 Aug. 1993
Firstpage
288
Lastpage
290
Abstract
How to partition an unstable polytope of polynomials into stable and unstable regions is addressed. L.R. Pujara and N. Shanghag have taken the first step by proposing a partition algorithm for unstable polygons of continuous polynomials. The present study begins with a discrete version of the segment lemma of H. Chapellat and S.P. Battacharyya (1989). Some necessary and sufficient conditions are proven for a polynomial vanishing at e* (where *=J omega /sub 0/), for some omega /sub 0/, in a polygon of discrete polynomials. These results lead directly to a method for partitioning polygons of discrete polynomials.<>
Keywords
polynomials; stability; discrete polynomials; necessary and sufficient conditions; partitioning; polygons; robust stability theorems; unstable polygons; Polynomials; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems Engineering, 1991., IEEE International Conference on
Conference_Location
Dayton, OH, USA
Print_ISBN
0-7803-0173-0
Type
conf
DOI
10.1109/ICSYSE.1991.161135
Filename
161135
Link To Document