Bézout number calculations for multi-homogeneous polynomial systems

DOI10.1016/0096-3003(92)90070-HzbMath0759.65023MaRDI QIDQ1200228

Charles W. Wampler

Publication date: 17 January 1993

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

homogenizations; Bézout number; multi- homogeneous continuation; multi-homogeneous system of polynomials

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

26C10: Real polynomials: location of zeros

Related Items

Optimization problem in multi-homogeneous homotopy method, Incomplete Gröbner basis as a preconditioner for polynomial systems, Toric intersection theory for affine root counting, Symmetric homotopy construction, A convex geometric approach to counting the roots of a polynomial system, Heuristic methods for computing the minimal multi-homogeneous Bézout number., Computing the optimal partition of variables in multi-homogeneous homotopy methods, Solving degenerate sparse polynomial systems faster, Multihomogeneous resultant formulae by means of complexes, Mixed-volume computation by dynamic lifting applied to polynomial system solving, A hybrid algorithm for multi-homogeneous Bézout number, Minimizing multi-homogeneous Bézout numbers by a local search method, Numerical Evidence for a Conjecture in Real Algebraic Geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving systems of polynomial equations by bounded and real homotopy
• A homotopy for solving polynomial systems
• A homotopy for solving general polynomial systems that respects m- homogeneous structures
• Coefficient-parameter polynomial continuation