一种求解多项式根最大模的区间进化AFSA

摘要

针对多项式根的最大模求解问题,给出一种求解多项式根最大模的区间进化人工鱼群算法(AFSA).该算法利用公告板上前后两代的信息,将搜索区间映射到更为有效的区域中,其搜索区间是动态的和进化的,从理论上证明该算法的收敛性.仿真实验结果表明,该算法在求多项式根最大模中是可行有效的,收敛速度快,求解精度高.%Aiming at the problem of finding the maximum module of a polynomial roots. An interval evolution Artificial Fish School Algorithm(AFSA) of finding the largest module of a polynomial roots is proposed. The search interval is mapped to more effective area based on bulletin board information, and its search interval is dynamic and evolved. Furthermore, its convergence is proved. Simulation experimental results show that this algorithm is more efficient and feasible to find the largest module of a polynomial roots, the convergent speed is much faster and the accuracy of result is much higher.