In this paper, the problem of asymptotic identification for fading memory systems in the presence of bounded noise is studied. For any experiment, the worst-case error is characterized in terms of the diameter of the worst-case uncertainty set. Optimal inputs that minimize the radius of uncertainty
โฆ LIBER โฆ
Worst-case identification in structured process systems
โ Scribed by U. Kabatek; R.E. Swaney
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 821 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0098-1354
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Worst-case identification of nonlinear f
โ
Munther A. Dahleh; Eduardo D. Sontag; David N.C. Tse; John N. Tsitsiklis
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 786 KB
Worst-case identification in Banach spac
โ
Jonathan R. Partington
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 438 KB
Information-Based Complexity and Nonpara
โ
M. Milanese; A. Vicino
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 764 KB
Worst-case optimality of smoothing algor
โ
Roberto Tempo
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 439 KB
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
The sample complexity of worst-case iden
โ
Munther A Dahleh; Theodore V Theodosopoulos; John N Tsitsiklis
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 588 KB
Worst case system identification in l1:
โ
C.A. Jacobson; C.N. Nett; J.R. Partington
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 457 KB