GPGCD

swMATH6224MaRDI QIDQ18358

No author found.

Described by source

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

Related Items (8)

Relaxed NewtonSLRA for approximate GCD ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility ⋮ Variable projection methods for approximate (greatest) common divisor computations

This page was built for software: GPGCD