会议专题

Convergence Analysis of Learning Algorithms for Linear Systems with Rank-Defective Markov Parameters

In this paper, learning algorithms are examined for partially irregular linear systems. The contraction mapping approach is used and sufficient conditions for convergence are derived based on which the learning gains are chosen. In addition, the impact of initial conditions is investigated and compared in detail. A rectifying action is shown to give a convergent learning system which allows arbitrary initial repositioning.

learning algorithms Markov parameters linear systems

Mingxuan Sun

College of Information Engineering, Zhejiang University of Technology, Hangzhou 310014, China

国际会议

The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)

杭州

英文

954-961

2009-07-09(万方平台首次上网日期,不代表论文的发表时间)