• DocumentCode
    1744151
  • Title

    Model reduction of singular systems

  • Author

    Liu, W.Q. ; Sreeram, V.

  • Author_Institution
    Sch. of Comput. Sci., Curtin Univ. of Technol., Perth, WA, Australia
  • Volume
    3
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    2373
  • Abstract
    The model reduction problem for singular systems is investigated. Firstly, the model reduction algorithm reported in Perev and Shafai (1994) is presented and proved to be wrong. Detailed examination of the above algorithm shows that the difficulty of model reduction for singular systems is to retain its impulsive nature. Thus, based on this observation, we investigate the impulsive controllability and impulsive observability of singular systems and propose a new decomposition approach for singular systems. Then a new model reduction algorithm is designed based on the new decomposition via the machinery of Nehari´s approximation algorithm. This new model reduction algorithm retains the impulsive nature of the original system. Finally, an example is presented to illustrate the effectiveness of the proposed model reduction algorithm
  • Keywords
    controllability; matrix algebra; observability; reduced order systems; Nehari approximation algorithm; impulsive controllability; impulsive observability; model reduction; singular systems; Algorithm design and analysis; Approximation algorithms; Artificial intelligence; Australia; Controllability; Electronic mail; Machinery; Reduced order systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 2000. Proceedings of the 39th IEEE Conference on
  • Conference_Location
    Sydney, NSW
  • ISSN
    0191-2216
  • Print_ISBN
    0-7803-6638-7
  • Type

    conf

  • DOI
    10.1109/CDC.2000.914154
  • Filename
    914154