Finding mixed cells in the mixed volume computation
DOI10.1007/s102080010005zbMath1012.65019OpenAlexW2083660080WikidataQ127646928 ScholiaQ127646928MaRDI QIDQ5943877
Publication date: 21 April 2002
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s102080010005
algorithmlinear programmingnumerical resultsisolated zerosconvex hullpolynomial systemsMinkowsk summixed cell computationpolyhedral homotopypolyhedral subdivisions
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Linear programming (90C05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Mixed volumes and related topics in convex geometry (52A39)
Related Items
Uses Software
This page was built for publication: Finding mixed cells in the mixed volume computation