Fast calculation of inverse square root with the use of magic constant -- analytical approach

DOI10.1016/J.AMC.2017.08.025MaRDI QIDQ1740253zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Leonid V. Moroz, Cezary J. Walczyk, Andriy Hrynchyshyn, Vijay Holimath, Jan L. Cieśliński

Publication date 29 April 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.04483

zbMATH Keywords

floating-point arithmeticinverse square rootmagic constantNewton-Raphson method

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical algorithms for computer arithmetic, etc. (65Y04)

Abstract: We present a mathematical analysis of transformations used in fast calculation of inverse square root for single-precision floating-point numbers. Optimal values of the so called magic constants are derived in a systematic way, minimizing either absolute or relative errors at subsequent stages of the discussed algorithm.

Recommendations

• An algorithm for inverse square-roots
• High-precision division and square root
• scientific article; zbMATH DE number 3928188
• Fast computation of the Nth root
• Optimal absolute error starting values for Newton-Raphson calculation of square root

Cites work

• Handbook of Floating-Point Arithmetic
• scientific article; zbMATH DE number 603361 (Why is no real title available?)

Cited in

(1)

• Fast and accurate approximation algorithms for computing floating point square root

This page was built for publication: Fast calculation of inverse square root with the use of magic constant -- analytical approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740253)