引用本文
  • 刘向虎,何登旭.求分圆多项式近似根的遗传算法[J].广西科学院学报,2007,23(2):70-72.    [点击复制]
  • LIU Xiang-hu,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.   [点击复制]
【打印本页】 【在线阅读全文】【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 429次   下载 254 本文二维码信息
码上扫一扫!
求分圆多项式近似根的遗传算法
刘向虎, 何登旭
0
(广西民族大学数学与计算机科学学院, 广西南宁 530006)
摘要:
新提出的求分圆多项式近似根的遗传算法,是取m个个体,在初始群体中随机产生m个初始点,再用适应度函数1/(1+|f(x)|)计算个体适应度,对种群进行选择、交叉、变异操作,将适应度好的个体组成下一代群体,直到达到规定近似根的个数和精度,就输出结果。该算法采用动态自适应技术、重新启动法、多项式除法等措施进行优化,可以有效地防止出现未成熟收敛问题。该算法在求分圆多项式的近似根方面是可行的,并取得比较好的效果,为判定一个多项式是否分圆提供了一种新方法。
关键词:  遗传算法  分圆多项式  
DOI:
投稿时间:2006-11-09修订日期:2006-12-14
基金项目:国家自然科学基金(60461001);国家民委科学基金(05GX06)资助项目
Genetic Algorithm for Finding Approximate Roots of a Cyclotomic Polynomial
LIU Xiang-hu, HE Deng-xu
(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.
Key words:  genetic algorithm  cyclotomic polynomial  root

用微信扫一扫

用微信扫一扫