Note on the Veltkamp/Dekker Algorithms with Directed Roundings
Abstract
The Veltkamp/Dekker algorithms are very useful for double-double arithmetic, when no fused multiply-add is available in hardware. Their analysis is well-known for rounding to nearest-even. We study how they behave with directed roundings in radix 2.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|
