Numerical Local Irreducible Decomposition

One way to understand the structure of the solution set of a system of polynomial equations is to decompose the solution set into its irreducible components.  Although such global information can help to solve many problems, local information is often more useful, especially at real points.  This talk will define a local irreducible decomposition, introduce a numerical algebraic geometric technique for computing the local structure, and apply it to several examples.