The following pages link to GPGCD (Q18358):
Displayed 8 items.
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)