GPGCD

swMATH6224MaRDI QIDQ18358FDOQ18358

Author name not available (Why is that?)

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

Cited In (8)

• The Computation of Multiple Roots of a Bernstein Basis Polynomial
• Relaxed NewtonSLRA for approximate GCD
• GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
• Variable projection methods for approximate (greatest) common divisor computations
• 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 of univariate polynomials
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility

This page was built for software: GPGCD