Decomposable sparse polynomial systems

DOI10.2140/jsag.2021.11.53zbMath1483.14087arXiv2006.03154OpenAlexW3033397768MaRDI QIDQ2121681

Thomas Yahl, Jose Israel Rodriguez, Taylor Brysiewicz, Frank J. Sottile

Publication date: 4 April 2022

Published in: The Journal of Software for Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.03154

zbMATH Keywords

polynomialsparsedecomposablesolving

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items (1)

\(u\)-generation: solving systems of polynomials equation-by-equation

Uses Software

• Macaulay2
• PHCpack
• Polyhedra
• DecomposableSparseSystems

Cites Work

• The number of roots of a system of equations
• Solving decomposable sparse systems
• Polyhedra: a package for computations with convex polyhedral objects
• The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
• Algorithm 795
• Galois theory for general systems of polynomial equations
• Monodromy of projective curves
• Solving polynomial systems via homotopy continuation and monodromy

This page was built for publication: Decomposable sparse polynomial systems