Numerical Computations in Algebraic Geometry

Abstract:

When solving a polynomial system, we distinguish between zero dimensional solving (i.e.: finding only the isolated solutions), numerical irreducible decomposition and primary decomposition. The focus of the talk is to explain the key ingredients to understand the new algorithm of Anton Leykin (to appear in ISSAC 2008) to compute a numerical primary decomposition.

AMS MRC Computational Algebra and Convexity, Snowbird, Utah, 21-27 June 2008.

slides of the talk