Polynomial Equations: Theory and Practice

2022/10/10 by Simon Telen, Telen, Simon
Computer Science · #Algebraic Geometry (math.AG) #FOS: Mathematics #Numerical Analysis (math.NA) #Optimization and Control (math.OC) #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.2210.04939

openalex publication_date 2022/10/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts. The theory is illustrated by many examples using different software packages.

Related

• A new method for reducing algebraic programs to polynomial programs
• A solution of polynomial equations
• The complexity and geometry of numerically solving polynomial systems
• Algebraic Degree of Polynomial Optimization
• Rational Solutions of Underdetermined Polynomial Equations