Deformation techniques for sparse systems

Foundations of Computational Mathematics

Volumn 9, Issue 1, 2009, Pages 1-50

  Jeronimo, Gabriela ^a,b   Matera, Guillermo ^b,c   Solernó, Pablo ^a,b   Waissbein, Ariel ^d,e  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b Facultad de Ciencias Naturales e Instituto M Lillo   (Argentina)

^c INSTITUTO DE CIENCIAS   (Argentina)

^d CORE Security Technologies ^*  (Argentina)

^e INSTITUTO TECNOLÓGICO DE BUENOS AIRES   (Argentina)

Author keywords

Complexity; Geometric solutions; Mixed volume; Newton Hensel lifting; Non Archimedean height; Polyhedral deformations; Probabilistic algorithms; Puiseux expansions of space curves; Sparse system solving; Symbolic homotopy algorithms

Indexed keywords

COMPLEXITY; HOMOTOPY ALGORITHMS; MIXED VOLUME; NEWTON-HENSEL LIFTING; NON-ARCHIMEDEAN HEIGHT; PROBABILISTIC ALGORITHM; SPACE CURVE; SPARSE SYSTEMS;

ALGORITHMS;

DEFORMATION;

EID: 58849154685     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-008-9024-2     Document Type: Article

References (61)

1. E.L. Allgower, K. Georg, Numerical Continuation Methods: An Introduction. Springer Ser. Comput. Math., vol. 13 (Springer, New York, 1990).
2. M.E. Alonso, E. Becker, M.-F. Roy, T. Wörmann, Zeros, multiplicities and idempotents for zero-dimensional systems, in Algorithms in Algebraic Geometry and Applications, Proceedings of MEGA'94. Prog. Math., vol. 143 (Birkhäuser, Boston, 1996), pp. 1-15.
3. J.L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity I. Monogr. Theor. Comput. Sci. EATCS Ser., vol. 11 (Springer, Berlin, 1988).
4. W. Baur V. Strassen 1983 The complexity of partial derivatives Theor. Comput. Sci. 22 317 330
5. D.N. Bernstein 1975 The number of roots of a system of equations Funct. Anal. Appl. 9 183 185
6. D. Bini, V. Pan, Polynomial and Matrix Computations. Progress in Theoretical Computer Science (Birkhäuser, Boston, 1994).
7. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation (Springer, New York, 1998).
8. A. Bompadre G. Matera R. Wachenchauzer A. Waissbein 2004 Polynomial equation solving by lifting procedures for ramified fibers Theoret. Comput. Sci. 315 2-3 335 369
9. A. Bostan, G. Lecerf, E. Schost, Tellegen's principle into practice, in Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'03), Philadelphia, PA, 3-6 August 2003, ed. by J.R. Sendra (ACM Press, New York, 2003), pp. 37-44.
10. A. Bostan E. Schost 2005 Polynomial evaluation and interpolation on special sets of points J. Complexity 21 4 420 446
11. P. Bürgisser, M. Clausen, M.A. Shokrollahi, Algebraic Complexity Theory. Grundlehren Math. Wiss., vol. 315 (Springer, Berlin, 1997).
12. A. Cafure, G. Matera, A. Waissbein, Inverting bijective polynomial maps over finite fields, in Proceedings of the 2006 Information Theory Workshop, ITW2006, Punta del Este, Uruguay, 13-17 March 2006, ed. by G. Seroussi, A. Viola (IEEE Information Theory Society, New York, 2006), pp. 27-31.
13. D. Castro M. Giusti J. Heintz G. Matera L.M. Pardo 2003 The hardness of polynomial equation solving Found. Comput. Math. 3 4 347 420
14. D. Cox, J. Little, D. O'Shea, Using Algebraic Geometry. Grad. Texts in Math., vol. 185 (Springer, New York, 1998).
15. J.-P. Dedieu, Condition number analysis for sparse polynomial systems, in Foundations of Computational Mathematics, Rio de Janeiro, 1997, ed. by F. Cucker, M. Shub (Springer, Berlin, 1997), pp. 267-276.
16. C. Durvye, G. Lecerf, A concise proof of the Kronecker polynomial system solver from scratch, Exp. Math. (2006, in press). doi: 10.1016/j.expmath.2007. 07.001.
17. I.Z. Emiris J. Canny 1995 Efficient incremental algorithms for the sparse resultant and the mixed volume J. Symb. Comput. 20 117 149
18. G. Ewald, Combinatorial Convexity and Algebraic Geometry. Grad. Texts in Math., vol. 168 (Springer, New York, 1996).
19. I.M. Gelfand, M.M. Kapranov, A.V. Zelevinsky, Discriminants, Resultants, and Multidimensional Determinants (Birkhäuser, Boston, 1994).
20. M. Giusti K. Hägele J. Heintz J.E. Morais J.L. Montaña L.M. Pardo 1997 Lower bounds for Diophantine approximation J. Pure Appl. Algebra 117-118 277 317
21. M. Giusti J. Heintz J.E. Morais J. Morgenstern L.M. Pardo 1998 Straight-line programs in geometric elimination theory J. Pure Appl. Algebra 124 101 146
22. M. Giusti G. Lecerf B. Salvy 2001 A Gröbner free alternative for polynomial system solving J. Complex. 17 1 154 211
23. J. Heintz, On the computational complexity of polynomials and bilinear maps, in Proceedings of the 5th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-5, Menorca, Spain, 15-19 June 1987, ed. by L. Huguet, A. Poli. Lecture Notes in Comput. Sci., vol. 356 (Springer, Berlin, 1989), pp. 269-300.
24. J. Heintz, G. Jeronimo, J. Sabia, P. Solernó, Intersection theory and deformation algorithms. The multihomogeneous case, Manuscript, Universidad de Buenos Aires, 2002.
25. J. Heintz T. Krick S. Puddu J. Sabia A. Waissbein 2000 Deformation techniques for efficient polynomial equation solving J. Complex. 16 1 70 109
26. B. Huber B. Sturmfels 1995 A polyhedral method for solving sparse polynomial systems Math. Comput. 64 212 1541 1555
27. B. Huber B. Sturmfels 1997 Bernstein's theorem in affine space Discrete Comput. Geom. 17 137 141
28. G. Jeronimo T. Krick J. Sabia M. Sombra 2004 The computational complexity of the Chow form Found. Comput. Math. 4 1 41 117
29. A.G. Khovanski 1978 Newton polyhedra and the genus of complete intersections Funct. Anal. Appl. 12 38 46
30. A.G. Kushnirenko 1976 Newton polytopes and the Bézout theorem Funct. Anal. Appl. 10 233 235
31. G. Lecerf 2002 Quadratic Newton iteration for systems with multiplicity Found. Comput. Math. 2 3 247 293
32. G. Lecerf 2003 Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers J. Complex. 19 4 564 596
33. T.-Y. Li X. Li 2001 Finding mixed cells in the mixed volume computation Found. Comput. Math. 1 2 161 181
34. T.Y. Li 1997 Numerical solution of multivariate polynomial systems by homotopy continuation methods Acta Numer. 6 399 436
35. n Math. Comput. 65 216 1477 1484
36. G. Malajovich J.M. Rojas 2004 High probability analysis of the condition number of sparse polynomial systems Theor. Comput. Sci. 315 2-3 525 555
37. A. Morgan, Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems (Prentice-Hall, Englewood Cliffs, 1987).
38. A. Morgan A. Sommese C. Wampler 1995 A generic product-decomposition formula for Bézout numbers SIAM J. Numer. Anal. 32 1308 1325
39. M. Oka, Non-Degenerate Complete Intersection Singularity (Hermann, Paris, 1997).
40. L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, in Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proceedings of AAECC-11, ed. by G. Cohen, M. Giusti, T. Mora. Lecture Notes in Comput. Sci., vol. 948 (Springer, Berlin, 1995), pp. 33-69.
41. L.M. Pardo J. San Martín 2004 Deformation techniques to solve generalized Pham systems Theoret. Comput. Sci. 315 2-3 593 625
42. P. Pedersen B. Sturmfels 1993 Product formulas for resultants and Chow forms Math. Z. 214 3 377 396
43. P. Philippon, M. Sombra, Hauteur normalisée des variétés toriques projectives, J. Inst. Math. Jussieu (2003, in press). doi: 10.1017/S1474748007000138, 35pp., eprint math.NT/0406476.
44. P. Philippon M. Sombra 2005 Géométrie Diophantienne et variétés toriques C. R. Math. Acad. Sci. Paris 340 507 512
45. P. Philippon, M. Sombra, A refinement of the Kušnirenko- Bernštein estimate, Manuscript, 2006. arXiv:0709.3306.
46. J.M. Rojas 1999 Solving degenerate sparse polynomial systems faster J. Symbolic Comput. 28 1/2 155 186
47. J.M. Rojas, Algebraic geometry over four rings and the frontier of tractability, in Proceedings of a Conference on Hilbert's Tenth Problem and Related Subjects, University of Gent, 1-5 November 1999, ed. by J. Denef et al. Contemp. Math., vol. 270 (AMS, Providence, 2000), pp. 275-321
48. J.M. Rojas, Why polyhedra matter in non-linear equation solving, in Proceedings of the Conference on Algebraic Geometry and Geometric Modelling, Vilnius, Lithuania, 29 July-2 August 2002. Contemp. Math., vol. 334 (AMS, Providence, 2003), pp. 293-320.
49. J.M. Rojas X. Wang 1996 Counting affine roots of polynomial systems via pointed Newton polytopes J. Complex. 12 2 116 133
50. J. Sabia P. Solernó 1996 Bounds for traces in complete intersections and degrees in the Nullstellensatz Appl. Algebra Eng. Commun. Comput. 6 6 353 376
51. J.E. Savage, Models of Computation. Exploring the Power of Computing (Addison-Wesley, Reading, 1998).
52. E. Schost 2003 Computing parametric geometric resolutions Appl. Algebra Eng. Commun. Comput. 13 349 393
53. A. Sommese, C. Wampler, The Numerical Solution of Systems of Polynomials Arising in Engineering and Science (World Scientific, Singapore, 2005).
54. A. Storjohann, Algorithms for matrix canonical forms, Ph.D. thesis, ETH, Zürich, Switzerland, 2000.
55. V. Strassen, Algebraic complexity theory, in Handbook of Theoretical Computer Science, ed. by J. van Leeuwen (Elsevier, Amsterdam, 1990), pp. 634-671.
56. J. Verschelde K. Gatermann R. Cools 1996 Mixed volume computation by dynamic lifting applied to polynomial system solving Discrete Comput. Geom. 16 1 69 112
57. J. Verschelde P. Verlinden R. Cools 1994 Homotopies exploiting Newton polytopes for solving sparse polynomial systems SIAM J. Numer. Anal. 31 3 915 930
58. J. von zur Gathen, Parallel arithmetic computations: a survey, in Proceedings of the 12th International Symposium on Mathematical Foundations of Computer Science, Bratislava, Czechoslovakia, 25-29 August 1986, ed. by J. Gruska, B. Rovan, J. Wiedermann. Lecture Notes in Comput. Sci., vol. 233 (Springer, Berlin, 1986), pp. 93-112.
59. J. von zur Gathen, J. Gerhard, Modern Computer Algebra (Cambridge University Press, Cambridge, 1999).
60. R.J. Walker, Algebraic Curves (Dover, New York, 1950).
61. R. Zippel, Effective Polynomial Computation. Kluwer Int. Ser. Eng. Comput. Sci., vol. 241 (Kluwer, Dordrecht, 1993).