首页 | 本学科首页   官方微博 | 高级检索  
     检索      

求分圆多项式近似根的遗传算法
引用本文:刘向虎,何登旭.求分圆多项式近似根的遗传算法[J].广西科学院学报,2007,23(2):70-72.
作者姓名:刘向虎  何登旭
作者单位:广西民族大学数学与计算机科学学院,广西南宁,530006
基金项目:国家自然科学基金 , 国家民委科研项目
摘    要:新提出的求分圆多项式近似根的遗传算法,是取m个个体,在初始群体中随机产生m个初始点,再用适应度函数1/(1 |f(x)|)计算个体适应度,对种群进行选择、交叉、变异操作,将适应度好的个体组成下一代群体,直到达到规定近似根的个数和精度,就输出结果.该算法采用动态自适应技术、重新启动法、多项式除法等措施进行优化,可以有效地防止出现未成熟收敛问题.该算法在求分圆多项式的近似根方面是可行的,并取得比较好的效果,为判定一个多项式是否分圆提供了一种新方法.

关 键 词:遗传算法  分圆多项式  
文章编号:1002-7378(2007)02-0070-03
收稿时间:2006-11-09
修稿时间:2006-11-092006-12-14

Genetic Algorithm for Finding Approximate Roots of a Cyclotomic Polynomial
LIU Xiang-hu and HE Deng-xu.Genetic Algorithm for Finding Approximate Roots of a Cyclotomic Polynomial[J].Journal of Guangxi Academy of Sciences,2007,23(2):70-72.
Authors:LIU Xiang-hu and HE Deng-xu
Institution:College of Mathematics and Computer Science,Guangxi University for Nationalities,Nanning, Guangxi, 530006 ,China
Abstract:The newly-proposed genetic algorithm for finding approximate roots of a cyclotomic polynomial in this paper refers to the process in which m individuals are selected to produce randomly m original points in the original groups.Then by using the fitness function 1/(1+|f(x)|),individuals' fitness is calculated,selection,crossover and mutation of initial population are performed to integrate individuals with good fitness into the next generation.The result will come out when the ordered number of the approximate roots and the precision are achieved.The algorithm is optimized by using dynamic adaptive,restartion,polynomial division to restrain the premature convergence efficiently.The algorithm is practicable and efficient in finding approximate roots of a cyclotomic polynomial,and gives a new method to judge a polynomial that can pitch cirle.
Keywords:genetic algorithm  cyclotomic polynomial  root
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《广西科学院学报》浏览原始摘要信息
点击此处可从《广西科学院学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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