Relaxed Hensel lifting of triangular sets

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.

[1]  Joris van der Hoeven.  Newton's method and FFT trading , 2010, J. Symb. Comput..

[2]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

[3]  Daniel Lazard,et al.  A new method for solving algebraic systems of positive dimension , 1991, Discret. Appl. Math..

[4]  Joris van der Hoeven,et al.  Relax, but Don't be Too Lazy , 2002, J. Symb. Comput..

[5]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[6]  Matthias Schröder,et al.  Fast Online Multiplication of Real Numbers , 1997, STACS.

[7]  Lars Langemyr.  Algorithms for a Multiple Algebraic Extension II , 1991 .

[8]  Marc Moreno Maza,et al.  Fast arithmetic for triangular sets: from theory to practice , 2007, ISSAC '07.

[9]  Erich Kaltofen,et al.  ON THE COMPLEXITY OF COMPUTING DETERMINANTS , 2001 .

[10]  Éric Schost,et al.  Power series solutions of singular (q)-differential equations , 2012, ISSAC.

[11]  F. C. Hennie,et al.  On-Line Turing Machine Computations , 1966, IEEE Trans. Electron. Comput..

[12]  Joos Heintz,et al.  Algorithmes – disons rapides – pour la décomposition d’une variété algébrique en composantes irréductibles et équidimensionnelles , 1991 .

[13]  Lars Langemyr.  Algorithms for a Multiple Algebraic Extension II , 1991, AAECC.

[14]  Martin Fürer.  Faster integer multiplication , 2007, STOC '07.

[15]  Michael Kalkbrener,et al.  A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties , 1993, J. Symb. Comput..

[16]  Wenjun Wu,et al.  Basic principles of mechanical theorem proving in elementary geometries , 1986, Journal of Automated Reasoning.

[17]  Patrizia M. Gianni,et al.  Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases , 1987, AAECC.

[18]  Fabrice Rouillier,et al.  Solving Zero-Dimensional Systems Through the Rational Univariate Representation , 1999, Applicable Algebra in Engineering, Communication and Computing.

[19]  E H Winslow.  Lifting techniques. , 1983, Nursing research.

[20]  Éric Schost,et al.  A simple and fast online power series multiplication and its analysis , 2016, J. Symb. Comput..

[21]  Anindya De,et al.  Fast integer multiplication using modular arithmetic , 2008, STOC.

[22]  Marc Giusti,et al.  Le rôle des structures de données dans les problèmes d'élimination , 1997 .

[23]  Éric Schost,et al.  Complexity results for triangular sets , 2003, J. Symb. Comput..

[24]  Jérémy Berthomieu,et al.  Relaxed p-adic Hensel lifting for algebraic systems , 2012, ISSAC.

[25]  L. Kronecker.  Grundzüge einer arithmetischen Theorie der algebraische Grössen. , 2022 .

[26]  Romain Lebreton.  Contributions à l'algorithmique détendue et à la résolution des systèmes polynomiaux. (Contributions to relaxed algorithms and polynomial system solving) , 2012 .

[27]  Marc Moreno Maza,et al.  Lifting techniques for triangular decompositions , 2005, ISSAC.

[28]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[29]  Marc Giusti,et al.  A Gröbner Free Alternative for Polynomial System Solving , 2001, J. Complex..

[30]  Stephen M. Watt,et al.  A Fixed Point Method for Power Series Computation , 1988, ISSAC.

[31]  Xin Jin,et al.  Change of order for regular chains in positive dimension , 2008, Theor. Comput. Sci..

[32]  Joris van der Hoeven,et al.  Faster relaxed multiplication , 2014, ISSAC.

[33]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[34]  Wu Wen-tsun.  Basic principles of mechanical theorem proving in elementary geometries , 1986 .

[35]  Michael J. Fischer,et al.  Fast On-Line Integer Multiplication , 1974, J. Comput. Syst. Sci..

[36]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[37]  A. J. Stothers.  On the complexity of matrix multiplication , 2010 .

[38]  Marc Giusti,et al.  Lower bounds for diophantine approximations , 1997 .

[39]  Marc Moreno Maza,et al.  On the complexity of the D5 principle , 2005, SIGS.

[40]  Erich Kaltofen,et al.  On computing determinants of matrices without divisions , 1992, ISSAC '92.

[41]  Joos Heintz,et al.  On the Time–Space Complexity of Geometric Elimination Procedures , 2001, Applicable Algebra in Engineering, Communication and Computing.

[42]  Joris van der Hoeven,et al.  Homotopy techniques for multiplication modulo triangular sets , 2009, J. Symb. Comput..

[43]  Erich Kaltofen,et al.  On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

[44]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[45]  Palaiseau Cedex,et al.  Computing Parametric Geometric Resolutions , 2001 .

[46]  Marc Moreno Maza,et al.  On the Theories of Triangular Sets , 1999, J. Symb. Comput..

[47]  J. V. D. Hoeven,et al.  Relaxed algorithms for p-adic numbers , 2011 .

[48]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[49]  Joris van der Hoeven.  New algorithms for relaxed multiplication , 2007, J. Symb. Comput..

[50]  Joris van der Hoeven,et al.  Lazy multiplication of formal power series , 1997, ISSAC.

[51]  Éric Schost,et al.  Degree bounds and lifting techniques for triangular sets , 2002, ISSAC '02.

[52]  L. Kronecker.  Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Abdruck einer Festschrift zu Herrn E. E. Kummers Doctor-Jubiläum, 10. September 1881.). , 2022 .