Mixed-volume computation by dynamic lifting applied to polynomial system solving
From MaRDI portal
DOI10.1007/BF02711134zbMATH Open0854.68111DBLPjournals/dcg/VerscheldeGC96OpenAlexW2088758224WikidataQ57778995 ScholiaQ57778995MaRDI QIDQ1921341FDOQ1921341
Authors: J. Verschelde, Karin Gatermann, Ronald Cools 
Publication date: 25 August 1996
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02711134
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on Polytopes
- Coefficient-parameter polynomial continuation
- Geometric algorithms and combinatorial optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Title not available (Why is that?)
- Generalized Euler integrals and \(A\)-hypergeometric functions
- A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
- Title not available (Why is that?)
- Randomized incremental construction of Delaunay and Voronoi diagrams
- On the Newton polytope of the resultant
- Newton polyhedra and the genus of complete intersections
- On the Complexity of Computing the Volume of a Polyhedron
- Homotopies for solving polynomial systems within a bounded domain
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- On The Complexity of Computing Mixed Volumes
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Fiber polytopes
- The number of roots of a system of equations
- Newton polytopes and the Bezout theorem
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- Mixed volumes of polytopes
- Complexity of Bezout's Theorem I: Geometric Aspects
- Title not available (Why is that?)
- Chow polytopes and general resultants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A convex geometric approach to counting the roots of a polynomial system
- Title not available (Why is that?)
- Mathematical reduction of a heart dipole model
- Symbolic homotopy construction
- Title not available (Why is that?)
- A Product-Decomposition Bound for Bezout Numbers
- Title not available (Why is that?)
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
- Four results on randomized incremental constructions
- Bézout number calculations for multi-homogeneous polynomial systems
- Symmetric Newton polytopes for solving sparse polynomial systems
- Title not available (Why is that?)
- Box-bisection for solving second-degree systems and the problem of clustering
Cited In (30)
- Toric Newton method for polynomial homotopies
- Optimization problem in multi-homogeneous homotopy method
- Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
- Matrices in elimination theory
- A systematic framework for solving geometric constraints analytically
- Computing isolated roots of sparse polynomial systems in affine space
- Heuristic methods for computing the minimal multi-homogeneous Bézout number.
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Dynamic enumeration of all mixed cells
- Deformation techniques for sparse systems
- Algorithm 846
- Theoretical aspects of mixed volume computation via mixed subdivision
- An effective linear programming technique for computing the mixed volume and stable mixed volume
- How to count efficiently all affine roots of a polynomial system
- Mixed volume computation for semi-mixed systems
- Unmixing the mixed volume computation
- Toric intersection theory for affine root counting
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Preface
- Minimizing multi-homogeneous Bézout numbers by a local search method
- Title not available (Why is that?)
- Computing mixed volume and all mixed cells in quermassintegral time
- Mixed cell computation in HOM4ps
- Elimination for generic sparse polynomial systems
- Numerical Evidence for a Conjecture in Real Algebraic Geometry
- A family of sparse polynomial systems arising in chemical reaction systems
- DEMiCs: a software package for computing the mixed volume via dynamic enumeration of all mixed cells
- Multiprojective witness sets and a trace test
- Parallel degree computation for binomial systems
- Mixed volume computation via linear programming
Uses Software
This page was built for publication: Mixed-volume computation by dynamic lifting applied to polynomial system solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921341)
