论文标题

离散时间SARX系统的最小和可识别性

Minimality and identifiability of discrete-time SARX systems

论文作者

Petreczky, M., Bako, L., Lecoeuche, S., Motchon, K. M. D.

论文摘要

本文研究了切换自动回归外源性(由SARX缩写)系统的最小和可识别性的问题。我们提出了对SARX模型的可识别性和最小值概念的形式定义。基于这些形式化,我们得出了SARX系统最小化和可识别性的条件。特别是,我们表明多项式参数化的SARX系统通常可识别。

The paper studies the problem of minimality and identifiability for Switched Auto-Regressive eXogenous (abbreviated by SARX) systems. We propose formal definitions of the concepts of identifiability and minimality for SARX models. Based on these formalizations, we derive conditions for minimality and identifiability of SARX systems. In particular, we show that polynomially parametrized SARX systems are generically identifiable.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源