|Jun19-09, 05:05 PM||#1|
Approximation for Newton-Raphson Inverse Algorithm
I am attempting to make an initial approximation for the inverse algorithm (1/x)
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
a = .5^n
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?
|Similar Threads for: Approximation for Newton-Raphson Inverse Algorithm|
|Newton-Raphson in Visual Basic 6||Programming & Comp Sci||17|
|Newton-Raphson method||Calculus & Beyond Homework||6|
|When Newton Raphson Fails||Calculus & Beyond Homework||4|
|Newton-Raphson method for y=1/f(x)||General Math||2|