We study parametric identification of uncertain systems in a deterministic setting. We assume that the problem data and the linearly parameterized system model are given. In the presence of a priori information and norm-bounded noise, we design optimal worst-case algorithms. In particular, we study
Optimal algorithms for system identification: a review of some recent results
β Scribed by R. Tempo; A. Vicino
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 842 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we present a review of some recent results for identification of linear dynamic systems in the presence of unknown but bounded uncertainty.
We make reference to the optimal algorithms theory which provides a general unifying framework to deal with several typical problems of system identification such as model parameter and state estimation, time series prediction and reduced order model estimation. The min-max optimality concepts pertaining to the optimal algorithms theory can be considered as counterparts to those available in classical standard approaches. We review some aspects of the general theory which make it possible to study properties of both classical standard estimators, such as least squares, and optima/ error estimators derived in recent work in the field.
π SIMILAR VOLUMES
In arbitrarily coupled dynamical systems (maps or ordinary differential equations), the stability of synchronized states (including equilibrium point, periodic orbit or chaotic attractor) and the formation of patterns from loss of stability of the synchronized states are two problems of current rese