Computing nearest Gcd with certification

DOI10.1145/1577190.1577200zbMath1356.68273OpenAlexW2095373910MaRDI QIDQ2959015

Mourrain, Bernard, Guillaume Chèze, Jean-Claude Yakoubsohn, Andre 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

bisectionexclusionapproximate gcd\(\alpha\)-theory

Mathematics Subject Classification ID

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

Related Items (3)

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

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