点击次数：

论文类型：会议论文

发表时间：2011-07-26

收录刊物：EI、Scopus

页面范围：1932-1935

摘要：It is a basic problem for homotopy continuation to minimize multi-homogeneous B  zout number of polynomial systems with multi-homogeneous structure. For a given polynomial system, different way of partitioning the variables produces different multi-homogeneous B  zout number. All possible variable partitions are regarded as a tree structure. We search in a subtree to find the optimal variable partition whose multi-homogeneous B  zout number is the smallest one. A pruned subtree searching method is proposed for saving the computational cost. Numerical tests with randomly generated examples show that these two methods are efficient. ? 2011 IEEE.