Skip to content

Beyond the Fundamental Lemma: From Finite Time Series to Linear System

Year
Algorithm
Finite Time Series Realization Conditions
Source
Identifiers

Abstract

We state necessary and sufficient conditions to uniquely identify (modulo state isomorphism) a linear time-invariant minimal input-state-output system from finite input-output data and upper- and lower bounds on lag and state space dimension.

Summary

Revisits what can be identified from finite input-output time series beyond the trajectory-spanning statement of the fundamental lemma. The paper gives exact identifiability conditions and dimension/lag bounds, making it a more system-identification-oriented complement to direct control results.

Tags

Similar Papers