Determine the number of iterations necessary to solve f(x) = x3 – x2 + 2 = 0 using newton-raphson from the left side.

Bonus Assignment

Questions
1. The number of iterations it takes gauss-seidel to converge:
a. Initial guess: [0, 0, 0]
b. Tolerance: 1e-6
c. Iterations: 50
d. 3 1 1 1 1 4 1 3 2 3 7 0

2. The number of iterations it takes jacobi method to converge
a. Initial guess: [0, 0, 0]
b. Tolerance: 1e-6
c. Iterations: 50
d. 3 1 1 1 1 4 1 3 2 3 7 0

3. Determine the number of iterations necessary to solve f(x) = x3 – x2 + 2 = 0 using newton-raphson from the left side
a. Tolerance: 1e-6
b. Initial guess: 0.5

4. Using the divided difference method, print out the Hermite polynomial approximation matrix
x f(x) f(x) f’(x)
0 1 1
1 2 1.23
2 4 1.55

5. The final value of the modified eulers method
a. Function: y – t3
b. Initial point: .5
c. Iterations: 100

d. Range: 0 < x < 3