GPGCD

swMATH6224MaRDI QIDQ18358FDOQ18358

Author name not available (Why is that?)

Official website: http://code.google.com/p/gpgcd/

Described by source

• GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients

Cited In (11)

• Relaxed NewtonSLRA for approximate GCD
• The computation of multiple roots of a Bernstein basis polynomial
• 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
• MultRoot
• ApaTools
• SLRA
• IDENT
• 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