| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10398882 | Automatica | 2005 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Lotfi Belkoura,