Question: This is a mathematica code for fixed-point iteration. expr={1,0,9999}; f[{i_,xi_,err_}]:=(xipp=0.2062129*(20+(2*xi))^(2/5); {i+1,xipp,Abs[(((xipp-xi)/(xipp))*100)]}); NestWhileList[f,expr,#[[3]]>=.05&] If I were to prove this converges for all initial guesses would I
This is a mathematica code for fixed-point iteration.
expr={1,0,9999}; f[{i_,xi_,err_}]:=(xipp=0.2062129*(20+(2*xi))^(2/5); {i+1,xipp,Abs[(((xipp-xi)/(xipp))*100)]}); NestWhileList[f,expr,#[[3]]>=.05&] If I were to prove this converges for all initial guesses would I use the same code and replace the function with its derivative?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
Study Help