Good reduction of Puiseux series and applications

Adrien Poteaux (1, 2) , Marc Rybowicz (3)

1 CALFOR - Calcul Formel
2 LIFL - Laboratoire d'Informatique Fondamentale de Lille
3 XLIM-DMI - DMI

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.

Mots clés: Symbolic-numeric algorithm

Domaines: Calcul formel [cs.SC]

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