Pages that link to "Item:Q385007"

The following pages link to GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007):

Displayed 8 items.

• 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)
• 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)
• SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) ‎ (← links)
• Structured low-rank approximation for nonlinear matrices (Q6109889) ‎ (← links)