Earlier quoted context omitted.
>I'm a bit surprised by this. Most mathematicians know Newton's method. The mathematician was probably talking about this procedure that does not require convergence: http://en.wikipedia.org/wiki/Methods_of_computing_square_roo... This is the method I also learned (at one time and then forgot). Apparently, this procedure was part of a typical math curriculum many decades ago. Like Latin and cursive handwriting, it's…
Looking over it, it just seems to be a special case of building nested intervals using the monotonicity and continuity of the sqrt function.
In the square-root algorithm we remove the largest square possible at each stage, and work on the remainder. There's a hitch, because there's more detail to carry over at each stage. We do that with a linear factor of what we've already removed (that's the bit where we multiply the quotient so far by two) and then add the "epsilon" for the next lump to remove.
This can all be derived from first principles using the fact that (x+a)^2 = x^2 + 2ax + a^2. I did that when I was about 13.