100% found this document useful (1 vote)
111 views4 pages

Fixed Point Iteration: Roots of Equation

The document discusses the fixed point iteration method for finding roots of equations. It explains that in fixed point iteration, the given function f(x) is split into two sub-functions f1(x) and f2(x) such that the root lies where f1(x) = f2(x). Typically f1(x) = x. It provides the steps of the method which involve rearranging the equation into the form x = g(x) and then iteratively finding new values of x as xn = g(xo). The document includes two examples applying the method to solve equations.

Uploaded by

Mehedi Hasan Apu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
111 views4 pages

Fixed Point Iteration: Roots of Equation

The document discusses the fixed point iteration method for finding roots of equations. It explains that in fixed point iteration, the given function f(x) is split into two sub-functions f1(x) and f2(x) such that the root lies where f1(x) = f2(x). Typically f1(x) = x. It provides the steps of the method which involve rearranging the equation into the form x = g(x) and then iteratively finding new values of x as xn = g(xo). The document includes two examples applying the method to solve equations.

Uploaded by

Mehedi Hasan Apu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Fixed Point Iteration

Roots of Equation

Asifur Rahman

CEN 205 Numerical Methods Asifur Rahman January 18, 2017 1/4
Fixed Point Iteration Fixed Point Iteration

I Suppose we want to find the root of f(x).


I In fixed point iteration, the given funcion is split into
two sub-functions, f1 (x) and f2 (x)
I The root lies where the y value of both sub-functions
are equal, i.e. f1 (x) = f2 (x)
I Usually f1 (x) = x is considered

Steps
1. Express the given f(x) = 0 in the form of x = g(x)
2. Assume a reasonable value of root, xo
3. Determine new root using, xn = g(xo )
4. Repeat Step 3 using xo = xn

CEN 205 Numerical Methods Asifur Rahman January 18, 2017 2/4
Example 1 Fixed Point Iteration

Ques. Solve the following equation using fixed Rearrangement of f(x)


point iteration. Given that, a < 0.1%. √
4 4
4 x − x − 4 = 0; x = x + 4; x= 4x+4
x −x−4=0

Iteration 1
xo = 1
√ √
4
xn = 4 x + 4 = 1 + 4 = 1.4953
1.4953 − 1

a = = 33.12%
1.4953

Iteration 2
xo = 1.4953
√ √4
xn = 4 x + 4 = 1.4953 + 4 = 1.5311
1.5311 − 1.4953

a = = 2.33%
1.5311

Fixed Point Iteration

i xo xn a
1 1.0000 1.4953 33.1260
2 1.4953 1.5311 2.3339
3 1.5311 1.5336 0.1619
4 1.5336 1.5337 0.0112

CEN 205 Numerical Methods Asifur Rahman January 18, 2017 3/4
Example 2 Fixed Point Iteration

Ques. Solve the following equation using fixed Rearrangement of f(x)


point iteration. Given that, a < 1%. q
x 2 2 x
x 2
e − 3x = 0 e − 3x = 0; 3x = e ; x= ex /3

Iteration 1
xo = 1
q q
xn = ex /3 = e(1) /3 = 0.9519
0.9519 − 1

a = = 5.05%
0.9519

Iteration 2
xo = 0.9519
q q
xn = ex /3 = e(0.9519) /3 = 0.9293
0.9293 − 0.9519

a = = 2.43%
0.9293

Fixed Point Iteration

i xo xn a
1 1.0000 0.9519 5.0542
2 0.9519 0.9293 2.4347
3 0.9293 0.9188 1.1377
4 0.9188 0.9140 0.5240

CEN 205 Numerical Methods Asifur Rahman January 18, 2017 4/4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy