# On p-adic differential equations with separation of variables

Abstract : Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This raises precision concerns: how much precision do we need on the input to compute the output accurately? In the case of ordinary differential equation with separation of variables, we apply the recent technique of differential precision to obtain optimal bounds on the stability of the Newton iteration. It applies, for example, to algorithms for manipulating algebraic numbers over finite fields, for computing isogenies between elliptic curves or for deterministically finding roots of polynomials in finite fields. The new bounds lead to significant speedups in practice.
Keywords :
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01265226
Contributor : Pierre Lairez <>
Submitted on : Sunday, January 31, 2016 - 2:32:32 PM
Last modification on : Monday, December 28, 2020 - 10:22:04 AM
Long-term archiving on: : Friday, November 11, 2016 - 10:38:25 PM

### Files

Files produced by the author(s)

### Identifiers

• HAL Id : hal-01265226, version 1

### Citation

Pierre Lairez, Tristan Vaccon. On p-adic differential equations with separation of variables. 2016. ⟨hal-01265226v1⟩

Record views