Solving Decomposable Sparse Systems

  • Taylor Brysiewicz (Texas A&M University)
Live Stream


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.


17.03.20 21.02.22

Nonlinear Algebra Seminar Online (NASO)

MPI for Mathematics in the Sciences Live Stream

Katharina Matschke

MPI for Mathematics in the Sciences Contact via Mail