The task of determining the roots of a polynomial equation has been prosed as an optimization problem. Particle swarm optimization algorithm has been applied to approximate the roots of polynomial equations of second and higher degrees. Two versions of PSO, Global-best and Local-best, have been implemented and a comparison of their performances is presented in terms of number of iterations to convergence, computation time and mean square error between expected and obtained roots.
Particle Swarm Optimization, Quadratic Equation, Fitness Function, Swarm Intelligence
