Note on the Veltkamp/Dekker Algorithms with Directed Roundings (original) (raw)

Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2024

Résumé

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.

Dates et versions

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

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

Licence

Identifiants

Citer

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

574 Consultations

839 Téléchargements