Analysis of G-Type Model Exploited for Online ZLE Solving
In this paper, the performance analysis of the model of gradient neural network (or termed G-type model), which was designed originally for solving constant linear equation, is investigated, analyzed and simulated for online solution of Zhang linear equation (ZLE or termed time-varying linear equation). Compared with the constant case, G-type model for online ZLE solving can only approximately approach its time-varying theoretical solution, instead of converging to it exactly. That is, the steady-state error between the solution of G-type model and the theoretical solution cannot vanish to zero. In order to understand this situation better, the upper bound of such an error is estimated firstly, and then the global exponential convergence rate is investigated for such a G-type model when approaching the error bound. Computer simulations substantiate the performance analysis of the G-type model exploited for online ZLE solving.
Performance Analysis G-Type Model Linear Equation (LE) Solving Global Exponential Convergence
Yunong Zhang Zhengli Xiao Ke Chen Mingzhi Mao Xun Liu
School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China Division of Nephrology, Department of Internal Medicine, The Third Affiliated Hospital of Sun Yat-se
国际会议
长沙
英文
166-171
2014-05-31（万方平台首次上网日期，不代表论文的发表时间）