Approximate GCD of several univariate polynomials with small degree perturbations

DOI10.1016/j.jsc.2011.09.005zbMath1246.13040OpenAlexW2053419661MaRDI QIDQ412204

Luu Ba Thang, Mohamed Elkadi, Andre Galligo

Publication date: 4 May 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.09.005

zbMATH Keywords

Groebner basisapproximate computationgeneric initial idealEEAGCD of univariate polynomialsminimal syzygiesnormal degree sequence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (3)

Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Rational Hausdorff divisors: a new approach to the approximate parametrization of curves ⋮ On the greatest common divisor of shifted sets

Cites Work

• Approximate polynomial GCD: small degree and small height perturbations
• The moving line ideal basis of planar rational curves
• On approximate GCDs of univariate polynomials
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Certified approximate univariate GCDs
• Computation of approximate polynomial GCDs and an extension
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Fully Homomorphic Encryption over the Integers
• On the Structure of μ-Classes
• A direct approach to computing the \(\mu\)-basis of planar rational curves
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate GCD of several univariate polynomials with small degree perturbations