![Algorithms and Complexity in Algebraic Geometry_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Algorithms%20and%20Complexity%20in%20Algebraic%20Geometry_hi-res.jpg?h=450de763&itok=r3pqykMn)
Abstract
This talk is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is not a continuous property. Our certification is based on hybrid symbolic-numeric methods. This is a joint work with Tulay Akoglu, Jonathan Hauenstein and Victor Pan.