Fast and accurate approximation algorithms for computing floating point square root

DOI10.1007/S11075-024-01932-7MaRDI QIDQ6950251zbMATH OpenFDO

Authors Zbigniew Kokosiński, Pawel Gepner, Leonid V. Moroz, Volodymyr Samotyy, Mariusz Węgrzyn, Nataliia Gavkalova

Publication date 31 July 2025

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11075-024-01932-7

zbMATH Keywords

approximation algorithmfunction approximationHeron formulaNewton-Raphson methodnumerical algorithmsquare root

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical algorithms for specific classes of architectures (65Y10)

Cites work

• Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions
• Calculating the square root with arbitrary order of convergence
• Choosing starting values for certain Newton-Raphson iterations
• Fast calculation of inverse square root with the use of magic constant -- analytical approach
• Floating-point arithmetic
• Handbook of floating-point arithmetic
• High-precision division and square root
• Low Latency Floating-Point Division and Square Root Unit
• Optimal absolute error starting values for Newton-Raphson calculation of square root
• Optimal starting values for Newton-Raphson calculation of √x ^½
• The mathematical-function computation handbook. Programming using the MathCW portable software library

This page was built for publication: Fast and accurate approximation algorithms for computing floating point square root

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