Hankel矩阵中几个多项式的近似最大公约数

IF 0.4 Q4 MATHEMATICS, APPLIED ACM Communications in Computer Algebra Pub Date : 2021-09-01 DOI:10.1145/3511528.3511532

S. Belhaj, Abdulrahman Alsulami

{"title":"Hankel矩阵中几个多项式的近似最大公约数","authors":"S. Belhaj, Abdulrahman Alsulami","doi":"10.1145/3511528.3511532","DOIUrl":null,"url":null,"abstract":"This paper is devoted to present a new method for computing the approximate Greatest Common Divisor (GCD) of several polynomials (not pairwise) from the generalized Hankel matrix. Our approach based on the calculation of cofactors is tested for several sets of polynomials.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"55 1","pages":"77 - 81"},"PeriodicalIF":0.4000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximate greatest common divisor of several polynomials from Hankel matrices\",\"authors\":\"S. Belhaj, Abdulrahman Alsulami\",\"doi\":\"10.1145/3511528.3511532\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is devoted to present a new method for computing the approximate Greatest Common Divisor (GCD) of several polynomials (not pairwise) from the generalized Hankel matrix. Our approach based on the calculation of cofactors is tested for several sets of polynomials.\",\"PeriodicalId\":41965,\"journal\":{\"name\":\"ACM Communications in Computer Algebra\",\"volume\":\"55 1\",\"pages\":\"77 - 81\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2021-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Communications in Computer Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3511528.3511532\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Communications in Computer Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3511528.3511532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

本文给出了一种从广义Hankel矩阵求非成对多项式的近似最大公约数的新方法。我们基于协因子计算的方法在几组多项式上进行了测试。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Approximate greatest common divisor of several polynomials from Hankel matrices

This paper is devoted to present a new method for computing the approximate Greatest Common Divisor (GCD) of several polynomials (not pairwise) from the generalized Hankel matrix. Our approach based on the calculation of cofactors is tested for several sets of polynomials.

求助全文

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

来源期刊