Approximate GCD of several univariate polynomials with small degree perturbations
DOI10.1016/J.JSC.2011.09.005zbMATH Open1246.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
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
Groebner basisapproximate computationgeneric initial idealEEAGCD of univariate polynomialsminimal syzygiesnormal degree sequence
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Fully homomorphic encryption over the integers
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Structure of μ-Classes
- The moving line ideal basis of planar rational curves
- On approximate GCDs of 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
- Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
- A direct approach to computing the \(\mu\)-basis of planar rational curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- Title not available (Why is that?)
- Approximate polynomial GCD: small degree and small height perturbations
Cited In (8)
- Approximate Polynomial gcd: Small Degree and Small Height Perturbations
- Approximate GCD and its application to ill-conditioned algebraic equations
- On the greatest common divisor of shifted sets
- Approximate polynomial GCD: small degree and small height perturbations
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- Rational Hausdorff divisors: a new approach to the approximate parametrization of curves
- Overdetermined Weierstrass iteration and the nearest consistent system
- Approximate GCD of multivariate polynomials
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)
