System identifiability from finite time series

نویسنده

  • Christiaan Heij
چکیده

The possibility to identify linear systems from finite data, e.g. a partial impulse response, is determined by the degree of corroboration of system restrictions by the observed data. Ala~'Kt-In this paper we investigate the identification of systems from time series observed over a finite time interval. The data generating system is supposed to be finite dimensional, linear and time invariant, but not necessarily controllable. The minimal number of time series needed to identify a system is characterized by the identifiability index of a system, which measures the rank drop of autoregressive representations. We formulate a procedure for modelling finite time series which takes the corroboration of system restrictions into account. This also gives a new solution for the partial realization problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind Identifiability Analysis in a Mimo Lti System with Inputs from a Finite-alphabet Set

A blind separation problem in a multiple-input-multiple-output (MIMO) linear time-invariant (LTI) system with finite-alphabet inputs is considered. A discrete-time matrix equation model is used to describe the input-output relation of the system in order to make full use of the advantages of modern digital signal processing techniques. At first, ambiguity problem is investigated. Then, based on...

متن کامل

Identifiability of Non-Gaussian Structural VAR Models for Subsampled and Mixed Frequency Time Series

Causal inference in multivariate time series is confounded by subsampling in time between the true causal scale and the observed data sampling rate. In practice, this presents challenges for inferring causal interaction between time series due to differences in sampling rates across time series and generally low sampling rates due to technological limitations. To determine instantaneous and lag...

متن کامل

Identifiability of finite mixtures of elliptical distributions

We present general results on the identifiability of finite mixtures of elliptical distributions under conditions on the characteristic generators or density generators. Examples include the multivariate t distribution, symmetric stable laws, exponential power and Kotz distributions. In each case, the shape parameter is allowed to vary in the mixture, in addition to the location vector and the ...

متن کامل

Identifiability of Variable Coefficients for Vibrating Systems by Boundary Control and Observation in Finite Time Duration

The identifiability of spatial variable coefficients for vibration string and EulerBernoulli beam are considered. It is shown that the coefficients can be determined by means of boundary control and observation in finite time duration. These results can be considered as the generalization of infinite time coefficients identifiability through the application of InghamBeurling theorem.

متن کامل

Structural Identifiability of Systems Biology Models: A Critical Comparison of Methods

Analysing the properties of a biological system through in silico experimentation requires a satisfactory mathematical representation of the system including accurate values of the model parameters. Fortunately, modern experimental techniques allow obtaining time-series data of appropriate quality which may then be used to estimate unknown parameters. However, in many cases, a subset of those p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Automatica

دوره 29  شماره 

صفحات  -

تاریخ انتشار 1993