Identifiabilty of systems described by convolution equations

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 inter...

Full description

Saved in:
Bibliographic Details
Published in:Automatica (Oxford) 2005-03, Vol.41 (3), p.505-512
Main Author: Belkoura, Lotfi
Format: Article
Language:English
Subjects:
Approximate controllability
Convolution equations
Identifiability
Weak controllability
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2004.11.013