计算机工程应用迭代法,基于定常线性迭代法的PSO算法收敛性分析-计算机工程与应用.PDF...

Computer Engineering and Applications 计算机工程与应用 2011 ，47 (31) 35

基于定常线性迭代法的PSO 算法收敛性分析

张慧斌，王鸿斌，胡志军

ZHANG Huibin ，WANG Hongbin ，HU Zhijun

忻州师范学院 计算机科学与技术系，山西 忻州 034000

Department of Computer Science and Technology ，Xinzhou Teachers College ，Xinzhou ，Shanxi 034000 ，China

ZHANG Huibin ，WANG Hongbin ，HU Zhijun.PSO algorithm convergence analysis based on time-invariant linear itera-

tive method.Computer Engineering and Applications ，2011 ，47 (31 )：35-37.

Abstract ：The PSO algorithm itself is in the linear time-variable discrete system.The existing convergence study of PSO al-

gorithm is conducted by transforming it into linear time-invariant discrete systems through certain supposition.The mathemati-

cal model of both linear time-invariant discrete system and solving single-step time-invariant linear iterative method of linear

equations group is exactly the same.So stability analysis of linear time-invariant discrete systems can be transformed into con-

vergence analysis of single-step time-invariant linear iterative method.In this way ，a new way is obtained to think and solve

on convergence analysis study of the PSO algorithm.

Key words ：Particle Swarm Optimization (PSO )algorithm ；linear time-varying discrete systems ；linear time-invariant discrete

systems ；single-step time-invariant linear iterative method ；convergence analysis

摘 要：PSO 算法本身是线性时变离散系统，现有的PSO 算法收敛性条件的研究都是通过一定的假设将其转化为线性定常离散

系统，线性定常离散系统的数学模型与求解线性方程组的单步定常线性迭代法的数学模型完全一致，这样对线性定常离散系统

的稳定性分析就转化为对单步定常线性迭代格式的收敛性分析，为PSO 算法的收敛性研究提供了一种新的思路和方法。

关键词：PSO 算法；线性时变离散系统；线性定常离散系统；单步定常线性迭代格式；收敛性分析

DOI ：10.3778/j.issn. 1002-8331.2011.31.010 文章编号：1002-8331(2011 )31-0035-03 文献标识码：A 中图分类号：TP301

1 引言 性分析转化为对单步定常线性迭代格式的收敛性分析，得到

PSO 算法是由Kennedy 和Eberhart 于1995年提出的一种 基于求解线性方程组的单步定常线性迭代格式收敛性的收敛