Low-Memory Numerical Certification
arXiv:2604.16623
Abstract
We introduce a low-memory framework for certifying numerical solutions to polynomial systems which uses solution iterators and spatial partitioning trees to reduce memory requirements. We provide a prototypical algorithm, analyze its complexity, and demonstrate the memory reduction on a large example.
9 pages, 2 figures