Note on the Veltkamp/Dekker Algorithms with Directed Roundings - Department of Algorithms, Computation, Image and Geometry Access content directly
Preprints, Working Papers, ... (Preprint) Year : 2024

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.
Fichier principal
Vignette du fichier
dekker.pdf (220.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04480440 , version 1 (27-02-2024)
hal-04480440 , version 2 (29-02-2024)

Licence

Attribution

Identifiers

  • HAL Id : hal-04480440 , version 2

Cite

Paul Zimmermann. Note on the Veltkamp/Dekker Algorithms with Directed Roundings. 2024. ⟨hal-04480440v2⟩
54 View
34 Download

Share

Gmail Facebook X LinkedIn More