Approximate GCD of several univariate polynomials with small degree perturbations

DOI10.1016/J.JSC.2011.09.005zbMATH1246.13040OpenAlexW2053419661MaRDI QIDQ412204FDOQ412204

Authors Mohamed Elkadi, Luu Ba Thang, André 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)

Recommendations

• On approximate GCDs of univariate polynomials
• Approximate Polynomial gcd: Small Degree and Small Height Perturbations
• Approximate polynomial GCD: small degree and small height perturbations
• Approximate GCD of multivariate polynomials
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Toward the best algorithm for approximate GCD of univariate polynomials
• The approximate GCD of inexact polynomials
• Computation of approximate polynomial GCDs and an extension
• An iterative method for calculating approximate GCD of univariate polynomials
• Computing approximate GCD of multivariate polynomials

Cites work

• scientific article; zbMATH DE number 62668 (Why is no real title available?)
• scientific article; zbMATH DE number 3465689 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• A direct approach to computing the \(\mu\)-basis of planar rational curves
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Approximate polynomial GCD: small degree and small height perturbations
• Certified approximate univariate GCDs
• Computation of approximate polynomial GCDs and an extension
• Fully homomorphic encryption over the integers
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• On approximate GCDs of univariate polynomials
• On the Structure of μ-Classes
• Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
• The moving line ideal basis of planar rational curves

Cited in

(8)

• Approximate GCD and its application to ill-conditioned algebraic equations
• On the greatest common divisor of shifted sets
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Approximate polynomial GCD: small degree and small height perturbations
• Rational Hausdorff divisors: a new approach to the approximate parametrization of curves
• Approximate GCD of multivariate polynomials
• Approximate Polynomial gcd: Small Degree and Small Height Perturbations
• Overdetermined Weierstrass iteration and the nearest consistent system

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412204)