Mixed-volume computation by dynamic lifting applied to polynomial system solving
From MaRDI portal
Publication:1921341
DOI10.1007/BF02711134zbMath0854.68111DBLPjournals/dcg/VerscheldeGC96OpenAlexW2088758224WikidataQ57778995 ScholiaQ57778995MaRDI QIDQ1921341
Jan 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
Related Items (22)
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study ⋮ 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 ⋮ Multiprojective witness sets and a trace test ⋮ Heuristic methods for computing the minimal multi-homogeneous Bézout number. ⋮ Minimizing multi-homogeneous Bézout numbers by a local search method ⋮ Mixed cell computation in HOM4ps ⋮ Parallel degree computation for binomial systems ⋮ Numerical Evidence for a Conjecture in Real Algebraic Geometry ⋮ Elimination for generic sparse polynomial systems ⋮ A systematic framework for solving geometric constraints analytically ⋮ Optimization problem in multi-homogeneous homotopy method ⋮ Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods ⋮ Preface ⋮ Matrices in elimination theory ⋮ Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes ⋮ Deformation techniques for sparse systems ⋮ Toric Newton method for polynomial homotopies ⋮ How to count efficiently all affine roots of a polynomial system ⋮ Toric intersection theory for affine root counting ⋮ A family of sparse polynomial systems arising in chemical reaction systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
- Coefficient-parameter polynomial continuation
- Mathematical reduction of a heart dipole model
- Generalized Euler integrals and \(A\)-hypergeometric functions
- Randomized incremental construction of Delaunay and Voronoi diagrams
- A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
- Chow polytopes and general resultants
- Fiber polytopes
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Bézout number calculations for multi-homogeneous polynomial systems
- Mixed volumes of polytopes
- Geometric algorithms and combinatorial optimization
- The number of roots of a system of equations
- Newton polytopes and the Bezout theorem
- Newton polyhedra and the genus of complete intersections
- Symbolic homotopy construction
- On the Newton polytope of the resultant
- A convex geometric approach to counting the roots of a polynomial system
- Homotopies for solving polynomial systems within a bounded domain
- Symmetric Newton polytopes for solving sparse polynomial systems
- Box-bisection for solving second-degree systems and the problem of clustering
- On the Complexity of Computing the Volume of a Polyhedron
- Complexity of Bezout's Theorem I: Geometric Aspects
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Lectures on Polytopes
- On The Complexity of Computing Mixed Volumes
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- A Product-Decomposition Bound for Bezout Numbers
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Four results on randomized incremental constructions
This page was built for publication: Mixed-volume computation by dynamic lifting applied to polynomial system solving
