Minimizing multi-homogeneous Bézout numbers by a local search method
From MaRDI portal
Publication:2701563
DOI10.1090/S0025-5718-00-01303-XzbMath1013.65046MaRDI QIDQ2701563
Publication date: 19 February 2001
Published in: Mathematics of Computation (Search for Journal in Brave)
numerical exampleshomotopy methodpolynomial systemlocal search methodmulti-homogeneous Bézout number
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A hybrid algorithm for computing permanents of sparse matrices ⋮ A hybrid algorithm for multi-homogeneous Bézout number ⋮ Heuristic methods for computing the minimal multi-homogeneous Bézout number. ⋮ Optimization problem in multi-homogeneous homotopy method ⋮ Computing the optimal partition of variables in multi-homogeneous homotopy methods ⋮ Incomplete Gröbner basis as a preconditioner for polynomial systems
Cites Work
- Unnamed Item
- Unnamed Item
- Bernstein's theorem in affine space
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- The random product homotopy and deficient polynomial systems
- Bézout number calculations for multi-homogeneous polynomial systems
- An efficient start system for multi-homogeneous polynomial continuation
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Numerical Solution of a Class of Deficient Polynomial Systems
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- A simple homotopy for solving deficient polynomial systems
- On the Number of Solutions to Polynomial Systems of Equations
- Finding all solutions to polynomial systems and other systems of equations
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- A Polyhedral Method for Solving Sparse Polynomial Systems
This page was built for publication: Minimizing multi-homogeneous Bézout numbers by a local search method
