Polynomial computation of Hankel singular values

H. Kwakernaak

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    100 Downloads (Pure)

    Abstract

    A revised and improved version of a polynomial algorithm is presented. It was published by N.J. Young (1990) for the computation of the singular values and vectors of the Hankel operator defined by a linear time-invariant system with a rotational transfer matrix. Tentative numerical experiments indicate that for high-order systems, scaling of the polynomial matrices N and D (so that the constant and leading coefficient matrices are of the same order of magnitude) is mandatory, and that solution of bilateral linear polynomial matrix equations by coefficient expansion is highly inefficient
    Original languageUndefined
    Title of host publication31st IEEE Conference on Decision and Control
    Place of PublicationTucson, Arizona
    PublisherIEEE
    Pages3595-3599
    Number of pages0
    Publication statusPublished - 16 Dec 1992
    Event31st IEEE Conference on Decision and Control, CDC 1992 - Westin La Paloma, Tucson, United States
    Duration: 16 Dec 199218 Dec 1992
    Conference number: 31

    Publication series

    Name
    PublisherIEEE
    Volume4

    Conference

    Conference31st IEEE Conference on Decision and Control, CDC 1992
    Abbreviated titleCDC
    CountryUnited States
    CityTucson
    Period16/12/9218/12/92

    Keywords

    • IR-30891
    • METIS-141532

    Cite this