We describe the implementation of the reciprocal square root --- also called inverse square root --- as a native function in the MPFR library. The difficulty is to implement Newton's iteration for the reciprocal square root on top's of GNU MP's extsc{mpn} layer, while guaranteeing a rigorous $1/2$ ulp bound on the roundoff error.
@InProceedings{zimmermann:DagSemProc.08021.12, author = {Zimmermann, Paul}, title = {{Implementation of the reciprocal square root in MPFR}}, booktitle = {Numerical Validation in Current Hardware Architectures}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8021}, editor = {Annie Cuyt and Walter Kr\"{a}mer and Wolfram Luther and Peter Markstein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08021.12}, URN = {urn:nbn:de:0030-drops-14357}, doi = {10.4230/DagSemProc.08021.12}, annote = {Keywords: Multiple precision, floating-point, inverse square root, correct rounding, MPFR library} }
Feedback for Dagstuhl Publishing