基于改进粒子群算法的多元多项式近似分解

2012 International Conference on Computer Science and Information Processing (CSIP) Pub Date : 2012-09-24 DOI:10.1109/CSIP.2012.6309064

Xie Ningxin, Zhou Yangquan

{"title":"基于改进粒子群算法的多元多项式近似分解","authors":"Xie Ningxin, Zhou Yangquan","doi":"10.1109/CSIP.2012.6309064","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An approximate factorization of multivariate polynomials using improved PSO\",\"authors\":\"Xie Ningxin, Zhou Yangquan\",\"doi\":\"10.1109/CSIP.2012.6309064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":193335,\"journal\":{\"name\":\"2012 International Conference on Computer Science and Information Processing (CSIP)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Computer Science and Information Processing (CSIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSIP.2012.6309064\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Computer Science and Information Processing (CSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSIP.2012.6309064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

为了避免粒子群优化算法的过早收敛，提出了一种改进的粒子群优化算法。将改进算法应用于多元多项式的近似分解，实验结果证明了改进算法的有效性。本文的方法可以看作是多元多项式精确分解的某种推广。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 International Conference on Computer Science and Information Processing (CSIP)

自引率

0.00%

发文量