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.

Saved in:
Bibliographic Details
Published in:ACM communications in computer algebra 2021-09, Vol.55 (3), p.77-81
Main Authors: Belhaj, Skander, Alsulami, Abdulrahman
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1932-2240
DOI:10.1145/3511528.3511532