Computer Engineering and Applications ›› 2014, Vol. 50 ›› Issue (19): 32-36.

Previous Articles     Next Articles

olving matrix eigenvalues based on combining neighborhood optimization with θ-PSO algorithm

LUO Jian, TAN Wen, LIU Chaohua, XIAO Xiaoshi, YANG Zongchang, CHEN Min   

  1. School of Information and Electrical Engineering, Hunan University of Science and Technology, Xiangtan, Hunan 411201, China
  • Online:2014-10-01 Published:2014-09-29


罗  健,谭  文,刘朝华,肖小石,杨宗长,陈  敏   

  1. 湖南科技大学 信息与电气工程学院,湖南 湘潭 411201

Abstract: Combined neighborhood optimization with θ-PSO algorithm, a new method of solving matrix eigenvalues is presented. The method transfers the problem of solving matrix eigenvalues into the optimization problem. Compared to the other algorithms needing to run for many times, this method can solve all the eigenvalues at one time. The simulation results illustrate the accuracy and the convergence speed of the algorithm is higher, which can converge within about ten to fifteen generations. The algorithm is implemented conveniently, at the same time, it can obtain any matrix eigenvalues. The method can satisfy the accuracy and speed demand completely suitable for application in engineering.

Key words: θ-Particle Swarm Optimization(θ-PSO) algorithm, eigenvalue, neighborhood optimization, matrix

摘要: 提出一种融合邻域寻优与θ-PSO算法的矩阵特征值求解新方法,将矩阵特征值的求解问题转化为最优化问题。与需要多次运行程序分别求解不同范围的特征值算法相比,该方法可以一次性求出矩阵的全部特征根。仿真实验表明,该算法编程实现方便,对于不同类型的矩阵均可以应用,求解精度高,收敛速度快,大概在10~15代左右就可以收敛,完全可以满足工程实践运算中对精度和速度的要求。

关键词: &theta, -PSO算法, 特征值, 邻域寻优, 矩阵