The numerical greatest common divisor of univariate polynomials
From MaRDI portal
Publication:3105519
zbMath1236.65051arXiv2103.04196MaRDI QIDQ3105519
Publication date: 5 January 2012
Full work available at URL: https://arxiv.org/abs/2103.04196
Polynomials in real and complex fields: factorization (12D05) Algebraic number theory computations (11Y40) Polynomials, factorization in commutative rings (13P05) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Numerical computation of roots of polynomial equations (65H04)
Related Items (13)
Affine equivalences of trigonometric curves ⋮ Relaxed NewtonSLRA for approximate GCD ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ A Newton’s iteration converges quadratically to nonisolated solutions too ⋮ Approximate square-free part and decomposition ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility ⋮ Variable projection methods for approximate (greatest) common divisor computations
Uses Software
This page was built for publication: The numerical greatest common divisor of univariate polynomials
