基于PSO的反对称矩阵反问题的最小二乘解  

LEAST-SQUARES SOLUTIONS OF INVERSE PROBLEMS FOR ANTI-SYMMETRIC MATRICES BASED ON PARTICLE SWARM OPTIMIZATION

作　　者：郁金祥[1] 刘锦萍[1] 

机构地区：[1]嘉兴学院数学与信息工程学院,浙江嘉兴314001

出　　处：《计算机应用与软件》2010年第8期279-281,294,共4页Computer Applications and Software

摘　　要：针对在反对称矩阵反问题的最小二乘解求解计算中,难以从问题的原始形式出发,构造出高效的迭代算法的计算难题,提出一种基于PSO算法的反对称矩阵反问题的最小二乘解的计算算法。该算法采用以带约束条件的反问题矩阵范数作为粒子群优化算法的适应度函数,建立起最小二乘解的计算模型。算例仿真结果显示,该算法是一种高效实用的求解算法。In order to solve the computing poser that it is hard to construct an effective iterative algorithm proceeding from the aboriginality of a problem straightway in the process of calculating the least-squares solutions of inverse problems for anti-symmetric matrices, a novel algo- rithm of calculating the least-squares solutions of inverse problems for anti-symmetric matrices is presented in the paper based on particle swarm optimization. Matrix norm of inverse problems with constraints is adopted in the algorithm to be the fitness function for the particle swarm optimization,thus the model of computing least-squares solutions is set up. Through a numerical simulation computational experiment, the algorithm is demonstrated an effective and practical approach of the problem solution.

关 键 词：反对称矩阵 最小二乘解 粒子群优化算法 矩阵范数 

分 类 号：TP[自动化与计算机技术]