Symmetric Newton polytopes for solving sparse polynomial systems
From MaRDI portal
Recommendations
- 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
Cited in
(13)- Polyhedral methods for space curves exploiting symmetry applied to the cyclic \(n\)-roots problem
- Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Multivariate interpolation: preserving and exploiting symmetry
- Symmetry in multivariate ideal interpolation
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Preface
- Solving a system of algebraic equations with symmetries
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
- A family of sparse polynomial systems arising in chemical reaction systems
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
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)
