This
** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
**Unformatted text preview: **i+1 by Newton's method is: where f ' is the derivative of f. Note that the method fails if f '(x) = 0 , at some approximation. Note f ' is n * x n-1 . This process terminates when the positive difference between two consecutive approximations is sufficiently small. 1 Write a class called NewtonRaphson that can be used to find an approximate solution of √ a using Newton's method, for any positive real number. Note: √ a can be expressed in functional notation as follows: f(x) = x 2 – a, From which f ' (x) = 2 * x, Print the iteration sequence and the approximation for each iteration. (That is, in a tabular form). Write a driver class called TestNewton . Use the following data to test the class NewtonRaphson . • The initial guess is 5.0 • In this exercise, the process terminates when the difference between two consecutive approximations is less than 0.00005 2...

View
Full Document