Abstract
In practice, finding mixed cells in certain polyhedral subdivisions plays a dominating role when a polyhedral homotopy is employed to approximate all isolated zeros of polynomial systems. This paper gives a new algorithm for the mixed cell computation via a new formulation of the underlying linear programming problems. Numerical results show that the algorithm provides a major advance in the speed of computation with much less memory requirements.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, T.Y., Li, X. Finding Mixed Cells in the Mixed Volume Computation. Found. Comput. Math. 1, 161–181 (2001). https://doi.org/10.1007/s102080010005
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s102080010005