Minimizing multi-homogeneous Bézout numbers by a local search method (Q2701563)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing multi-homogeneous Bézout numbers by a local search method |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing multi-homogeneous Bézout numbers by a local search method |
scientific article |
Statements
19 February 2001
0 references
multi-homogeneous Bézout number
0 references
polynomial system
0 references
homotopy method
0 references
local search method
0 references
numerical examples
0 references
0 references
0 references
Minimizing multi-homogeneous Bézout numbers by a local search method (English)
0 references
This paper is about the preparations for computing the zeros of polynomial systems via a homotopy method. For this it is important that the number of homotopy paths is as small as possible. This number is bounded by the Bézout and the multi-homogeneous Bézout numbers. For the latter it is important to partition the variables into disjoint classes. The authors develop a ``topology'' on these classes, and starting from a certain point proceed to improve the multi-homogeneous Bézout number through local searches. They demonstrate the effectiveness with a few examples and conjecture that the problem of finding the minimal multi-homogeneous Bézout number may be NP-hard.
0 references
