UNIT –I

NAME Another name Formula Steps and procedure

Bisection Method Bolzano’s method (or) 1. Find two points, say a and b such that a < b
Interval Halving method
-ve +ve

2. Find the midpoint of a and b.

-ve Midpoint +ve

3. If the Mid-point is positive

+ve
-ve Midpoint +ve

The root lies between

these two points

If the Mid-point is negative

-ve
-ve Midpoint +ve

The root lies between

these two points
 NAME Another name Formula Steps and procedure
Regula-Falsi The Method of false 𝑎𝑎𝑎𝑎(𝑏𝑏) − 𝑏𝑏𝑏𝑏(𝑎𝑎) 1. Find two points, say a and b such that a < b
𝑥𝑥𝑛𝑛 =
Method Position 𝑓𝑓(𝑏𝑏) − 𝑓𝑓(𝑎𝑎) . 𝑥𝑥1 𝑥𝑥2
-ve +ve
2. Take the interval [a, b] and determine the next
value of𝑥𝑥3 .
Take a=𝑥𝑥1 𝑓𝑓(𝑎𝑎)
b=𝑥𝑥2 𝑓𝑓(𝑏𝑏)
𝑥𝑥1 𝑥𝑥3 𝑥𝑥2
-ve +ve
Midpoint

3. If the Mid-point is positive

+ve
-ve Midpoint +ve

The root lies between

these two points

If the Mid-point is negative

-ve
-ve Midpoint +ve

The root lies between

these two points
 NAME Another name Formula Steps and procedure
Newton’s Method Newton’s Raphson 𝑓𝑓(𝑥𝑥𝑛𝑛 ) 1. Find two points, say a and b such that a < b
𝑥𝑥𝑛𝑛+1 = 𝑥𝑥𝑛𝑛 − ′
method (or) Method of 𝑓𝑓 (𝑥𝑥𝑛𝑛 ) .
Tangents -ve +ve

2. Find the midpoint of a and b say 𝑥𝑥1 .

𝑥𝑥1
-ve Midpoint +ve

3. Take differentiation 𝑓𝑓(𝑥𝑥) say 𝑓𝑓 ′ (𝑥𝑥).

4. Using formula to find 𝑥𝑥2 , 𝑥𝑥3 , 𝑥𝑥4 , 𝑥𝑥5 … … …

Fixed point Method of successive

iteration method approximation 1. Find two points, say a and b such that a < b
. a b
-ve +ve

2. We rewrite this equation 𝑥𝑥 = 𝑔𝑔(𝑥𝑥).

There are many ways doing this. For
example,the equation is 𝑥𝑥 3 + 𝑥𝑥 2 − 2 = 0
Can be expressed in different form
1
2
𝑥𝑥 = � , 𝑥𝑥 = √2 − 𝑥𝑥 3 , 𝑥𝑥 = (2 − 𝑥𝑥 2 )3 .
1+𝑥𝑥
3. Take differentiation 𝑔𝑔(𝑥𝑥) say 𝑔𝑔′ (𝑥𝑥).
4. Check the condition |𝑔𝑔′ (𝑥𝑥 )| < 1.If the
condition satisfied. Take any value between
these two points say a and b (say x1).
5. If the condition not satisfied.Take different x.
6. Sucessive substitution gives approximation
𝑥𝑥2 = 𝑔𝑔(𝑥𝑥1 ), 𝑥𝑥3 = 𝑔𝑔(𝑥𝑥2 ) … . . 𝑥𝑥𝑛𝑛 = 𝑔𝑔(𝑥𝑥𝑛𝑛−1 )