Row reduced representations of behaviors over finite rings

Margreta Kuijper, Raquel Pinto, Jan W. Polderman

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

    52 Downloads (Pure)

    Abstract

    Row reduced representations of behaviors over fields posses a number of useful properties. Perhaps the most important feature is the predictable degree property. This property allows a finite parametrization of the module generated by the rows of the row reduced matrix with prior computable bounds. In this paper we study row-reducedness of representations of behaviors over rings of the form $\mathbb{Z}_{p^r}$, where $p$ is a prime number. Using a restricted calculus within $\mathbb{Z}_{p^r}$ we derive a meaningful and computable notion of row-reducedness.
    Original languageUndefined
    Title of host publicationProceedings of the 46th IEEE Conference on Decision and Control
    Place of PublicationUnited States
    PublisherIEEE
    Pages470-475
    Number of pages6
    ISBN (Print)1-4244-1498-9
    DOIs
    Publication statusPublished - 2007
    Event46th IEEE Conference on Decision and Control, CDC 2007 - Hilton New Orleans Riverside, New Orleans, United States
    Duration: 12 Dec 200714 Dec 2007
    Conference number: 46

    Publication series

    Name
    PublisherIEEE
    Number7
    ISSN (Print)0024-3795
    ISSN (Electronic)1873-1856

    Conference

    Conference46th IEEE Conference on Decision and Control, CDC 2007
    Abbreviated titleCDC
    CountryUnited States
    CityNew Orleans
    Period12/12/0714/12/07

    Keywords

    • Linear systems
    • finite rings
    • polynomial matrices
    • kernel representations
    • METIS-245955
    • row reduced
    • EWI-11750
    • IR-64588
    • Behaviors
    • predictable degree property

    Cite this