Bisection Method Definition Convergence of Bisection MethodThe rate of convergence of the Bisection Merits of bisection method

method is linear and slow but it is guaranteed to converge if function is real and
The bisection method is used to find the roots of a polynomial equation. It
separates the interval and subdivides the interval in which the root of the
equation lies. The principle behind this method is the intermediate theorem for
continuous functions. It works by narrowing the gap between the positive and
negative intervals until it closes in on the correct answer. This method narrows
the gap by taking the average of the positive and negative intervals. It is a
simple method and it is relatively slow. The bisection method is also known as
interval halving method, root-finding method, binary search method or
dichotomy method.
Let us consider a continuous function “f” which is defined on the closed
interval [a, b], is given with f(a) and f(b) of different signs. Then by
intermediate theorem, there exists a point x belong to (a, b) for which f(x) =0.
Bisection Method Algorithm
Follow the below procedure to get the solution for the continuous function:For
any continuous function f(x),
Find two points, say a and b such that a < b and f(a)* f(b) < 0
Find the midpoint of a and b, say “t”
t is the root of the given function if f(t) = 0; else follow the next step
Divide the interval [a, b]
If f(t)*f(b) <0, let a = t
Else if f(t) *f(a), let b = t
Repeat above three steps until f(t) = 0.
The bisection method is an approximation method to find the roots of the given
equation by repeatedly dividing the interval. This method will divide the
interval until the resulting interval is found, which is extremely small.
Bisection Method Example
Question: Determine the root of the given equation x2-3 = 0 for x ∈ [1, 2]
a) The iteration using bisection method always produces a root, since the
continuous in an interval bounded by given two initial guess.
Accuracy of bisection method is very good and this method is more reliable
than other open methods like Secant, Newton Raphson method etc.
Despite being slower to converge, accuracy of this method increases as number
of iterations increases.
In Bisection method, error is reduced by factor of ½ after each iterations, so we
can write: en+1/en = 1/2. Which gives:
en+1 = en/2
Or, en+1 = 0.5 en ----- (1)
Here en+1 is error at n+1th iteration and en is error at nth iteration.
From equation (1) it can be concluded that, error at n+1th iteration is linearly
related to error at nth iteration i.e. en+1 ∝ en
For this reason, Bisection method is said to have linear rate of convergence.
Secant Method
A root-finding algorithm which assumes a function to be approximately linear
in the region of interest. Each improvement is taken as the point where the
approximating line crosses the axis. The secant method retains only the most
recent estimate, so the root does not necessarily remain bracketed. When
the algorithm does converge, its order of convergence is
(1)
where is a constant and is the golden ratio.
(2)
method brackets the root between two values. b) As iterations are conducted,
the length of the interval gets halved. So one can guarantee the convergence in
case of the solution of the equation. c) the Bisection Method is simple to
program in a computer.
Demerits of bisection method
a) The convergence of the bisection method is slow as it is simply based on
halving the interval. b) Bisection method cannot be applied over an interval
where there is a discontinuity. c) Bisection method cannot be applied over an
interval where the function takes always values of the same sign. d) The
method fails to determine complex roots. e) If one of the initial guesses 0 a or 0
b is closer to the exact solution, it will take larger number of iterations to reach
the root.
Newton-Raphson method (also known as Newton's method) is a way to
quickly find a good approximation for the root of a real-valued function f(x) =
0f(x)=0. It uses the idea that a continuous and differentiable function can be
approximated by a straight line tangent to it.
Suppose you need to find the root of a continuous, differentiable
function f(x)f(x), and you know the root you are looking for is near the point x
= x_0x=x0. Then Newton's method tells us that a better approximation for the
root is
This process may be repeated as many times as necessary to get the desired
accuracy. In general, for any xx-value x_nxn, the next value is given by

Solution: (3)
Given: x2-3 = 0
Let f(x) = x2-3 Note: the term "near" is used loosely because it does not need a precise
Now, find the value of f(x) at a= 1 and b=2. (4) definition in this context. However, x_0x0 should be closer to the root you need
f(x=1) = 12-3 = 1 – 3 = -2 < 0 than to any other root (if the function has multiple roots).
f(x=2) = 22-3 = 4 – 3 = 1 > 0
The given function is continuous, and the root lies in the interval [1, 2].Let “t”
be the midpoint of the interval. (5)
I.e., t = (1+2)/2
t =3 / 2
t = 1.5
Therefore, the value of the function at “t” is
f(t) =f(1.5) = (1.5)2-3 = 2.25 – 3 = -0.75 < 0
f(t) is negative, so b is replaced with t= 1.5 for the next iterations.The iterations
for the given functions are:

Iterations a b t f(a) f(b) f(t)

1 1 2 1.5 -2 1 -0.75
Fixed Point method

|
Trapezoidal Rule: