基于双群进化策略的多项式近似因式分解  

Application of Bi-evolution Strategies to Solving Polynomials Approximate Factorization

作　　者：张明[1,2] 周永权[1] Ahmed N.Abdalla 

机构地区：[1]广西民族大学数学与计算机科学学院,南宁530006 [2]大连水产学院理学院,大连116023 [3]华中科技大学电气与电子工程学院,武汉430074

出　　处：《武汉理工大学学报（交通科学与工程版）》2009年第2期390-393,共4页Journal of Wuhan University of Technology（Transportation Science & Engineering）

基　　金：国家自然科学基金项目资助(批准号:60461001)

摘　　要：针对传统算法在解决多项式的因式分解过程中,存在着只适用于精确分解而不适合系数为浮点数的多项式的因式分解问题,文中提出一种应用双种群双突变进化策略来对浮点数多项式近似分解的算法,克服了传统算法不能解决浮点数多项式的因式分解的弊端.数值计算结果表明该算法收敛速度快、精度高、稳定性强.The traditional algorithms have the problem in solving polynomials factorization that the algorithms suit to precise factorization, but not to polynomials factorization whose coefficients are float. This paper presents an algorithm which has bi-subgroup and hi-mutation to solving float polynomials approximate factorization by evolution strategies. It overcomes the question that traditional algorithms can＇t solve polynomials factorization whose coefficients are float. The numerical computation results indicate that the algorithm offers an effective way to solve polynomials factorization, high convergence rate and high accuracy.

关 键 词：多项式 双种群进化策略 近似因式分解 双突变 

分 类 号：O241.5[理学—计算数学]