GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients

zbMath1186.65063arXiv1007.1834MaRDI QIDQ5188250

Akira Terui

Publication date: 10 March 2010

Full work available at URL: https://arxiv.org/abs/1007.1834

zbMATH Keywords

algorithmnumerical examplesgreatest common divisoriterative methodNewton methodconstrained minimization problemgradient-projection methodpolynomials with complex coefficients

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Polynomials in general fields (irreducibility, etc.) (12E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)

Related Items (4)

GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ GPGCD

Uses Software

• MultRoot

This page was built for publication: GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients