Name
Abstract | ||
|---|---|---|
The polyhedral homotopy method, which has been known as a powerful numerical method for computing all isolated zeros of a polynomial system, requires all mixed cells of the support of the system to construct a family of homotopy functions. The mixed cells are reformulated in terms of a linear inequality system with an additional combinatorial condition. An enumeration tree is constructed among a family of linear inequality systems induced from it such that every mixed cell corresponds to a unique feasible leaf node, and the depth-first search is applied to the enumeration tree for finding all the feasible leaf nodes. How to construct such an enumeration tree is crucial in computational efficiency. This paper proposes a dynamic construction of an enumeration tree, which branches each parent node into its child nodes so that the number of feasible child nodes is expected to be small; hence we can prune many subtrees which do not contain any mixed cell. Numerical results exhibit that the proposed dynamic construction of an enumeration tree works very efficiently for large scale polynomial systems; for example, it generated all mixed cells of the cyclic-15 problem for the first time in less than 16 hours. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s00454-006-1300-9 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Linear Programming Problem,Child Node,Linear Inequality,Polynomial System,Mixed Cell | Topology,Discrete mathematics,Combinatorics,Polynomial,Homotopy method,Tree (data structure),Enumeration,Algebraic enumeration,Homotopy,Numerical analysis,Linear inequality,Mathematics | Journal |
Volume | Issue | ISSN |
37 | 3 | 0179-5376 |
Citations | PageRank | References |
13 | 1.02 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomohiko Mizutani | 1 | 39 | 2.99 |
| Akiko Takeda | 2 | 196 | 29.72 |
| Masakazu Kojima | 3 | 1603 | 222.51 |