"be consistent"  
PerlMonks 
comment on 
( #3333=superdoc: print w/replies, xml )  Need Help?? 
I was able to make your program a lot
faster with a simple change.
Newton's method tends to double the number of correct digits with each iteration.
If you get a good initial guess, the convergence is extremely fast.
But if you botch the initial guess, there are no correct digits.
Your initial guess was very bad:
Newton's method works by drawing a straight line, tangent to the polynomial curve, at the point of the guess. For your examples, your guess was much too big, so the straight line was almost vertical. This means that the new guess wasn't very far from the old one. I replaced this one line with the following: This uses regular hardware floatingpoint arithmetic to make the initial guess. Hardware floating point is accurate to 17 decimal places and is almost instantaneous. Suddenly, the initial guess is vastly more accurate, and the cost is almost zero. Suddenly, I was getting very accurate answers very quickly. After 10 iterations, your version of the program still thinks that Root(1000,60) is about 14.088. The correct answer is about 1.12; with my change the program has the answer correct to 130 places after only 4 iterations. I'd also recommend simplifying the guess computation as suggested by arhuman above. I guess he made a simple mistake in the algebra. But you have g (g^{r}n)/rg^{r1}, and you can cancel the g^{r} out of the numerator by rewriting this expression as gg/r+ n/rg^{r1}. This trades a ** for a /, which should be a big win. Hope this helps.
 In reply to Re: Help w/ Code Optimization
by Dominus

