Identification of LFT Structured Descriptor Systems with Slow and Non-uniform Sampling
Tong Zhou

TL;DR
This paper develops a method for identifying parameters of continuous-time descriptor systems from slow, non-uniform sampled data without Nyquist restrictions, applicable to networked systems and providing explicit response formulas.
Contribution
It introduces a novel identification approach for descriptor systems under slow, irregular sampling, with explicit formulas and estimation algorithms analyzed for their properties.
Findings
Explicit formulas for transient and steady-state responses.
Estimation algorithms for system parameters and transfer function matrix.
Algorithms shown to be asymptotically unbiased and consistent.
Abstract
Time domain identification is studied in this paper for parameters of a continuous-time multi-input multi-output descriptor system, with these parameters affecting system matrices through a linear fractional transformation. Sampling is permitted to be slow and non-uniform, and there are no necessities to satisfy the Nyquist frequency restrictions. This model can be used to describe the behaviors of a networked dynamic system, and the obtained results can be straightforwardly applied to an ordinary state-space model, as well as a lumped system. An explicit formula is obtained respectively for the transient and steady-state responses of the system stimulated by an arbitrary signal. Some relations have been derived between the system steady-state response and its transfer function matrix (TFM), which reveal that the value of a TFM at almost any interested point, as well as its derivatives…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlind Source Separation Techniques
