Symmetric Newton polytopes for solving sparse polynomial systems
From MaRDI portal
Publication:1894795
DOI10.1006/aama.1995.1005zbMath0832.65048OpenAlexW2075184731MaRDI QIDQ1894795
Karin Gatermann, Jan Verschelde
Publication date: 5 March 1996
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.1995.1005
polynomial systemhomotopy methodslifting algorithmisolated solutionssymmetric Newton polytopessystems of Laurent polynomials
Numerical computation of solutions to systems of equations (65H10) Classification of homotopy type (55P15) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Real polynomials: location of zeros (26C10)
Related Items
Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods, Solving a system of algebraic equations with symmetries, Mixed-volume computation by dynamic lifting applied to polynomial system solving, Symmetry in multivariate ideal interpolation, A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems, Multivariate interpolation: preserving and exploiting symmetry, Preface, A prolongation-projection algorithm for computing the finite real variety of an ideal, Semidefinite characterization and computation of zero-dimensional real radical ideals, A family of sparse polynomial systems arising in chemical reaction systems
