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

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

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 representatio...

Full description

Bibliographic Details
Main Author: Konstantin E. Starkov
Format: Article
Language:English
Published: Hindawi Limited 2002-01-01
Series:Mathematical Problems in Engineering
Subjects:
Linear system
Time-varying system
Observability
Matrix exponential
Rank of a matrix
Mutiplicity of zero
Computational complexity.
Online Access:http://dx.doi.org/10.1080/10241230306721

Internet

http://dx.doi.org/10.1080/10241230306721

Similar Items