Unmixing the mixed volume computation
From MaRDI portal
Publication:2421592
DOI10.1007/s00454-019-00078-xzbMath1417.52021arXiv1703.01684OpenAlexW2963742618WikidataQ128182398 ScholiaQ128182398MaRDI QIDQ2421592
Publication date: 17 June 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.01684
Newton polytopeconvex polytopemixed volumeKuramoto modeltensor eigenvaluesBKK boundspower-flow equationssemi-mixed systems
Computational aspects related to convexity (52B55) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Mixed volumes and related topics in convex geometry (52A39)
Related Items (7)
The steady-state degree and mixed volume of a chemical reaction network ⋮ Symmetric edge polytopes and matching generating polynomials ⋮ Facets and facet subgraphs of symmetric edge polytopes ⋮ Dimension results for extremal-generic polynomial systems over complete toric varieties ⋮ Solving decomposable sparse systems ⋮ Directed acyclic decomposition of Kuramoto equations ⋮ Criteria for strict monotonicity of the mixed volume of convex polytopes
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
- Homotopy continuation method for solving systems of nonlinear and polynomial equations
- Newton-Okounkov bodies, semigroups of integral points, graded algebras and intersection theory
- Synchronization in complex networks of phase oscillators: a survey
- Mixed cell computation in HOM4ps
- Mixed volume computation in parallel
- Regenerative cascade homotopies for solving polynomial systems
- Bernstein's theorem in affine space
- Dynamic enumeration of all mixed cells
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- The random product homotopy and deficient polynomial systems
- Coefficient-parameter polynomial continuation
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- The number of roots of a system of equations
- Newton polytopes and the Bezout theorem
- Newton polyhedra and the genus of complete intersections
- Enumerating regular mixed-cell configurations
- Toric intersection theory for affine root counting
- The maximal generic number of pure Nash equilibria
- The maximal number of regular totally mixed Nash equilibria
- Mixed volume computation for semi-mixed systems
- Computing mixed volume and all mixed cells in quermassintegral time
- PHoM -- a polyhedral homotopy continuation method for polynomial systems
- Numerical stability of path tracing in polyhedral homotopy continuation methods
- Algebraic Geometry. I: Complex projective varieties.
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Reverse search for enumeration
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- The number of eigenvalues of a tensor
- A product formula for the normalized volume of free sums of lattice polytopes
- Criteria for strict monotonicity of the mixed volume of convex polytopes
- Eigenvalues of a real supersymmetric tensor
- On eigenvalue problems of real symmetric tensors
- Computing Tensor Eigenvalues via Homotopy Methods
- Synchronization Properties of Trees in the Kuramoto Model
- Hom4PS-3: A Parallel Numerical Solver for Systems of Polynomial Equations Based on Polyhedral Homotopy Continuation Methods
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- Geometric critical point analysis of lossless power system models
- Regeneration homotopies for solving systems of polynomials
- Root counts of semi-mixed systems, and an application to counting nash equilibria
- Algorithm 846
- EFFICIENT EVALUATION OF POLYNOMIALS AND THEIR PARTIAL DERIVATIVES IN HOMOTOPY CONTINUATION METHODS
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- On The Complexity of Computing Mixed Volumes
- Algorithm 795
- Counting Equilibria of the Kuramoto Model Using Birationally Invariant Intersection Index
- Algebraic geometrization of the Kuramoto model: Equilibria and stability analysis
- The BKK root count in $\mathbf {C}^n$
- A Neural Network Modeled by an Adaptive Lotka-Volterra System
- A Polyhedral Method for Solving Sparse Polynomial Systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Generalized Tensor Eigenvalue Problems
- Mixed volume computation via linear programming
- Finding mixed cells in the mixed volume computation
This page was built for publication: Unmixing the mixed volume computation
