The Set of Linear Time-Invariant Unfalsified Models with Bounded Complexity is Affine

Vikas Kumar Mishra, Ivan Markovsky

Onderzoeksoutput: Article

3 Downloads (Pure)

Samenvatting

We consider exact system identification in the behavioral setting: given an exact (noise-free) finite time series, find the set of bounded complexity linear time-invariant systems that fit the data exactly. First, we modify the notion of the most powerful unfalsified model for the case of finite data by fixing the number of inputs and minimizing the order. Then, we give necessary and sufficient identifiability conditions, i.e., conditions under which the true data generating system coincides with the most powerful unfalsified model. Finally, we show that the set of bounded complexity exact models is affine: every exact model is a sum of the most powerful unfalsified model and an autonomous model with bounded complexity.
Originele taal-2English
Aantal pagina's4
TijdschriftIEEE Transactions on Automatic Control
DOI's
StatusE-pub ahead of print - 2020

Vingerafdruk

Duik in de onderzoeksthema's van 'The Set of Linear Time-Invariant Unfalsified Models with Bounded Complexity is Affine'. Samen vormen ze een unieke vingerafdruk.

Citeer dit