Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2303.14321 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910435479912448 |
|---|---|
| author | Lemire, Daniel |
| author_facet | Lemire, Daniel |
| contents | We sometimes need to compute the most significant digits of the product of small integers with a multiplier requiring much storage: e.g., a large integer (e.g., $5^{100}$) or an irrational number ($π$). We only need to access the most significant digits of the multiplier-as long as the integers are sufficiently small. We provide an efficient algorithm to compute the range of integers given a truncated multiplier and a desired number of digits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_14321 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Exact Short Products From Truncated Multipliers Lemire, Daniel Data Structures and Algorithms We sometimes need to compute the most significant digits of the product of small integers with a multiplier requiring much storage: e.g., a large integer (e.g., $5^{100}$) or an irrational number ($π$). We only need to access the most significant digits of the multiplier-as long as the integers are sufficiently small. We provide an efficient algorithm to compute the range of integers given a truncated multiplier and a desired number of digits. |
| title | Exact Short Products From Truncated Multipliers |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2303.14321 |