Authors: Carine Pivoteau ¹; Bruno Salvy ²; Michèle Soria ¹

• 1 Algorithmes, Programmes et Résolution
• 2 Algorithms

Boltzmann random generation applies to well-defined systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence. We show that the combinatorial systems translate into numerical iteration schemes that provide such oracles. In particular, we give a fast oracle based on Newton iteration.