Low-Memory Numerical Certification
arXiv:2604.1662361.0h-index: 2
AI Analysis
This work addresses the memory bottleneck in certifying polynomial system solutions, which is important for large-scale numerical computation.
The authors propose a low-memory framework for certifying numerical solutions to polynomial systems, using solution iterators and spatial partitioning trees to reduce memory requirements. They provide a prototypical algorithm, analyze its complexity, and demonstrate memory reduction on a large example.
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.