会议专题

Parameter identi.cation to an approximated function of the Weierstrass approximation formula

In Weierstrass approximation theorem, a continuous function can be approximated by an algebraic polynomial. In this paper, we use the stochastic gradient identi.cation algorithm and the recursive least squares algorithm to estimate the parameters of the algebraic polynomial. In order to improve the convergence rate and the computational effort, two modi.ed stochastic gradient algorithms are given. The proposed approaches are illustrated by a simulation example.

Parameter estimation Stochastic gradient Recursive least squares Weierstrass approximation theorem Identification model.

Jia Tang Jing Chen Xiaoying Zhou

Wuxi Professional College ofScience and Technology, Wuxi 214028, PR China School of IoT Engineering, Jiangnan University, Wuxi214122, PR China Wuxi Professional College of Science and Technology, Wuxi 214028, PR China

国际会议

The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)

太原

英文

935-938

2012-05-23(万方平台首次上网日期,不代表论文的发表时间)