Skip Navigation


IMA Journal of Mathematical Control and Information Advance Access originally published online on November 20, 2008
IMA Journal of Mathematical Control and Information 2008 25(4):507-514; doi:10.1093/imamci/dnn009
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
25/4/507    most recent
dnn009v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Toker, O.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The author 2008. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Kharitonov theorem with degree drop: the complex case

Onur Toker{dagger}

Department of Electronics Engineering, Fatih University, Buyukcekmece 34500, Istanbul, Turkey

{dagger} Email: onur{at}fatih.edu.tr

Accepted on July 26, 2008

In this paper, we study the complex version of the Kharitonov theorem without the constant-degree assumption. It is proved that, for a complex-interval polynomial with degree drop, robust Hurwitz stability is equivalent to the Hurwitz stability of the eight Kharitonov polynomials. Furthermore, it is also shown that for a robustly stable complex-interval polynomial, degree drop cannot exceed one and degree drop can only occur at one of the corners of the rectangular region in the complex plane corresponding to the leading coefficient of the uncertain polynomial.

Keywords: Kharitonov theorem.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.