Abstract for the talk on 23.04.2020 (18:20 h)Nonlinear Algebra Seminar Online (NASO)
Taylor Brysiewicz (Texas A&M University)
Solving Decomposable Sparse Systems
See the video of this talk.
Amendola et al. proposed a method for solving systems of polynomial equations lying in a family which exploits a recursive decomposition into smaller systems. A family of systems admits such a decomposition if and only if the corresponding monodromy group is imprimitive. A consequence of Esterov’s classification of sparse polynomial systems with imprimitive monodromy groups is that this decomposition is obtained by inspection. Using these ideas, we present a recursive algorithm to numerically solve decomposable sparse systems. This is joint work with Frank Sottile, Jose Rodriguez, and Thomas Yahl.