• DocumentCode
    760430
  • Title

    The finite inclusions theorem

  • Author

    Kaminsky, Richard D. ; Djaferis, Theodore E.

  • Author_Institution
    Digital Storage Div., Shrewsbury, MA, USA
  • Volume
    40
  • Issue
    3
  • fYear
    1995
  • fDate
    3/1/1995 12:00:00 AM
  • Firstpage
    549
  • Lastpage
    551
  • Abstract
    This paper presents a novel necessary and sufficient condition for a polynomial to have all its roots in an arbitrary convex region of the complex plane. The condition may be described as a variant of Nyquist´s stability theorem; however, unlike this theorem it only requires knowledge of the polynomial´s value at finitely many points along the region´s boundary. A useful corollary, the finite inclusions theorem (FIT), provides a simple sufficient condition for a family of polynomials to have its roots in a given convex region. Since FIT only requires knowledge of the family´s value set at finitely many points along the region´s boundary, this corollary provides a new convenient tool for the analysis and synthesis of robust controllers for parametrically uncertain systems
  • Keywords
    control system analysis; control system synthesis; polynomials; robust control; uncertain systems; Nyquist´s stability theorem; convex region; finite inclusions theorem; necessary and sufficient condition; parametrically uncertain systems; polynomial; robust controllers; Control system synthesis; Eigenvalues and eigenfunctions; Poles and zeros; Polynomials; Robust control; Robust stability; Sufficient conditions; Transfer functions; Uncertain systems; Uncertainty;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/9.376079
  • Filename
    376079