Heuristic methods for computing the minimal multi-homogeneous Bézout number. (Q1412521)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Heuristic methods for computing the minimal multi-homogeneous Bézout number.
scientific article

    Statements

    Heuristic methods for computing the minimal multi-homogeneous Bézout number. (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2003
    0 references
    The multi-homogeneous Bézout number of a polynomial system is the number of paths that one has to follow in computing all its isolated solutions with the continuation method. Each partition of variables corresponds to a multihomogeneous Bézout number. It is a challenging problem to find a partition with minimal multi-homogeneous Bézout number. Two heuristic numerical methods for computing the minimal multi-homogeneous Bézout number are presented in this paper. Some analysis of computational complexity are given. Numerical examples show the efficiency of these two methods.
    0 references
    multi-homogeneous Bézout number
    0 references
    continuation method
    0 references
    system of polynomial equations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references