Content deleted Content added
m Archiving 1 discussion(s) to Talk:Methods of computing square roots/Archive 1) (bot |
Sqrt Tag: Reverted |
||
Line 19:
*the result of bit-twiddling floating point numbers, bypassing the API, is undefined
*we don't know whether values like zero, infinity and unnormalized floating point numbers, and big/little endian formats are correctly handled.
*Bolches yarboclos atte Paok.
*It definitely won't work on architectures like Unisys mainframes which are 48/96 bit, or 64-bit IEEE floats. Restructuring the expression to make it work in those cases is non-trivial.
*since I can readily find, by testing incremental offsets from the original, a constant which reduces the maximum error, the original constant isn't optimal, probably resulting from trial and error. How does one verify something that's basically a plausible random number? That it works for a range of typical values is cold comfort. (Because its only use is as an estimate, maybe we don't actually care that enumerable cases aren't handled(?)... they'll just converge slowly.)
| |||