Scribd
Upload
21 views8 pages

Bisection Method for Root Finding

The bisection method is used to find the roots or solutions of nonlinear equations. It works by repeatedly bisecting the interval that contains the root and narrowing in on the solution. The algorithm involves first checking if the root lies between two values a and b, then estimating the root by taking the midpoint of the interval. It then determines if the new interval contains the root and repeats the process until finding the solution. An example finds the root of x^3 = 20 using this method over 3 iterations.

Uploaded by

sairin park
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
21 views8 pages

Bisection Method for Root Finding

The bisection method is used to find the roots or solutions of nonlinear equations. It works by repeatedly bisecting the interval that contains the root and narrowing in on the solution. The algorithm involves first checking if the root lies between two values a and b, then estimating the root by taking the midpoint of the interval. It then determines if the new interval contains the root and repeats the process until finding the solution. An example finds the root of x^3 = 20 using this method over 3 iterations.

Uploaded by

sairin park
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

ROOT FINDING

METHODS: BISECTION
Solutions of Nonlinear Equations
Bisection or
Binary - search
Method
 The roots or solutions of a general quadratic function

Preliminary
concepts can be determined by:
The roots or solutions of a general cubic function

Preliminary
Concepts can be determined by
 Based on the Intermediate Value Theorem, the method callsa for
Bisection or repeated halving (bisecting) of subintervals of [a, b], at each step,
locating the half containing p.
Binary – search
Method  It requires an interval bracketing the root which may not be easily
determined.
ALGORITHM:
Bisection or
1. Check if the root lies between [a, b]: that is, if f(a) * f(b) < 0
Binary – search 2. Let [a0, b0] = [a, b]: set k = 0
Method
(ALGORITHM) 3. Estimate root ck+1 by ck+1 = ak + bk.
2

4. If ck+1 = 0 , then accept the root and STOP.


ELSE, determine the next interval containing the root and repeat
step number 3.
[Link]
me_continue=1&v=Y2AUhxoQ- a. if f(a) * f(ck+1) < 0, set ak+1 = ak and bk+1 = ck+1
OQ&feature=emb_logo (algorithm)
b. if f(b) * f(ck+1) < 0, set ak+1 = ak +1 and bk+1 = bk
[Link]
me_continue=111&v=244sNlaspTg
&feature=emb_logo (background)
 Find the root of the equation X3 = 20: This example uses 3
iterations.

Example:
 Watch this video:
[Link]
b_logo
Thanks!

You might also like