Interval continuous plant identification from value sets (Q1952952)

From MaRDI portal
Revision as of 12:22, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Interval continuous plant identification from value sets
scientific article

    Statements

    Interval continuous plant identification from value sets (English)
    0 references
    0 references
    0 references
    0 references
    3 June 2013
    0 references
    Summary: This paper shows how to obtain the values of the numerator and denominator Kharitonov polynomials of an interval plant from its value set at a given frequency. Moreover, it is proven that given a value set, all the assigned polynomials of the vertices can be determined if and only if there is a complete edge or a complete arc lying on a quadrant. This algorithm is nonconservative in the sense that if the value-set boundary of an interval plant is exactly known, and particularly its vertices, then the Kharitonov rectangles are exactly those used to obtain these value sets.
    0 references
    0 references
    0 references
    0 references