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.
Cite
@article{arxiv.2604.16623,
title = {Low-Memory Numerical Certification},
author = {Paul Breiding and Taylor Brysiewicz and David K. Johnson},
journal= {arXiv preprint arXiv:2604.16623},
year = {2026}
}