Skip to Main content Skip to Navigation
Conference papers

Relaxed Hensel lifting of triangular sets

Romain Lebreton 1, 2
2 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : In this paper, we present a new lifting algorithm for triangular sets over power series. Our contribution is to give, for any power series triangular set, a shifted algorithm of which the triangular set is a fixed point. Then we can apply the relaxed recursive power series framework and deduce a relaxed lifting algorithm for this triangular set. We compare our algorithm to the existing techniques. Our algorithm always improves the asymptotic cost in the precision for the special case of univariate representations.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Romain Lebreton <>
Submitted on : Thursday, March 3, 2016 - 11:41:37 AM
Last modification on : Thursday, March 5, 2020 - 6:27:59 PM
Long-term archiving on: : Saturday, June 4, 2016 - 10:50:43 AM


Files produced by the author(s)


  • HAL Id : lirmm-01282077, version 1



Romain Lebreton. Relaxed Hensel lifting of triangular sets. MEGA: Effective Methods in Algebraic Geometry, Jun 2013, Frankfurt, Germany. ⟨lirmm-01282077⟩



Record views


Files downloads