| Home Page Download Score Compare About Contact Us | |||||||||
|
wPrime uses a recursive call of Newton's method for estimating functions,
with f(x)=x2-k, where k is the number we're sqrting, until Sgn(f(x)/f'(x))
does not equal that of the previous iteration, starting with an estimation
of k/2. It then uses an iterative calling of the estimation method a set
amount of times to increase the accuracy of the results. It then confirms
that n(k)2=k to ensure the calculation was correct. It repeats
this for all numbers from 1 to the requested maximum.
Threading
Hardware Information
Name
So what's 'Prime' got to do with square roots? Well nothing, initially I had
planned a Prime number calculator but no logical pattern for each prime
number is known so it's difficult to confirm accuracy of the results. Square
roots however, have a logical and simple reverse (the square).
License
wPrime is freeware, which means you can download it, distribute it, host it, etc
without any need for my consent. I do ask though, that you provide a link to this website
if you choose to host it, etc.
|
|||||||||
|
Copyright © WALTER EIGNER 2004-2010 - All rights reserved Contact Us |
|||||||||