Scribd
Upload
51 views9 pages

Bisection Method

The bisection method is a root-finding algorithm that uses binary search to bracket a root within two initial values A and B where the function changes sign. It repeatedly bisects the interval and selects the subinterval in which the root must lie. While simple and robust, it converges slowly, requiring one function evaluation per iteration. It is often used as a preliminary step before faster converging methods.

Uploaded by

Vivek Kanu
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
51 views9 pages

Bisection Method

The bisection method is a root-finding algorithm that uses binary search to bracket a root within two initial values A and B where the function changes sign. It repeatedly bisects the interval and selects the subinterval in which the root must lie. While simple and robust, it converges slowly, requiring one function evaluation per iteration. It is often used as a preliminary step before faster converging methods.

Uploaded by

Vivek Kanu
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/ 9

BISECTION METHOD

NAME: Afshan Taskill


STUDENT CODE: BWU/BCA/22/340
COURSE: NUMERICAL METHOD
COURSE CODE: BCAC303
INTRODUCTION
• This method is also know as the Interval halving method.
• It is method based on division of halves.
• It is one of the bracketing method in finding roots on a
nonlinear equation. It is noted to be based on Bolzano's
theorem for continuous functions.
DEFINITION
The bisection method in mathematics is a root finding method which
repeatedly bisects an interval and then selects a subinterval in which a root
must lie for further processing. It is a very simple and robust method, but it is
also relatively slow. Because of this, it is often used to obtain a rough
approximation to a solution which is then used as a starting point for more
rapidly converging methods.
GRAPHICAL REPRESENTATION
ALGORITHM

Step 1: Choose two approximations A and B (B>A) such that f(A)*


f(B)< 0
Step 2: Evaluate the midpoint C of [A,B] given by C=(A+B)/2
Step 3: If f(C)*f(B)<0 then rename B & C as A & B. If not rename
of C as B. Then apply the formula of Step 2.
Step 4:Stop evolution when the different of two successive values
of C obtained from Step 2 is numerically less than E, the prescribed
accuracy.
EXAMPLE

Given that, f(x)=X2-2. Our task is finding the root of this equation.
Solution:
Let us start with an interval of length one: A0 =1 and B1= 2. Note
that f(A0) = f(1) = -1 <0, and f(B0) =f(2) = 2>0. Here are the first 20
applications of the bisection algorithm.
ADVANTAGE

• Simple and easy to implement.


• One function evaluation per iteration.
• The size of the interval containing the zero is reduced after
each iteration.
• No knowledge of the derivative is needed
DISADVANTAGE

• Slow to converge.
• Good intermediate approximations may be discarded.
• Will only work if the Jacobian can be computed
• If the Jacobian is singular the algorithm breaks.
• Number of iterations can not be determined before the
algorithm begins.
THANK YOU!!!

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