Efficient incremental algorithms for the sparse resultant and the mixed volume

Journal of Symbolic Computation

Volumn 20, Issue 2, 1995, Pages 117-149

  Emiris, Ioannis Z ^a   Canny, John F ^b  

^a INRIA   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000348667     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1995.1041     Document Type: Article

References (69)

1. Aho, A.V., Hopcroft, J.E. and Ullman, J.D. (1974). The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wes ley.
2. Auzinger, W. and Stetter, H.J. (1988). An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. In Proc. Intern. Conf. On Numerical Math., Intern. Series of Numerical Math. 86, pages 12-30, Basel: Birkhäuser Verlag.
3. Backelin, J. and Fröberg, R. (1991). How we proved that there are exactly 924 cyclic 7-roots. In Proc. ACM Intern. Symp. On Symbolic and Algebraic Computation, Bonn. pp. 103-111.
4. Bajaj, C., Garrity, T. and Warren, J. (1988). On the applications of multi-equational resultants. Technical Report 826. Purdue University.
5. Bernstein, D.N. (1975). The number of roots of a system of equations. Fund. Anal, and Appl., 9 183-185.
6. Betke, U, (1992). Mixed volumes of polytopes. Arch, der Math., 58, 388-391.
7. Billera, L.J. and Sturmfels, B. (1992). Fiber polytopes. Annals of Math., 135. 527-549.
8. Björck, G. and Fröberg, R. (1991). A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic n-roots. J. Symbolic Computation, 12, 329-336.
9. Björck, G. and Fröberg, R. (1994). Methods to “divide out” certain solutions from systems of algebraic equations, applied to find all cyclic 8-roots. Manuscript, Dept, of Math., Stockholm University.
10. n whose Fourier transforms have constant modulus, and “cyclic n-roots”. In J. S. Byrnes and J. F. Byrnes, editors, Recent Advances in Fourier Analysis and Its Applications Dordrecht: Kluwer, pp. 131-140. NATO Adv. Sei. Inst. Ser. C.
11. Buchberger, B. (1985). Grübner bases: Au algebraic method in ideal theory. In N. K. Bose, editor, Multidimensional System Theory Reidel Publishing Co. pp. 184-232.
12. Burago, Y.D. and Zalgaller, Y.A. (1988), Geometric Inequalities. Grundlehren der mathematischen Wissenschaften, 285. Berlin: Springer.
13. Canny, J.F. (1988). The Complexity of Robot Motion Planning, Cambridge, MA: MIT Press.
14. Canny, J. and Emiris, I. (1993). An efficient algorithm for the sparse mixed resultant. In G. Cohen, T. Mora and O. Moreno, editors, Proc. Intern. Symp. Applied Algebra, Algebraic Algor, and Error-Corr. Codes, Led. Notes in Comp. Science 263, pp. 89-104, Puerto Rico. Springer-Verlag.
15. Canny, J. and Pedersen, P. (1993). An algorithm for the Newton resultant. Technical Report 1394, Computer Science Dept., Cornell University.
16. Canny, J. and Rojas, J.M. (1991). An optimal condition for determining the exact number of roots of a polynomial system. In Proc. ACM Intern. Symp. On Symbolic and Algebraic Computation, pp. 96-102, Bonn.
17. Cayley, A. (1848). On the theory of elimination. Dublin Math. J. vol II, 116-120.
18. Cox, D., Little, J. and O’Shea, D. (1992). Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. New York: Springer-Verlag.
19. Dixon, A.L. (1908). The eliminant of three quantics in two independent variables. Proceedings of London Mathematical Society, 6, 49-69, 209-236.
20. Ehrart, E. (1967). Sur un problème de géométrie diophantienne, I. polyèdres et réseaux, J. Reine Angew. Math., 226, 1-29.
21. Emiris, I, (1993). An efficient computation of mixed volume. Technical Report 734, Computer Science Division, U. C. Berkeley, Berkeley, CA.
22. Emiris, I.Z. (1994). On the complexity of sparse elimination. Technical Report 840, Computer Science Division, U. C. Berkeley. To appear in J. Complexity.
23. Emiris, I.Z. (1994) Sparse Elimination and Applications in Kinematics. PhD thesis, Computer Science Division, Dept, of Electrical Engineering and Computer Science, University of California, Berkeley.
24. Emiris, I.Z. (1995). A general solver based on sparse resultants. In Proc. PoSSo (Polynomial System Solving) Workshop on Software, pp. 35—54, Paris.
25. Emiris, I. and Canny, J. (1993). A practical method for the sparse resultant. In Proc. ACM Intern. Symp. On Symbolic and Algebraic Computation, pp. 183-192, Kiev.
26. Emiris, I.Z. and Rege, A. (1994) Monomial bases and polynomial system solving. In, Proc. ACM them. Symp. On Symbolic and Algebraic Computation, pp. 114-122, Oxford.
27. Faugère, J.-C. (1995). State of GB and tutorial. In Proc. PoSSo (Polynomial System Solving) Workshop on Software, pp. 55-71, Paris.
28. Fulton, W. (1993). Introduction to Toric Varieties. Number 131 in Annals of Mathematics. Princeton, NJ: Princeton University Press.
29. Garey, M.R. and Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman.
30. Gelfand, I.M., Kapranov, M.M. and Zelevinsky, A.V. (1991). Discriminants of polynomials in several variables and triangulations of Newton polytopes. Leningrad Math. J. 2, 449-505. (Translated from Algebra i Analiz 2, 1990, pp. 1-62)
31. Gelfand, I.M., Kapranov, M.M. and Zelevinsky, A.V. (1994) Discriminants and Resultants. Boston: Birkhäuser.
32. Grötschel, M., Lovâsz, L. and Schrijver, A. (1993). Geometric Algorithms and Combinatorial Optimization. Berlin: Springer-Verlag, 2nd edition.
33. Griinbaum, B. (1967). Convex Polytopes. New York: Wiley-Interscience.
34. Hafner, J.L. and McCurley, K.S. (1991). Asymptotically fast triangularization of matrices over rings. SIAM J. Computing, 20, 1068-1083.
35. Huber, B. and Sturmfels, B. (1992). A polyhedral method for solving sparse polynomial systems. Math. Comp. To appear. A preliminary version presented at the Workshop on Real Algebraic Geometry.
36. Huber, B. and Sturmfels, B. (1995). Berenstein’s theorem in affine space. Discr. and Computational Geometry. To appear.
37. Hurwitz, A. (1913). Uber die Trägheitsformen Eines Algebraischen Moduls. Annali di Mat., Tomo vol XX (Ser. III): pp. 113-151.
38. Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming. Combinatorica, 4, 373-395.
39. Khachiyan, L. (1993). Complexity of polytope volume computation. In Janos Pach. editor, New Trends m Discrete and Computational Geometry, chapter IV. Heidelberg: Springer-Vsrlag.
40. Khovanskii, A.G. (1978). Newton polyhedra and the genus of complete intersections. FunktsionaVnyi Analiz i Ego Prilozheniya, 12, 51-61.
41. Khovanskii, A.G. (1991). Feumomials. Providence, RI: AMS Press.
42. Kushnirenko, A.G. (1975). The Newton polyhedron and the number of solutions of a system of k equations in k unknowns. Uspekhi Mat. Nauk., 30, 266-267.
43. Lakshman, Y.N. (1990). On the complexity of computing Gröbner bases for zero-dimensional polynomial ideals. PhD thesis, Computer Science Department, Rensselaer Polytechnic Institute, TVoy, New York.
44. Lazard, D. (1981). Résolution des systèmes d’Equations algébriques. Theor. Comp. Science, 15, 77-110.
45. Li, T.Y. and Wang, X. (1994). The BKK root count in C. Manuscript.
46. Macaulay, F.S. (1902). Some formulae in elimination. Proc. London Math. Soc., 1, 3-27.
47. Manocha, D. and Canny, J. (1992). Multipolynomial resultants and linear algebra. In Proc. ACM Intern. Symp. On Symbolic and Algebraic Computation, pp. 96-102.
48. Manocha, D. and Canny, J. (1992). Real time inverse kinematics of general 6R manipulators. In Proc. IEEE Intern. Conf. Robotics and Automation, pp. 383-389, Nice.
49. Mishra, B. (1993). Algorithmic Algebra. New York: Springer-Verlag.
50. Modi, J.J. (1990). Parallel Algorithms and Matrix Computation. Oxford Applied Mathematics and Computing Science Series. Oxford: Clarendon.
51. Morgan, A.P., Sommese, A.J. and Wampler, C.W. (1993). A product-decoimposition theorem for bounding Bézout numbers. SIAM J. Numerical Analysis. To appear.
52. Pedersen, P. (1994). AMS-IMS-SIAM Summer Conference on Continuous Algorithms and Complexity. Mt. Holyoke, Mass.
53. Pedersen, P. and Sturmfels, B. (1993). Product Formulas for Resultants and Chow Forms. Math. Zeitschrift, 214, 377-396.
54. Pottier, L. (1995). Bounds for degree of the n-cyclic system. INRIA Sophia-Antipolis, Manuscript. Press.
55. Flannery, B.P., Teukolsky, S.A. and Vetterling, W.T. (1988), Numerical Recipes in C: the Art of Scientific Computing. Cambridge: Cambridge University Press.
56. Renegar, J. (1992). On the computational complexity of the first-order theory of the reals. parts I, II, III. J. Symbolic Computation, 13, 255-352.
57. Rojas, J.M. (1994). A convex geometric approach to counting the roots of a polynomial system. Theor. Comp. Science, 133, 105-140.
58. Schneider, R. (1993). Convex Bodies: The Brunn-Minkowski Theory. Cambridge: Cambridge University Press.
59. Schwartz, J.T. (1980). Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27, 701-717.
60. Stillman, M., Stillman, M. and Bayer, D. (1992). Macaulay user manual. NSF Regional Geometry Institute, Amherst College, Amherst, Mass.
61. Sturmfels, B. (1992). The asymptotic number of real zeros of a sparse polynomial system. In Proc. Workshop on Hamiltonian and Gradient Flows Algorithms and Control, Fields Institute, Waterloo, Ontario.
62. Sturmfels, B. (1994). On the Newton polytope of the resultant. J. Of Algebr. Combinatorics, 3, 207-236.
63. Sturmfels, B. and Zelevinsky, A. (1994). Multigraded resultants of Sylvester type. J. Of Algebra, 163, 115-127.
64. Sylvester, J.J. (1853). On a theory of syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm’s functions, and that of the greatest algebraic common measure. Philosophical Trans., 143, 407-548.
65. van der Waerden, B.L. (1950). Modem Algebra. F. Ungar Publishing Co., New York, 3rd edition.
66. Verscheide, J. and Gatermann, K. (1995). Symmetric Newton polytopes for solving sparse polynomial systems. Adv. Appl. Math. 16, 95-127.
67. Verscheide, J., Gatermann, K. and Cools, R. (1995). Mixed volume computation by dynamic lifting applied to polynomial system solving. Technical Report TW 222, Katholieke Universiteit Leuven, Dept, of Computer Science.
68. Verscheide, J., Verlinden, P. and Cools, R. (1994). Homotopies exploiting Newton polytopes for solving sparse polynomial systems. SIAM J. Numerical Analysis, 31, 915-930.
69. Weyman, J. and Zelevinsky, A. (1992). Determinantal formulas for multigraded resultants. Manuscript.