Approximate greatest common divisor of several polynomials from Hankel matrices

Author:

Belhaj Skander1,Alsulami Abdulrahman1

Affiliation:

1. University of Jeddah, Saudi Arabia

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Microbiology (medical),Immunology,Immunology and Allergy

Reference14 articles.

1. Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices

2. Matrix representation of the shifting operation and numerical properties of the {ERES} method for computing the greatest common divisor of sets of many polynomials;Christou D.;Journal of Computational and Applied Mathematics,2014

3. The singular value decomposition for polynomial systems

4. <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials

5. Barnett’s Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3