19 апр. 2015 г. · After doing some research, I found a quite effective way to compute square roots; the method is called "digit-by-digit calculation" (see here).

29 сент. 2017 г. · This is digit-by-digit algorithm (here binary digits). It is kind of binary search. You set i-th bit if squared result becomes closer to x but does not exceed ...

25 мая 2014 г. · I need to write program to find the integer square root of a number which is thousands of digits long. I can't use Newton Raphson as I don't have data types to ...

16 янв. 2018 г. · I am trying to implement the square root of input using the digit by digit algorithm in R. I have found some pseudo code online on how to do ...

19 июн. 2015 г. · I need to implement a digit recurrence square root for generic floating point format such that exp_size + mant_size + 1 <= 64.

13 мая 2016 г. · I'm writing a matlab code which uses digits of an irrational number. I tried finding it using a taylor expansion of $\sqrt(1+x)$.

20 февр. 2020 г. · For example, if you have the first n digits of the square root of a number as a decimal string, you can simply try appending each digit 0 to 9, ...

13 мар. 2013 г. · The script below extracts integer square roots. It uses no divisions, only bitshifts, so it is quite fast. It uses Newton's method on the ...

25 дек. 2010 г. · Square root can be found using Newton's method - you have to get an initial guess (a good one is to take a square root from the highest digit, ...

9 дек. 2015 г. · The square root of a 64-bit unsigned integer can be computed efficiently by first computing the reciprocal square root, 1/√x or rsqrt (x), ...