Mixed volume computation for semi-mixed systems

Discrete and Computational Geometry

Volumn 29, Issue 2, 2003, Pages 257-277

  Gao, Tangan ^a   Li, T Y ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038675267     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2837-x     Document Type: Article

References (18)

1. D. N. Bernshtein (1975), The number of roots of a system of equations, Functional Anal. Appl., 9(3), 183-185. Translated from Funktsional. Anal. i Prilozhen., 9(3), 1-4.
2. M. J. Best and K. Ritter (1985), Linear Programming: Active Set Analysis and Computer Programs, Prentice-Hall, Englewood Cliffs, NJ.
3. Y. Dai, S. Kim, and M. Kojima, Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods, Technical Report B-373, available at http://www.is.titech.ac.jp/̃kojima/sdp.html.
4. I. Z. Emiris and J. F. Canny (1993), A practical method for the sparse resultant, Proceedings of the 1993 International Symposium on Symbolic Computation, ACM, New York, pp. 183-192.
5. I. Z. Emiris and J. F. Canny (1995), Efficient incremental algorithms for the sparse resultant and the mixed volume, J. Symbolic Comput., 20, 117-149.
6. T. Gao and T. Y. Li (2000), Mixed volume computation via linear programming, Taiwan J. Math., 4, 599-619.
7. B. Huber and B. Sturmfels (1995), A polyhedral method for solving sparse polynomial systems, Math. Comp., 64, 1541-1555.
8. B. Huber and B. Sturmfels (1997), Bernshtein's theorem in affine apace. Discrete Comput. Geom., 17(2). 137-141.
9. T. Y. Li (1997), Numerical solution of multivariate polynomial systems by homotopy continuation methods, ACTA Numer., 399-436.
10. T. Y. Li (1999), Solving polynomial systems by polyhedral homotopies, Taiwan J. Math., 3, 251-279.
11. T. Y. Li and X. Li (2001). Finding mixed cells in the mixed volume computation, Found. Comput. Math., 1, 161-181.
12. n, Math. Comp, 65(216), 1477-1484.
13. J. M. Rojas (1994), A convex geometric approach to counting the roots of a polynomial system, Theoret. Comput. Sci., 133, 105-140.
14. J. M. Rojas and X. Wang (1996), Counting affine roots of polynomial systems via pointed Newton polytopes, J. Complexity. 12, 116-133.
15. A. Takeda, M. Kojima, and K. Fujisawa, Enumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method, Preprint.
16. J. Verschelde (1999), Algorithm 795: PHCPACK: a general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Software, 25, 251-276.
17. J. Verschelde, K. Gatermann, and R. Cools (1996), Mixed-volume computation by dynamic lifting applied to polynomial system solving, Discrete Comput. Geom., 16(1), 69-112.
18. C. W. Wampler, A. P. Morgan, and A. J. Sommese (1992), Complete solution of the nine-point path synthesis problem for four-bar linkages, ASME J. Mech. Design, 114, 153-159.