Presents a new low-memory certification framework for polynomial system solutions via iterators and partitioning trees, including complexity analysis and demonstration on a large example.
Certifying zeros of polynomial systems using interval arithmetic.ACM Transactions on Mathematical Software, 49(1):1–14
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Low-Memory Numerical Certification
Presents a new low-memory certification framework for polynomial system solutions via iterators and partitioning trees, including complexity analysis and demonstration on a large example.