I am attempting to make an initial approximation for the inverse algorithm (1/x)(adsbygoogle = window.adsbygoogle || []).push({});

'a' gets closer to the actual result each time the algorithm is preformedCode (Text):

n = NUMBER TO INVERSE

a = APPROXIMATION

a = a*(2-(n*a))

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

The equation gets more accurate as n increasesCode (Text):

a = .5^n

http://www09.wolframalpha.com/input/?i=%281%2Fx%29-%28.5^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?

**Physics Forums - The Fusion of Science and Community**

# Approximation for Newton-Raphson Inverse Algorithm

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: Approximation for Newton-Raphson Inverse Algorithm

Loading...

**Physics Forums - The Fusion of Science and Community**