Convergence Analysis of RLS Algorithms under Weak Conditions
This paper establishes the consistency of recursive least squares and extended least squares algorithms for identifying ARX and ARMAX models under very weak assumptions. We relax the assumptions that the noise variance is constant and that high-order moments are existent, and prove that the parameter estimates consistently converge to the true parameters under time-varying variance and unbounded condition number, and that the parameter estimation error converges to zero under bounded condition number and unbounded variance.
Recursive identification parameter estimation convergence properties least squares extended least squares
Feng Ding Yi Zhou Ming Li Jiyang Dai
Control Science and Engineering Research Center Southern Yangtze University Wuxi, Jiangsu, P.R. Chin Key Laboratory of Nondestructive Test Nanchang Institute of Aeronautical Technology Nanchang, Jiangx
国际会议
青岛
英文
2006-07-21(万方平台首次上网日期,不代表论文的发表时间)