Mixed volume computation via linear programming
From MaRDI portal
algorithmisolated zeroslinear programmingmixed volumenumerical resultspolynomial systemsimplex algorithmsubdivision
Real polynomials: location of zeros (26C10) Mixed volumes and related topics in convex geometry (52A39) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Linear programming (90C05)
Recommendations
Cited in
(18)- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Volumetric path following algorithms for linear programming
- Mixed volume computation for semi-mixed systems
- The volume algorithm: Producing primal solutions with a subgradient method
- Computing mixed volume and all mixed cells in quermassintegral time
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Theoretical aspects of mixed volume computation via mixed subdivision
- Unmixing the mixed volume computation
- An implementation of exact mixed volume computation
- scientific article; zbMATH DE number 5995258 (Why is no real title available?)
- An effective linear programming technique for computing the mixed volume and stable mixed volume
- Algorithm 846
- On The Complexity of Computing Mixed Volumes
- Mixed cell computation in HOM4ps
- Parallel degree computation for binomial systems
- Finding mixed cells in the mixed volume computation
- On the computation of Newton polytopes of eliminants
This page was built for publication: Mixed volume computation via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928410)
