Communication Dans Un Congrès Année : 2009

Computing Nearest Gcd with Certification

Résumé

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.

Fichier principal
Vignette du fichier
main.pdf (192.69 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

inria-00437559 , version 1 (30-11-2009)

Licence

Identifiants

  • HAL Id : inria-00437559 , version 1

Citer

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⟩
596 Consultations
663 Téléchargements

Partager

  • More