Thread Subject:

Approximate sqrt

Hi Guys

I was wondering if it is possible to compute a lower or higher approximation of the square root of a double number, in order to find somthing faster than the sqrt command. Notice that I mean an operator similar to + - or * or sqrt.

I have found algorithms to do such apprximation but thay are all slower than the sqrt command since they require some looping.

I thing what I need is something that works directly on bits.

Does anybody know how to do such thing?

Does anybody know how to find something similar?


THanks to all those that will reply.

Something intersting can be found at:

 http://www.keil.com/forum/docs/thread7934.asp

http://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Approximations_that_depend_on_IEEE_representation