Algorithms for polynomial system solving through algebraic methods: an overview.

par Dr Mohab Safey (LIP6)

jeudi 11 sept. 2025, 10:00 → 10:55 Europe/Paris

Denisse (Paris)

Polynomial systems of equations and inequalities encode naturally non-linear geometric and arithmetic (static) properties. Consequently, they arise in many scientific fields. However, because of their non-linearity, they are difficult to handle through purely numerical methods, especially when the end-user expects to compute global information on the solution set.

In this talk, we will review algebraic methods for solving such systems,
commenting on their strengths and weaknesses with an emphasis on geometric applications and algorithms for solving over the real numbers.