Scribd
Upload
38 views7 pages

Content: - Graphical Representation of Bisection Method - Algorithm of Bisection Method - Example

Uploaded by

incognitomod22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
38 views7 pages

Content: - Graphical Representation of Bisection Method - Algorithm of Bisection Method - Example

Uploaded by

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

Content

• Introduction
• Graphical Representation of Bisection method
• Algorithm of Bisection method
• Example
Introduction

• In mathematics, the bisection method is a root-finding method that


applies to any continuous function for which one knows two values
with opposite signs. The method consists of repeatedly bisecting the
interval defined by these values and then selecting the subinterval in
which the function changes sign, and therefore must contain a root. It
is a very simple and robust method, but it is also relatively slow.
Graphical Representation of Bisection method

• We first took two initial guesses, a1 and b1, for which f(a1)f(b1) < 0.
• According to the intermediate value theorem, the root should lie in
[a1, b1].We can find the midpoint of a1 and b1, which is b2.
• Thus, the initial interval is now reduced to [a1, b2] because f(a1)f(b2)
< 0.
• In the same manner, the interval is reduced until the approximate
solution is found.
• The Graph:
Algorithm of Bisection method

• 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) < 0Find 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(a) <0, there exist a root between t and a–
else if f(t) *f (b) < 0, there exist a root between t and bRepeat 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.
Example

• Q> Find the root of the following polynomial function using the bisection method:x2 – 5.
• .Solution:
• Let f(x) = x2 – 5
• f(0) = 0 – 5 = –5
• f(1) = 1 – 5 = –4
• f(2) = 4 – 5 = –1
• f(3) = 9 – 5 = 4
• ∴ the root lies in [2, 3]
• First iteration:x1 = (2 + 3)/2 = 2.5
• Now, f(x1) = (2.5)2 – 5 = 1.25
• Then, f(2).f(x1) < 0
• Thus, the root lies in [2, 2.5].
The root of the given function is 2.25 (approx).

You might also like