𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotic properties of set membership identification algorithms

✍ Scribed by Mitchell M. Livstone; Munther A. Dahleh

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
574 KB
Volume
27
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Properties of least squares estimates in
Properties of least squares estimates in set membership identification
✍ M. Milanese πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 787 KB

The properties of the least square algorithm in the identification of linear, time-invariant, discrete-time systems, in the presence of unknown but bounded errors are investigated. It is known that the least squares algorithm enjoys strong optimality properties in the case of power bounded (1z) erro

Convergence properties of bias-eliminati
Convergence properties of bias-eliminating algorithms for errors-in-variables identification
✍ Torsten SΓΆderstrΓΆm; Mei Hong; Wei Xing Zheng πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 174 KB πŸ‘ 2 views

This paper considers the problem of dynamic errors-in-variables identification. Convergence properties of the previously proposed bias-eliminating algorithms are investigated. An error dynamic equation for the bias-eliminating parameter estimates is derived. It is shown that the convergence of the b