Convergence analysis of instrumental variable recursive subspace identification algorithms
✍ Scribed by Guillaume Mercère; Marco Lovera
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 348 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0005-1098
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The convergence of a modified form of the IV 6nstrumental-variable) recursion (actually a case of the integral adaptation algorithm of Landau) for the parameters of a scalar transfer function time series model is considered. It is known that this algorithm requires at least a positive real condition
Ha HCIIOJIb3OBaHHH nepeMesH~x oS~excra ## T. SODERSTOMt Snmmary--A class of identification methods, proposed in [3], am based on the instrumental variable principle. This correspondence contains a continued analysis of convergence of the parameter estimates of these methods. Alternative, sui~cien
A general recursive identification algorithm is found to have the same convergence properties as a family of off-line prediction error methods.
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