Complexity of sparse polynomial solving 2: renormalization

DOI10.1093/imanum/drac039zbMath1522.65074arXiv2005.01223OpenAlexW3022686607MaRDI QIDQ6171578

Gregorio Malajovich

Publication date: 14 August 2023

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

toric varietiesmixed volumeNewton iterationrenormalizationhomotopy algorithmsmixed areasparse polynomialscondition lengthtoric infinity

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical computation of roots of polynomial equations (65H04)

Related Items (2)

A polyhedral homotopy algorithm for real zeros ⋮ Polyhedral homotopies in Cox coordinates

This page was built for publication: Complexity of sparse polynomial solving 2: renormalization