recursive identification;
parameter estimation;
convergence properties;
stochastic gradient;
least squares;
Hammersteinm models;
Wiener models;
Martingale convergence theorem;
D O I:
10.1016/j.automatica.2005.03.026
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
Two identification algorithms, an iterative least-squares and a recursive least-squares, are developed for Hammerstein nonlinear systems with memoryless nonlinear blocks and linear dynamical blocks described by ARMAX/CARMA models. The basic idea is to replace unmeasurable noise terms in the information vectors by their estimates, and to compute the noise estimates based on the obtained parameter estimates. Convergence properties of the recursive algorithm in the stochastic framework show that the parameter estimation error consistently converges to zero under the generalized persistent excitation condition. The simulation results validate the algorithms proposed. (c) 2005 Elsevier Ltd. All rights reserved.