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.
https://www.youtube.com/watch?ti
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
https://www.youtube.com/watch?ti
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:
https://www.youtube.com/watch?v=DGmNbs5Cywo&feature=em
b_logo
Thanks!