Szczegóły publikacji

Opis bibliograficzny

Optimal average case estimation in Hilbert norms / Bolesław KACEWICZ // Mathematics of Control, Signals and Systems ; ISSN 0932-4149. — 2000 — vol. 13 iss. 4, s. 347–359. — Bibliogr. s. 359, Abstr.

Autor

Słowa kluczowe

optimal subspaceoptimal algorithmlocal errorsaverage case settingidentification algorithms

Dane bibliometryczne

ID BaDAP5310
Data dodania do BaDAP2001-06-08
Tekst źródłowyURL
DOI10.1007/PL00009874
Rok publikacji2000
Typ publikacjiartykuł w czasopiśmie
Otwarty dostęptak
Czasopismo/seriaMCSS. Mathematics of Control, Signals and Systems

Abstract

In contrast to the worst case approach, the average case setting provides less conservative insight into the quality of estimation algorithms. In this paper we consider two local average case error measures of algorithms based on noisy information, in Hilbert norms in the problem element and information spaces. We define the optimal algorithm and provide formulas for its two local errors, which explicitly exhibit the influence of factors such as information, information (measurement) errors, norms in the considered spaces, a subset where approximations are allowed, and "unmodeled dynamics." Based on the error expression, we formulate in algebraic language the problem of selecting the optimal approximating subspace. The solution is given along with the specific formula for the error, which depends on the eigenvalues of a certain matrix defined by information and norms under consideration.

Publikacje, które mogą Cię zainteresować

artykuł
#15875Data dodania: 22.3.2004
Weighted average errors in set-membership estimation / Bolesław KACEWICZ // Mathematics of Control, Signals and Systems ; ISSN 0932-4149. — 2003 — vol. 16 no. 2–3, s. 238–253. — Bibliogr. s. 253, Abstr.
artykuł
#9536Data dodania: 15.7.2002
Optimal conditional estimation: average case setting / B. KACEWICZ // Journal of Optimization Theory and Applications ; ISSN 0022-3239. — 2001 — vol. 109 no. 3, s. 647–664. — Bibliogr. s. 663–664, Abstr.