Computing Nearest Gcd with Certification

Guillaume Chèze 1 Jean-Claude Yakoubsohn 1 André Galligo 2 Bernard Mourrain 2
2 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis, CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : A bisection method, based on exclusion and inclusion tests, is used to address the nearest univariate gcd problem formulated as a bivariate real minimization problem of a rational fraction. The paper presents an algorithm, a first implementation and a complexity analysis relying on Smale's $\alpha$-theory. We report its behavior on an illustrative example.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/inria-00437559
Contributor : Bernard Mourrain <>
Submitted on : Monday, November 30, 2009 - 10:01:22 PM
Last modification on : Friday, October 11, 2019 - 8:22:40 PM
Long-term archiving on : Thursday, June 17, 2010 - 10:51:43 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00437559, version 1

Citation

Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain. Computing Nearest Gcd with Certification. International Workshop Symbolic-Numeric Computation (SNC), Aug 2009, Kyoto, Japan. pp.29-34. ⟨inria-00437559⟩

Share

Metrics

Record views

672

Files downloads

312