The document describes two examples of using the fixed point iteration method to approximate the root of an equation. The first example finds the root of a 5th degree polynomial equation to within 0.091466 accuracy in 26 iterations. The second example uses the method to model mass over time and finds a root to within 0.003713 accuracy in 10 iterations, approximating the root as 58.71534077. Both examples track the iteration number, input value x, computed function value g(x), and error at each step to convergence.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
61 views580 pages
Fixed Point
The document describes two examples of using the fixed point iteration method to approximate the root of an equation. The first example finds the root of a 5th degree polynomial equation to within 0.091466 accuracy in 26 iterations. The second example uses the method to model mass over time and finds a root to within 0.003713 accuracy in 10 iterations, approximating the root as 58.71534077. Both examples track the iteration number, input value x, computed function value g(x), and error at each step to convergence.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 580
Michael Adrian V.
Ygnacio Fixed Point Iteration Method
MS ME-1 Example 1 INPUT VALUE Equation: 〖��〗 ^5+𝐵�^4+𝐶�^3+𝐷�^2+𝐸�+𝐹=0 OUTPUT VALUE �^5+14�^4−92�^3−1432�^2−1376�+8960=0 Termination Criteria: Accuracy Error 0.1 x = g(x) = 〖 ((−𝐵�^4−𝐶�^3−𝐷�^2−𝐸�−𝐹)/�) 〗 ^(1/5) No. of Iterations 26 �= 〖 (−14�^4+92�^3+1432�^2+1376�−8960) 〗 ^█(1@5) Root -14 A B C D E F 1 14 -92 -1432 -1376 8960