Computing nearest gcd with certification

DOI10.1145/1577190.1577200MaRDI QIDQ2959015zbMATH OpenOpenAlexFDO

Authors Guillaume Chèze, Jean-Claude Yakoubsohn, Bernard Mourrain, André Galligo

Publication date 3 February 2017

Published in Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1577190.1577200

zbMATH Keywords

\(\alpha\)-theoryapproximate gcdbisectionexclusion

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• A subdivision method for computing nearest gcd with certification
• scientific article; zbMATH DE number 953021
• Certified approximate univariate GCDs
• scientific article; zbMATH DE number 1254271
• A heuristic verification of the degree of the approximate GCD of two univariate polynomials

Cited in

(3)

• A quadratically convergent algorithm for structured low-rank approximation
• On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
• A subdivision method for computing nearest gcd with certification

This page was built for publication: Computing nearest gcd with certification

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