Symmetric Newton polytopes for solving sparse polynomial systems
The authors approach the computation of isolated solutions of a given polynomial system by homotopy methods, especially by methods for constructing symmetric homotopies. In this paper it will be shown how the lifting algorithm proposed by \textit{B. Huber} and \textit{B. Sturmfels} [A polyhedral method for solving sparse polynomial systems, Math. Comput. 64, No. 212, 1541-1555 (1995)]can be applied to symmetric Newton polytopes. The paper is structured as follows. The second section recalls the terminology and notations from the theory of polytopes. Then in the third section the lifting algorithm for solving systems of Laurent polynomials is presented. This algorithm uses a certain homotopy and includes the determination of the BKK bound of a Laurent polynomial system [cf. \textit{D. N. Bernshtejn, A. G. Kushnirenko} and \textit{A. G. Khovanskij}, Uspeki Mat. Nauk 31, No. 3(189), 201-202 (1976; Zbl 0354.14001)]. In the fourth section, symmetric Newton polytopes and subdivisions are discussed. The symmetric lifting function, which leads to the construction of a symmetric mixed subdivision and to a symmetric homotopy, is described in the fifth section. Many applications with practical significance of the method are given in this paper.
- Computation and applications of the Newton polyhedrons
- scientific article; zbMATH DE number 4119504
- Beyond polyhedral homotopies
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Homotopies and polynomial system solving I
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems
- Elimination theory and Newton polytopes
- On the solutions to polynomial systems obtained by homotopy methods
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Symmetric homotopy construction
- Solving a system of algebraic equations with symmetries
- A family of sparse polynomial systems arising in chemical reaction systems
- Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Multivariate interpolation: preserving and exploiting symmetry
- Symmetry in multivariate ideal interpolation
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Polyhedral methods for space curves exploiting symmetry applied to the cyclic \(n\)-roots problem
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
- Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
- Preface
This page was built for publication: Symmetric Newton polytopes for solving sparse polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894795)
