# Algorithms and Implementation in Numerical Algebraic Geometry

### From SIAG-AG

## [edit] **Overview**

The foundation of algebraic geometry is the problem of solving systems of polynomial equations. Numerical methods can be used to perform algebraic geometric computations forming the field of numerical algebraic geometry which continues to advance rapidly. The continuing progress in computer hardware and software has enabled new algorithms and implementations. Examples include irreducible decompositions in multi-projective spaces, and numerical techniques for computing discrete objects such as polytopes. This session will feature recent progress in algorithms and implementations of theoretical advances in numerical algebraic geometry.

## [edit] **Organizer**

Tianran Chen

*Auburn University at Montgomery*

## [edit] **Confirmed Speakers**

- Nathan Bliss

University of Illinois at Chicago - Jose Rodriguez

University of Chicago - Jesse Drendel

Colorado State University - Zeng, Zhonggang

Northeastern Illinois University - Dani Brake

University of Notre Dame - Jeff Sommars

University of Illinois at Chicago - Maggie Regan

University of Notre Dame - Lixing Han

University of Michigan-Flint