We present division and square root algorithms for calculations with m
ore bits than are handled by the floating-point hardware. These algori
thms avoid the need to multiply two high-precision numbers, speeding u
p the last iteration by as much as a factor of 10. We also show how to
produce the floating-point number closest to the exact result with re
latively few additional operations.