.png){kind=icon}
.png){kind=icon}
Return
Algorithms for Triple-Word Arithmetic
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2019.2918451.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Triple-word arithmetic consists in representing high-precision numbers as the unevaluated sum of three floating-point numbers (with nonoverlapping constraints that are explicited in the paper). We introduce and analyze various algorithms for manipulating triple-word numbers: rounding a triple-word number to a floating-point number, adding, multiplying, dividing, and computing square-roots of triple-word numbers, etc. We compare our algorithms, implemented in the Campary library, with other solutions of comparable accuracy. It turns out that our new algorithms are significantly faster than what one would obtain by just using the usual floating-point expansion algorithms in the special case of expansions of length 3.
Keywords:
Computer arithmetic
floating-point arithmetic
triple-word arithmetic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K