基于扩展自身构造的EZ-GCD算法改进

ACM Commun. Comput. Algebra Pub Date : 2019-05-30 DOI:10.1145/3338637.3338649

Masaru Sanuki

{"title":"基于扩展自身构造的EZ-GCD算法改进","authors":"Masaru Sanuki","doi":"10.1145/3338637.3338649","DOIUrl":null,"url":null,"abstract":"In [2], we proposed the EZ-GCD algorithm based on extended Hensel construction, in order to compute the GCD of multivariate polynomials. The extended Hensel construction is a specify factorization into algebraic function, and it is efficient for sparse multivariate polynomials. However, it is slower than Maple's GCD routine. In this paper, we improve our EZ-GCD algorithm efficiency.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"35 1","pages":"148-150"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improvement of EZ-GCD algorithm based on extended hensel construction\",\"authors\":\"Masaru Sanuki\",\"doi\":\"10.1145/3338637.3338649\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In [2], we proposed the EZ-GCD algorithm based on extended Hensel construction, in order to compute the GCD of multivariate polynomials. The extended Hensel construction is a specify factorization into algebraic function, and it is efficient for sparse multivariate polynomials. However, it is slower than Maple's GCD routine. In this paper, we improve our EZ-GCD algorithm efficiency.\",\"PeriodicalId\":7093,\"journal\":{\"name\":\"ACM Commun. Comput. Algebra\",\"volume\":\"35 1\",\"pages\":\"148-150\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Commun. Comput. Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3338637.3338649\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Commun. Comput. Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3338637.3338649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在[2]中，我们提出了基于扩展Hensel构造的EZ-GCD算法，用于计算多元多项式的GCD。扩展Hensel构造是一种分解成代数函数的方法，对于稀疏多元多项式是有效的。然而，它比Maple的GCD例程慢。本文改进了EZ-GCD算法的效率。

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

查看原文本刊更多论文

Improvement of EZ-GCD algorithm based on extended hensel construction

In [2], we proposed the EZ-GCD algorithm based on extended Hensel construction, in order to compute the GCD of multivariate polynomials. The extended Hensel construction is a specify factorization into algebraic function, and it is efficient for sparse multivariate polynomials. However, it is slower than Maple's GCD routine. In this paper, we improve our EZ-GCD algorithm efficiency.

求助全文

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

来源期刊

ACM Commun. Comput. Algebra

自引率

0.00%

发文量