• DocumentCode
    894611
  • Title

    Relationship between standard control problem and model-matching problem without coprime factorizability

  • Author

    Mori, Kazuyoshi

  • Author_Institution
    Sch. of Comput. Sci. & Eng., Univ. of Aizu, Aizu-Wakamatsu, Japan
  • Volume
    49
  • Issue
    2
  • fYear
    2004
  • Firstpage
    230
  • Lastpage
    233
  • Abstract
    We present the equivalence between a standard control problem and a model-matching problem without coprime factorizability of plants. This equivalence is well-known if every stabilizable plant admit a doubly coprime factorization. The result of this note does not require the coprime factorizability of plants.
  • Keywords
    linear systems; matrix decomposition; stability; transfer function matrices; coordinate-free approach; coprime factorizability; equivalence; linear system; matrix algebra; model-matching problem; stabilizable plant; standard control problem; Computer science; Control system synthesis; Delay systems; Feedback; Linear systems; Modules (abstract algebra); Multidimensional systems; Structural engineering; Transfer functions;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/TAC.2003.822863
  • Filename
    1266777
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=894611