Preprint Article Version 1 This version is not peer-reviewed

A Modification of the Fast Inverse Square Root Algorithm

Version 1 : Received: 1 August 2019 / Approved: 5 August 2019 / Online: 5 August 2019 (05:09:06 CEST)

A peer-reviewed article of this Preprint also exists.

Walczyk, C.J.; Moroz, L.V.; Cieśliński, J.L. A Modification of the Fast Inverse Square Root Algorithm. Computation 2019, 7, 41. Walczyk, C.J.; Moroz, L.V.; Cieśliński, J.L. A Modification of the Fast Inverse Square Root Algorithm. Computation 2019, 7, 41.

Journal reference: Computation 2019, 7, 41
DOI: 10.3390/computation7030041

Abstract

We present an improved algorithm for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithm is much more accurate than the famous fast inverse square root algorithm and has a similar computational cost. The presented modification concern Newton-Raphson corrections and can be applied when the distribution of these corrections is not symmetric (for instance, in our case they are always negative).

Subject Areas

floating-point arithmetic; inverse square root; magic constant; Newton-Raphson method

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.