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

PSO algorithm convergence analysis based on time-invariant linear iterative method

作　　者：张慧斌[1] 王鸿斌[1] 胡志军[1] 

机构地区：[1]忻州师范学院计算机科学与技术系,山西忻州034000

出　　处：《计算机工程与应用》2011年第31期35-37,共3页Computer Engineering and Applications

基　　金：山西省自然科学基金(No.2009011018-4)~~

摘　　要：PSO算法本身是线性时变离散系统,现有的PSO算法收敛性条件的研究都是通过一定的假设将其转化为线性定常离散系统,线性定常离散系统的数学模型与求解线性方程组的单步定常线性迭代法的数学模型完全一致,这样对线性定常离散系统的稳定性分析就转化为对单步定常线性迭代格式的收敛性分析,为PSO算法的收敛性研究提供了一种新的思路和方法。The PSO algorithm itself is in the linear time-variable discrete system.The existing convergence study of PSO algorithm is conducted by transforming it into linear time-invariant discrete systems through certain supposition.The mathematical 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 convergence 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.

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

分 类 号：TP301[自动化与计算机技术—计算机系统结构]