The GPGCD Algorithm with the B\'ezout Matrix for Multiple Univariate Polynomials
Commutative Algebra
2022-05-09 v1 Numerical Analysis
Symbolic Computation
Numerical Analysis
Abstract
We propose a modification of the GPGCD algorithm, which has been presented in our previous research, for calculating approximate greatest common divisor (GCD) of more than 2 univariate polynomials with real coefficients and a given degree. In transferring the approximate GCD problem to a constrained minimization problem, different from the original GPGCD algorithm for multiple polynomials which uses the Sylvester subresultant matrix, the proposed algorithm uses the B\'ezout matrix. Experiments show that the proposed algorithm is more efficient than the original GPGCD algorithm for multiple polynomials with maintaining almost the same accuracy for most of the cases.
Cite
@article{arxiv.2205.02984,
title = {The GPGCD Algorithm with the B\'ezout Matrix for Multiple Univariate Polynomials},
author = {Boming Chi and Akira Terui},
journal= {arXiv preprint arXiv:2205.02984},
year = {2022}
}