Loading [MathJax]/jax/output/HTML-CSS/jax.js
Communication Dans Un Congrès Année : 2013

Rational Univariate Representations of Bivariate Systems and Applications

Résumé

We address the problem of solving systems of two bivariate polynomials of total degree at most d with integer coefficients of maximum bitsize τ. We suppose known a linear separating form (that is a linear combination of the variables that takes different values at distinct solutions of the system) and focus on the computation of a Rational Univariate Representation (RUR). We present an algorithm for computing a RUR with worst-case bit complexity in \sOB(d7+d6τ) and bound the bitsize of its coefficients by \sO(d2+dτ) (where OB refers to bit complexities and \sO to complexities where polylogarithmic factors are omitted). We show in addition that isolating boxes of the solutions of the system can be computed from the RUR with \sOB(d8+d7τ) bit operations. Finally, we show how a RUR can be used to evaluate the sign of a bivariate polynomial (of degree at most d and bitsize at most τ) at one real solution of the system in \sOB(d8+d7τ) bit operations and at all the Θ(d2) solutions in only O(d) times that for one solution.
Fichier principal
Vignette du fichier
Issac13_rur_complexity.pdf (319) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00809430 , version 1 (09-04-2013)

Identifiants

  • HAL Id : hal-00809430 , version 1

Citer

Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier. Rational Univariate Representations of Bivariate Systems and Applications. ISSAC - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.109-116. ⟨hal-00809430⟩
341 Consultations
285 Téléchargements

Partager

More