Details:
| Title | Relaxed Hensel lifting of triangular sets | | Author(s) | Romain Lebreton | | Type | Article in Journal | | Abstract | Abstract In this paper, we present a new lifting algorithm for triangular sets over general p-adic rings. Our contribution is to give, for any p-adic triangular set, a shifted algorithm of which the triangular set is a fixed point. Then we can apply the relaxed recursive p-adic framework and deduce a relaxed lifting algorithm for this triangular set. We compare our algorithm to the existing technique and report on implementations inside the C++ library Geomsolvex of Mathemagix (van der Hoeven et al., 2002). Our new relaxed algorithm is competitive and compare favorably on some examples. | | Keywords | Polynomial system solving, Online algorithm, Relaxed algorithm, Triangular set, Univariate representation, p-Adic integer, Power series | | ISSN | 0747-7171 |
| URL |
http://www.sciencedirect.com/science/article/pii/S0747717114000807 |
| Language | English | | Journal | Journal of Symbolic Computation | | Volume | 68, Part 2 | | Number | 0 | | Pages | 230 - 258 | | Year | 2015 | | Note | Effective Methods in Algebraic Geometry | | Edition | 0 | | Translation |
No | | Refereed |
No |
|
