Workshop
Homotopy Iterators
- Paul Breiding
Abstract
We introduce the concept of homotopy iterators for performing polynomial homotopy continuation tasks in a memory efficient manner. The main idea is to push forward an iterator for the start solutions of a homotopy via the function which tracks them along the homotopy. Doing so produces a representation of the target solutions, bypassing the need to hold all solutions in memory. We discuss several applications of this datatype ranging from solution counting to data compression. This is joint work with Taylor Brysiewicz and Hannah Friedman.
