• DocumentCode
    1912369
  • Title

    Computation of the kernel of linear fractional representations

  • Author

    Magni, Jean-François

  • Author_Institution
    Departement d´´Automatique, ONERA-CERT, Toulouse, France
  • Volume
    2
  • fYear
    2003
  • fDate
    23-25 June 2003
  • Firstpage
    1058
  • Abstract
    This paper presents several algorithms for computing the kernel of a linear fractional representation (LFR). This problem is shown to be multi-criteria because, in addition to numerical stability, the complexity of the kernel (Δ-block size) and its well-posedness radius must also be optimized. Depending on the treated LFR, the proposed algorithms are more or less efficient; their respective advantages are discussed.
  • Keywords
    control system synthesis; modelling; numerical stability; optimisation; uncertain systems; Δ-block size; LFR; kernel complexity; kernel computation; linear fractional representation; numerical stability; well-posedness radius; Control design; Counting circuits; Equations; Feedback; Gain measurement; Kernel; Numerical stability; Processor scheduling; Robust control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control Applications, 2003. CCA 2003. Proceedings of 2003 IEEE Conference on
  • Print_ISBN
    0-7803-7729-X
  • Type

    conf

  • DOI
    10.1109/CCA.2003.1223157
  • Filename
    1223157
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1912369