Dynamic enumeration of all mixed cells
From MaRDI portal
Publication:878389
DOI10.1007/s00454-006-1300-9zbMath1113.65055OpenAlexW2085416421MaRDI QIDQ878389
Akiko Takeda, Tomohiko Mizutani, Kojima, Masakazu
Publication date: 26 April 2007
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-006-1300-9
numerical resultsisolated zerospolynomial systemenumeration treelinear inequality systemspolyhedral homotopy method
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Computing mixed volume and all mixed cells in quermassintegral time ⋮ Unmixing the mixed volume computation ⋮ Computing isolated roots of sparse polynomial systems in affine space ⋮ Efficiently counting affine roots of mixed trigonometric polynomial systems ⋮ Polyhedral homotopies in Cox coordinates ⋮ Mixed cell computation in HOM4ps ⋮ Parallel degree computation for binomial systems ⋮ Mixed volume computation in parallel ⋮ Elimination for generic sparse polynomial systems ⋮ HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method ⋮ An Implementation of Exact Mixed Volume Computation ⋮ Pruning Algorithms for Pretropisms of Newton Polytopes ⋮ Central configurations of the five-body problem with equal masses
Uses Software
This page was built for publication: Dynamic enumeration of all mixed cells
