Fixed-Point iteration is a root-finding technique where determine the value of x that makes a function...

 

Transcribed Image Text:

Fixed-Point iteration is a root-finding technique where determine the value of x that makes a function f(x) have a target value of g. the function you are solving is re-arranged so that x is on the left side of the equation g g+x x = f(x) = f(x) + x = = f(x)+x-g and the next guess of the root is found by evaluating g at the current guess of the root - Xi+1 = f(x;) + x; g Iteration continues until the relative error epsilon: = - Xi Xi+1 Xi+1 gets less than a tolerance (e.g., 1e-6). Write a function with the header function s = myFixed Point (f, targetValue, x, tol) which solves for the value of x that will make f(x) the target value. You should ensure anytiva while-loops have an iteration counter which prevents infinite loops. (Should be a maximum of 1000.) Fixed-Point iteration is a root-finding technique where determine the value of x that makes a function f(x) have a target value of g. the function you are solving is re-arranged so that x is on the left side of the equation g g+x x = f(x) = f(x) + x = = f(x)+x-g and the next guess of the root is found by evaluating g at the current guess of the root - Xi+1 = f(x;) + x; g Iteration continues until the relative error epsilon: = - Xi Xi+1 Xi+1 gets less than a tolerance (e.g., 1e-6). Write a function with the header function s = myFixed Point (f, targetValue, x, tol) which solves for the value of x that will make f(x) the target value. You should ensure anytiva while-loops have an iteration counter which prevents infinite loops. (Should be a maximum of 1000.)