{"title":"Robust D-stability via positivity","authors":"D. Siljak, D. Stipanović","doi":"10.1109/ACC.1998.703085","DOIUrl":null,"url":null,"abstract":"The main objective of the paper is to convert the general problem of robust D-stability of a complex polynomial to positivity in the real domain of the corresponding magnitude function. In particular, the obtained Hurwitz stability criterion is applied to polynomials with interval parameters and polynomic uncertainty structures. The robust stability is verified by testing positivity of a real polynomial using the Bernstein subdivision algorithm. A new feature in this context is the stopping criterion, which is applied whenever the algorithm is inconclusive after a large number of iterations, but we can show that at least one zero of the polynomial is closer to the imaginary axis than a prescribed limit.","PeriodicalId":364267,"journal":{"name":"Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACC.1998.703085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
The main objective of the paper is to convert the general problem of robust D-stability of a complex polynomial to positivity in the real domain of the corresponding magnitude function. In particular, the obtained Hurwitz stability criterion is applied to polynomials with interval parameters and polynomic uncertainty structures. The robust stability is verified by testing positivity of a real polynomial using the Bernstein subdivision algorithm. A new feature in this context is the stopping criterion, which is applied whenever the algorithm is inconclusive after a large number of iterations, but we can show that at least one zero of the polynomial is closer to the imaginary axis than a prescribed limit.