Observability conditions of linear time-varying systems and its computational complexity aspects (Q1886207)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Observability conditions of linear time-varying systems and its computational complexity aspects |
scientific article; zbMATH DE number 2115998
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Observability conditions of linear time-varying systems and its computational complexity aspects |
scientific article; zbMATH DE number 2115998 |
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
0.91283065
0 references
0.9064456
0 references
0.8902956
0 references
0.8875443
0 references
0.8866208
0 references
0.8850783
0 references
0.8846915
0 references
0.8832836
0 references
0.88234943
0 references