Square convergence of the algorithm is (each iteration doubles the effective number of bits), Such a request to the Q digits to at least log2Q 1 iterations Obviously, this calculation is expressed to high accuracy, The algorithm I used is the ordinary high-precision addition, subtraction Addition and subtraction is O (n), the time spent very little. Multiplication and division is O (n2), mainly time spent in this way. By this algorithm can be seen, bn square root calculation needs. There are two ways to open root: ① The middle school to teach our method, each time to open the two radicals, with the division to lose, This time is n2 · n/2 = O (n3), can not stand it! ② The Newton iteration. That x0 = any positive number, xn 1 = (xn a/xn)/2 Similarly, the square is also the convergence of the algorithm. One division is O (n2) of the It still needs O (n2log2n) time

sqrt2.dat
Extended.c

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．