Certifying solutions to square systems of polynomial-exponential equations

DOI10.1016/j.jsc.2016.07.020zbMath1357.14071arXiv1109.4547OpenAlexW2152124391WikidataQ115569959 ScholiaQ115569959MaRDI QIDQ507164

Viktor Levandovskyy, Jonathan D. Hauenstein

Publication date: 3 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

polynomial systemnumerical algebraic geometryalpha theoryalphacertifiedcertified solutionspolynomial-exponential systems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Computational aspects of higher-dimensional varieties (14Q15)

Related Items (3)

Counting solutions of a polynomial system locally and exactly ⋮ Foreword. What is numerical algebraic geometry? ⋮ Exact solutions in log-concave maximum likelihood estimation

Uses Software

• Bertini
• alphaCertified

Cites Work

• Unnamed Item
• Unnamed Item
• Errata: Coefficient-parameter polynomial continuation
• Symbolic homotopy construction
• Algorithm 921
• Analysis of Newton’s Method at Irregular Singularities
• Regeneration homotopies for solving systems of polynomials
• Numerical algebraic geometry and algebraic kinematics
• Complexity of Bezout's Theorem I: Geometric Aspects
• A Polyhedral Method for Solving Sparse Polynomial Systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science

This page was built for publication: Certifying solutions to square systems of polynomial-exponential equations