Register to reply

Approximation for Newton-Raphson Inverse Algorithm

Share this thread:
Jun19-09, 05:05 PM
P: 1
I am attempting to make an initial approximation for the inverse algorithm (1/x)


a = a*(2-(n*a))
'a' gets closer to the actual result each time the algorithm is preformed

The problem is finding the initial approximation. An exponential equation seems to fit the best

a = .5^n
The equation gets more accurate as n increases^x%29

I chose .5, because in binary, dividing by two is as simple as shifting to the right.

Is there any other way to make a close approximation that is better than .5^n?
Phys.Org News Partner Mathematics news on
'Moral victories' might spare you from losing again
Fair cake cutting gets its own algorithm
Effort to model Facebook yields key to famous math problem (and a prize)

Register to reply

Related Discussions
Newton-Raphson in Visual Basic 6 Programming & Computer Science 17
Newton-Raphson method Calculus & Beyond Homework 6
When Newton Raphson Fails Calculus & Beyond Homework 4
Newton-Raphson question Calculus 11
Newton-Raphson method for y=1/f(x) General Math 2