首页 | 官方网站   微博 | 高级检索  
     

基于定常线性迭代法的PSO算法收敛性分析
引用本文:张慧斌,王鸿斌,胡志军.基于定常线性迭代法的PSO算法收敛性分析[J].计算机工程与应用,2011,47(31):35-37.
作者姓名:张慧斌  王鸿斌  胡志军
作者单位:忻州师范学院计算机科学与技术系,山西忻州,034000
基金项目:山西省自然科学基金(No.2009011018-4)~~
摘    要:PSO算法本身是线性时变离散系统,现有的PSO算法收敛性条件的研究都是通过一定的假设将其转化为线性定常离散系统,线性定常离散系统的数学模型与求解线性方程组的单步定常线性迭代法的数学模型完全一致,这样对线性定常离散系统的稳定性分析就转化为对单步定常线性迭代格式的收敛性分析,为PSO算法的收敛性研究提供了一种新的思路和方法。

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

PSO algorithm convergence analysis based on time-invariant linear iterative method
ZHANG Huibin,WANG Hongbin,HU Zhijun.PSO algorithm convergence analysis based on time-invariant linear iterative method[J].Computer Engineering and Applications,2011,47(31):35-37.
Authors:ZHANG Huibin  WANG Hongbin  HU Zhijun
Affiliation:ZHANG Huibin,WANG Hongbin,HU Zhijun Department of Computer Science and Technology,Xinzhou Teachers College,Xinzhou,Shanxi 034000,China
Abstract: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 o...
Keywords:Particle Swarm Optimization(PSO) algorithm  linear time-varying discrete systems  linear time-invariant discrete systems  single-step time-invariant linear iterative method  convergence analysis  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号