Identifiabilty of systems described by convolution equations

被引：32

作者：

Belkoura, L ^{[1
]}

机构：

[1] Univ Sci & Technol Lille, LAGIS, F-59650 Villeneuve Dascq, France

来源：

AUTOMATICA | 2005年 / 41卷 / 03期

关键词：

identifiability; convolution equations; approximate controllability; weak controllability;

D O I：

10.1016/j.automatica.2004.11.013

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Parameter identifiability is studied for a class of finite- and infinite-dimensional systems described by convolution equations. The notion of sufficiently rich input which enforces identifiability is also addressed and the results are obtained assuming knowledge of solutions on a bounded time interval. (C) 2004 Elsevier Ltd. All rights reserved.

引用

页码：505 / 512

页数：8

共 24 条

[1]

AYRES F, 1973, THEORY PROBLEMS MATR

[2]

BELKOURA L, 2003, 13 IFAC S SYSTEM IDE, P731

[3] Identifiability and distinguishability concepts in electrochemistry [J].