BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Taylor Brysiewicz (Texas A&M)
DTSTART:20200423T162000Z
DTEND:20200423T165000Z
DTSTAMP:20260423T024548Z
UID:NASO/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/NASO/12/">So
 lving decomposable sparse systems</a>\nby Taylor Brysiewicz (Texas A&M) as
  part of Max Planck Institute nonlinear algebra seminar online\n\n\nAbstra
 ct\nAmendola et al. proposed a method for solving systems of polynomial eq
 uations lying in a family which exploits a recursive decomposition into sm
 aller systems. A family of systems admits such a decomposition if and only
  if the corresponding monodromy group is imprimitive. A consequence of Est
 erov’s classification of sparse polynomial systems with imprimitive mono
 dromy groups is that this decomposition is obtained by inspection. Using t
 hese ideas\, we present a recursive algorithm to numerically solve decompo
 sable sparse systems. This is joint work with Frank Sottile\, Jose Rodrigu
 ez\, and Thomas Yahl.\n
LOCATION:https://researchseminars.org/talk/NASO/12/
END:VEVENT
END:VCALENDAR