Skip to Main content Skip to Navigation
Journal articles

Good reduction of Puiseux series and applications

Adrien Poteaux 1, 2 Marc Rybowicz 3
1 CALFOR - Calcul Formel
LIFL - Laboratoire d'Informatique Fondamentale de Lille
Abstract : We have designed a new symbolic-numeric strategy for computing efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well-chosen prime number p are used to obtain the exact information needed to guide floating point computations. In this paper, we detail the symbolic part of our algorithm. First of all, we study modular reduction of Puiseux series and give a good reduction criterion for ensuring that the information required by the numerical part is preserved. To establish our results, we introduce a simple modification of classical Newton polygons, that we call "generic Newton polygons", which turns out to be very convenient. Finally, we estimate the size of good primes obtained with deterministic and probabilistic strategies. Some of these results were announced without proof at ISSAC'08.
Document type :
Journal articles
Complete list of metadata

Cited literature [42 references]  Display  Hide  Download
Contributor : Adrien Poteaux Connect in order to contact the contributor
Submitted on : Friday, May 24, 2013 - 5:08:37 PM
Last modification on : Wednesday, December 22, 2021 - 11:58:03 AM
Long-term archiving on: : Tuesday, April 4, 2017 - 11:19:32 AM


Files produced by the author(s)




Adrien Poteaux, Marc Rybowicz. Good reduction of Puiseux series and applications. Journal of Symbolic Computation, Elsevier, 2012, 47 (1), pp.32 - 63. ⟨10.1016/j.jsc.2011.08.008⟩. ⟨hal-00825850⟩



Les métriques sont temporairement indisponibles