Observability conditions of linear time-varying systems and its computational complexity aspects (Q1886207)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Observability conditions of linear time-varying systems and its computational complexity aspects
scientific article

    Statements

    Observability conditions of linear time-varying systems and its computational complexity aspects (English)
    0 references
    16 November 2004
    0 references
    Summary: We propose necessary and sufficient observability conditions for linear time-varying systems with coefficients being time polynomials. These conditions are deduced from the Gabrielov-Khovansky theorem on multiplicity of a zero of a Noetherian function and the Wei-Norman formula for the representation of a solution of a linear time-varying system as a product of matrix exponentials. We define a Noetherian chain consisted of some finite number of usual exponentials corresponding to this system. Our results are formulated in terms of a Noetherian chain generated by these exponential functions and an upper bound of multiplicity of zero of one locally analytic function which is defined with help of the Wei-Norman formula. Relations with Observability conditions of bilinear systems are discussed. The case of two-dimensional systems is examined.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references