Mixed cell computation in HOM4ps
DOI10.1016/j.jsc.2016.07.017zbMath1365.13047OpenAlexW2493400787MaRDI QIDQ507160
Tien-Yien Li, Tsung-Lin Lee, Tianran Chen
Publication date: 3 February 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2016.07.017
Computational aspects related to convexity (52B55) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Graph algorithms (graph-theoretic aspects) (05C85) Complexity and performance of numerical algorithms (65Y20) Computational aspects in algebraic geometry (14Q99) Solving polynomial systems; resultants (13P15)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finiteness of spatial central configurations in the five-body problem
- Finiteness of central configurations of five bodies in the plane
- Mixed volume computation in parallel
- Efficient path tracking methods
- Numerical polynomial homotopy continuation method and string vacua
- Dynamic enumeration of all mixed cells
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Central configurations of the five-body problem with equal masses
- A transformation to avoid solutions at infinity for polynomial systems
- Coefficient-parameter polynomial continuation
- A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
- A power series method for computing singular solutions to nonlinear analytic systems
- The number of roots of a system of equations
- Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen
- Mixed volume computation for semi-mixed systems
- PHoM -- a polyhedral homotopy continuation method for polynomial systems
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Spherical projective path tracking for homotopy continuation methods
- Seven mutually touching infinite cylinders
- Numerical algebraic geometry
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- Computing singular solutions to nonlinear analytic systems
- Algorithm 921
- Algorithm 652
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- An a posteriori certification algorithm for Newton homotopies
- Algorithm 846
- Finiteness of stationary configurations of the four-vortex problem
- Adaptive Multiprecision Path Tracking
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- Finding all solutions to polynomial systems and other systems of equations
- Finding all isolated solutions to polynomial systems using HOMPACK
- Introduction to Numerical Continuation Methods
- ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
- Algorithm 795
- The BKK root count in $\mathbf {C}^n$
- A Polyhedral Method for Solving Sparse Polynomial Systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Decompositions of binomial ideals
- Mixed volume computation via linear programming
- Finding mixed cells in the mixed volume computation
This page was built for publication: Mixed cell computation in HOM4ps
