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

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

;Konstantin E. Starkov
journal of power sources 2002 Vol. 8 pp. 439-449
110
starkov2002mathematicalobservability

Abstract

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.

Citation

ID: 259767
Ref Key: starkov2002mathematicalobservability
Use this key to autocite in SciMatic or Thesis Manager

References

Blockchain Verification

Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
259767
Unique Identifier:
10.1080/10241230306721
Network:
Scimatic Chain (ID: 481)
Loading...
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
5/5
Creates 1,000,000 NFT tokens for this article
Token Features:
  • ERC-1155 Standard NFT
  • 1 Million Supply per Article
  • Transferable via MetaMask
  • Permanent Blockchain Record
Blockchain QR Code
Scan with Saymatik Web3.0 Wallet

Saymatik Web3.0 Wallet