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

一种求解多项式根最大模的人工鱼群算法
引用本文:王冬冬,周永权. 一种求解多项式根最大模的人工鱼群算法[J]. 计算机工程, 2008, 34(7): 194-196
作者姓名:王冬冬  周永权
作者单位:广西民族大学数学与计算机科学学院,南宁,530006;广西民族大学数学与计算机科学学院,南宁,530006
基金项目:国家自然科学基金 , 广西自然科学基金 , 广西民族大学基金重大科研项目
摘    要:利用多项式根的反演关系,给出判定多项式根是否全部在单位圆内的判定定理。引入变形参数将多项式变形,并基于判定定理,给出求变形参数最小值的人工鱼群算法,即求多项式根最大模的人工鱼群算法,使变形多项式根全部在单位圆内。算例表明该算法收敛速度快,求解精度高。

关 键 词:多项式  根最大模  单位圆  判定定理  人工鱼群算法
文章编号:1000-3428(2008)07-0194-03
修稿时间:2007-04-10

Artificial Fish School Algorithm for Finding the Largest Module of Roots of Polynomial
WANG Dong-dong,ZHOU Yong-quan. Artificial Fish School Algorithm for Finding the Largest Module of Roots of Polynomial[J]. Computer Engineering, 2008, 34(7): 194-196
Authors:WANG Dong-dong  ZHOU Yong-quan
Affiliation:(College of Mathematics and Computer Science, Guangxi University for Nationalities, Nanning 530006)
Abstract:The theorem used to judge whether all roots of a polynomial are in unit circle is put forward. To transform the polynomial by the transforming parameter, and Artificial Fish School Algorithm(AFSA) for finding the minimum value of the transforming parameter which makes all the roots of the polynomial in unit circle based on the judging theorem is given. It is Artificial Fish School Algorithm for finding the largest module of roots of polynomial. Several computer simulation results show that using this algorithm to find the largest module of roots of polynomial is more efficient and feasible, and the convergent speed and the accuracy of result is higher.
Keywords:polynomial  the largest module of roots  unit circle  judging theorem  Artificial Fish School Algorithm(AFSA)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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