Low-Memory Numerical Certification
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911603455164416 |
|---|---|
| author | Breiding, Paul Brysiewicz, Taylor Johnson, David K. |
| author_facet | Breiding, Paul Brysiewicz, Taylor Johnson, David K. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_16623 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Low-Memory Numerical Certification Breiding, Paul Brysiewicz, Taylor Johnson, David K. Numerical Analysis 65H14 (Primary) 65Y05, 65Y20, 65G30, 68Q25 (Secondary) 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. |
| title | Low-Memory Numerical Certification |
| topic | Numerical Analysis 65H14 (Primary) 65Y05, 65Y20, 65G30, 68Q25 (Secondary) |
| url | https://arxiv.org/abs/2604.16623 |