Finding the maximum module of the roots of a polynomial by particle swarm optimization

Authors:
Liangdong Qu;Dengxu He
Affiliations:
College of Mathematics and Computer Science, Guangxi University for Nationalities, Nanning, China;College of Mathematics and Computer Science, Guangxi University for Nationalities, Nanning, China
Venue:
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Year:
2010

Citing 3
Cited 0

Matrix analysis

Matrix analysis
Singular Values of Companion Matrices and Bounds on Zeros of Polynomials

SIAM Journal on Matrix Analysis and Applications
A mountain clustering based on improved PSO algorithm

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

After the theorem which is used to determine whether all roots of a polynomial are in unit circle is given, and two particle swarm optimizations for finding the maximum module of the roots of a polynomial based on the theorem are proposed Finally, several computer simulation results show that using these algorithms to find the maximum module of roots of a polynomial are more efficient and feasible, the convergent speed is much faster and the accuracy of results is much higher.