Pages that link to "Item:Q3105519"
From MaRDI portal
The following pages link to The numerical greatest common divisor of univariate polynomials (Q3105519):
Displaying 12 items.
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- Affine equivalences of trigonometric curves (Q829601) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← 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)
- Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors (Q5002188) (← 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)
- A Newton’s iteration converges quadratically to nonisolated solutions too (Q6133447) (← links)
