- The iteration
,
converges to . For a = 2, determine
- Number of iterations n such that |xn+1 β xn| β€β10β5.
- Determine the order of convergence assuming 2 = 1.
- Let f(x) = tan(Οβx)βx and consider the equation f(x) = 0. Now, we wish to determine the approximate root for the equation in [1.6,3] using the following algorithm. Step 1: Divide the interval into n equal parts by the points
x0 = 1.6, x1 = x0 + h,…,xn = xnβ1 + h = 3.
Step 2: Then determine the values of f(xk), k = 0,1,…,n and set that value of xk to be the root for which |f(xk) β 0| is minimum.
- Consider the equation
.
Use bisection method to find an approximate root in the interval [Ο/2, Ο]. Then modify the approximation using Newtonβs method which is correct up to seven decimal places.
- Consider the equation
x
sinx = 0.
2 β
Use bisection method to find an approximate root in the interval [Ο/2, Ο]. Then modify the approximation using fix point iteration and calculate the order of convergence.
- Consider f(x) = 0, f(x) = eβx(x2 + 5x + 2) + 1. Find an approximate root using secant method with x0 = β1 and the stopping criterion |xn+1 β xn| β€ 10β5|xn+1|.
- Consider f(x) = 0, f(x) = eβx(x2 + 5x + 2) + 1. Use Bisection method to find an approximation of actual root. Then modify the root using following iterative scheme
.
Determine the order of convergence.
- Consider the equation
x
sinx = 0.
2 β
Use bisection method to find an approximate root in the interval [Ο/2, Ο]. Then modify the root using following iterative scheme
.
Determine the order of convergence.
1
- Consider f(x) = 0, f(x) = eβx(x2 + 5x + 2) + 1. Use Bisection method to find an approximation of actual root. Then modify the root using following iterative scheme
.
Determine the order of convergence.
2



