Scribd
Upload
46 views

Programming Techniques: 1 Fixed Point Method

This document describes two numerical methods for finding the root of a function: 1. The fixed point method, which finds successive approximations of the root by taking xn+1 = f(xn) until |xn+1 - f(xn)| is within a specified tolerance. 2. The method of false position or regula falsi method, which locates an interval containing the root, finds the equation of the line through two points on the function, and computes the x-intercept to get a new approximation within the interval. The process repeats until the root is approximated.

Uploaded by

Pramod Kalal
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
46 views

Programming Techniques: 1 Fixed Point Method

This document describes two numerical methods for finding the root of a function: 1. The fixed point method, which finds successive approximations of the root by taking xn+1 = f(xn) until |xn+1 - f(xn)| is within a specified tolerance. 2. The method of false position or regula falsi method, which locates an interval containing the root, finds the equation of the line through two points on the function, and computes the x-intercept to get a new approximation within the interval. The process repeats until the root is approximated.

Uploaded by

Pramod Kalal
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/ 2

Programming Techniques

Pramod
M19MA013

1 Fixed point method


This method is used for finding the root of the given function f (x).
initially locate the interval [m, n] in which the root of the function lies such that
f (m) ∗ f (n) < 0.
after finding the interval we can take a initial value to start with .
Initial value is the point between m and n and hence we can find this point close
to m or n by checking the value of f (m) and f (n) which is close to zero.
for given function we can find the value of x by several ways as x = g(x)
check for the functions g(x) that |f 0 (x)| < 1 which is true, now we will continue
Now find xn+1
xn+1 = f (xn ) (1)

We will continue this process till we get |xn+1 − f (xn )| <tolerence.

2 Method of False Position or Regula Falsi Method


This method helps us to approximate root of the given function f (x)
initially we have to locate the interval say [a0 , b0 ] in which root of the function
lies such that f (a0 ) ∗ f (b0 ) < 0.
Now find the equation of the line which passes thorugh (a0 , f (a0 )) and
(b0 , f (b0 )) that is
f (b0 ) − f (a0 )
y − f (b0 ) = ∗ (x − b0 ) (2)
b0 − a0
as the line passing thorugh (a0 , f (a0 )) and (b0 , f (b0 )) cuts x-axis at say b1 .
so here x = b1 and y = 0 which satisfied given equation (1) and substitute
the value of x and y in (1) to get
f (b0 ) − f (a0 )
f (b0 ) + ∗ (b1 − b0 ) = 0 (3)
b0 − a 0
hence the value of b1 is
b0 − a0 a0 f (b0 ) − b0 f (a0 )
b1 = b0 − f (b0 ) ∗ = (4)
f (b0 ) − f (a0 ) f (b0 ) − f (a0 )

1
so here approximated root after 1 iteration is b1 by repeating the method we
can check either root lies in [a0 , b1 ] or [b1 , b0 ] by checking the conditions

f (a0 ) ∗ f (b1 ) < 0

or
f (b1 ) ∗ f (b0 ) < 0

If root lies in [a0 , b1 ] i.e., f (a0 ) ∗ f (b1 ) < 0 holds then let a1 = a0 and b2 = b1
and further proceed with the same
Otherwise root in [b1 , b0 ] i.e., f (b1 )∗f (b0 ) < 0 holds then let a1 = b1 and b2 = b0
and further proceed with the same
Repeat this process untill we get the approximate root.

You might also like