跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2410.07468 · v4

Fast Mixed-Precision Real Evaluation

首次提交 2024-10-10 06:10
版本更新 2026-11-19 12:27
雷达观测 2026-11-20 10:50
arXiv ↗PDF ↗

摘要

Evaluating real numbers to high precision is important in computational science, numerical computing, and in hardware and software design. Efficient algorithms exist for computing arithmetic operations and common elementary functions, but composing these primitives into larger expressions remains a challenge. The typical expression-evaluation algorithm computes all primitives in the expression to a uniform precision, doubling that precision until a sufficiently-accurate result is achieved. This is wasteful: usually only a few operations really need to be performed at high precision, and the bulk of the expression could be computed at a much lower, faster precision. However, no rigorous algorithm currently exists to compute these non-uniform precision assignments, nor to leverage non-uniform precision to reduce the number of primitive computations needed to evaluate an expression. We propose a new algorithm for deriving such rigorous precision assignments and reducing the number of primitive computations needed. This algorithm can leverage results computed at lower precisions to analytically determine a precision for each primitive that will result in a sufficiently-accurate evaluation. It can also use information from constant subexpressions, movability flags, and repeat flags to skip the computation of certain primitives, further reducing the time to evaluate real expressions. Our implementation, Reval, achieves an average speed-up of 3.97x compared to the widely-used Sollya tool, with the speed-up increasing to 9.26x on the most difficult inputs. A detailed evaluation shows that this speed-up results from both assigning lower precisions to the majority of primitives and from computing fewer primitives overall.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-19 12:27 · 最新观测版本

Fast Mixed-Precision Real Evaluation

Evaluating real numbers to high precision is important in computational science, numerical computing, and in hardware and software design. Efficient algorithms exist for computing arithmetic operations and common elementary functions, but composing these primitives into larger expressions remains a challenge. The typical expression-evaluation algorithm computes all primitives in the expression to a uniform precision, doubling that precision until a sufficiently-accurate result is achieved. This is wasteful: usually only a few operations really need to be performed at high precision, and the bulk of the expression could be computed at a much lower, faster precision. However, no rigorous algorithm currently exists to compute these non-uniform precision assignments, nor to leverage non-uniform precision to reduce the number of primitive computations needed to evaluate an expression. We propose a new algorithm for deriving such rigorous precision assignments and reducing the number of primitive computations needed. This algorithm can leverage results computed at lower precisions to analytically determine a precision for each primitive that will result in a sufficiently-accurate evaluation. It can also use information from constant subexpressions, movability flags, and repeat flags to skip the computation of certain primitives, further reducing the time to evaluate real expressions. Our implementation, Reval, achieves an average speed-up of 3.97x compared to the widely-used Sollya tool, with the speed-up increasing to 9.26x on the most difficult inputs. A detailed evaluation shows that this speed-up results from both assigning lower precisions to the majority of primitives and from computing fewer primitives overall.

查看此版本解读 →查看此版本原文 ↗