Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials

From MaRDI portal
Publication:312198

DOI10.1007/S11075-015-0095-2zbMATH Open1349.14177arXiv1505.05241OpenAlexW2234351191MaRDI QIDQ312198FDOQ312198

Matthew E. Niemerg, Jonathan D. Hauenstein, Daniel J. Bates, Frank Sottile

Publication date: 14 September 2016

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: We give a Descartes'-like bound on the number of positive solutions to a system of fewnomials that holds when its exponent vectors are not in convex position and a sign condition is satisfied. This was discovered while developing algorithms and software for computing the Gale transform of a fewnomial system, which is our main goal. This software is a component of a package we are developing for Khovanskii-Rolle continuation, which is a numerical algorithm to compute the real solutions to a system of fewnomials.


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





Cites Work


Uses Software






This page was built for publication: Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312198)