Finding mixed cells in the mixed volume computation
algorithmconvex hullisolated zeroslinear programmingMinkowsk summixed cell computationnumerical resultspolyhedral homotopypolyhedral subdivisionspolynomial systems
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) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical mathematical programming methods (65K05) Linear programming (90C05)
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Deformation techniques for sparse systems
- Computing mixed volume and all mixed cells in quermassintegral time
- Efficiently counting affine roots of mixed trigonometric polynomial systems
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
- The norm of the Fourier transform on finite abelian groups
- Elimination for generic sparse polynomial systems
- Theoretical aspects of mixed volume computation via mixed subdivision
- Unmixing the mixed volume computation
- Newton's method with deflation for isolated singularities of polynomial systems
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
- An effective linear programming technique for computing the mixed volume and stable mixed volume
- Total degree vs. mixed volume
- Computing isolated roots of sparse polynomial systems in affine space
- Optimization problem in multi-homogeneous homotopy method
- Mixed cell computation in HOM4ps
- Parallel degree computation for binomial systems
- Mixed volume computation in parallel
- Finding a fully mixed cell in a mixed subdivision of polytopes
- Mixed volume computation via linear programming
- High probability analysis of the condition number of sparse polynomial systems
- Dynamic enumeration of all mixed cells
This page was built for publication: Finding mixed cells in the mixed volume computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943877)
