An Approximate Factorization of Multivariate Polynomials Using Improved PSO

摘要：

In order to avoid the premature convergence of the Particle Swarm Optimization (PSO) algorithm,a modified PSO algorithm is proposed.As an example,the improved algorithm is used for an approximate factorization of multivariate polynomials and the experiment result has proved its efficiency.The method in this paper may be as certain generalization of an precise factorization of multivariate polynomials.

关键词： Particle Swarm Optimization multivariate polynomials approximate factorization

作者: Xie Ningxin Zhou Yangquan

作者单位: College of Computer and Information Science Guangxi University for Nationalities Nanning 530006.Chin College of Computer and Information Science Guangxi University for Nationalities Nanning 530006,Chin

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 132-135

在线出版日期: 2011-02-26（万方平台首次上网日期，不代表论文的发表时间）