Improving the Accuracy of the Fast Inverse Square Root by Modifying Newton–Raphson Corrections
Cezary J. Walczyk, Leonid Moroz, Jan L. Cieśliński · Entropy · 2021
Direct computation of functions using low-complexity algorithms can be applied both for hardware constraints and in systems where storage capacity is a challenge for processing a large volume of data. We present improved algorithms for fast calculation of the inverse square root function for single-precision and double-precision floating-point numbers. Higher precision is also discussed. Our approach consists in minimizing maximal errors by finding optimal magic constants and modifying the Newton-Raphson coefficients. The obtained algorithms are much more accurate than the original fast inverse square root algorithm and have similar very low computational costs.