基于狼群算法求解多项式方程的根

Solving Polynomial Equation Roots Based on Wolves Algorithm

针对在工程和科学计算中经常遇到多项式方程求解根的问题,传统的方法有二分法、牛顿法等,但它们收敛速度慢,效率低。对于上述缺点,本文提出狼群算法求解多项式方程根的问题,利用狼群算法的计算鲁棒性和全局收敛性多次迭代寻找方程的最优解。与其他的算法相比,有相对更好的稳定性和全局寻优能力。最后通过数值仿真实验,结果表明该算法能有效的求出多项式方程的根,并且精度高,收敛速度快。

For often encountered in engineering and scientific computing polynomial equation root of the problem, traditional methods have a dichotomy, Newton＇s method and so on. However,they are not the best way to engineering because the convergence is slow and low inefficient. As for these shortcomings, this paper had been proposed Wolves Algorithm to make out polynomial equation roots of the problem. It use the advantages of Wolves Algorithm computational robustness and global convergence of multiple iterations of the equation to find the optimal solution. Compared with other algorithms, there was relatively better stability and global optimization. Finally, a numerical simulation results show that the algorithm can effectively find the roots of a polynomial equation. What＇s more, it can work accurately and quickly.