Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I saw that done years ago in assembler for UNIVAC mainframes. Tear apart the exponent and mantissa. Shift mantissa if exponent is odd. Shift exponent right one bit to get square root of exponent. Look up starting guess from table using a few high bits of mantissa. Run two iterations of Newton's method. Reassemble mantissa and exponent. Normalize. Done.


Is it possible to keep ulp precision in all cases after doing all that separation, normalization, and recombination?




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: