High-level algorithms for correctly-rounded reciprocal square roots

We analyze two fast and accurate algorithms recently presented by Borges for computing x^{-1/2} in binary floating-point arithmetic (assuming that efficient and correctly-rounded FMA and square root are available). The first algorithm is based on the Newton-Raphson iteration, and the second one uses...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings - Symposium on Computer Arithmetic S. 18 - 25
Hauptverfasser:	Borges, Carlos F., Jeannerod, Claude-Pierre, Muller, Jean-Michel
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.09.2022
Schlagworte:	accuracy analysis correct rounding Digital arithmetic error-free transform Floating-point arithmetic fused multiply-add Newton method reciprocal square root Robustness Testing Transforms
ISSN:	2576-2265
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!