Scribd
Upload
53 views22 pages

Roots of Nonlinear Equation BISECTION METHOD

This document discusses numerical methods for finding the roots of nonlinear equations. It focuses on the bisection method. The bisection method works by repeatedly bisecting an interval containing a root and narrowing in on the root. The steps of the bisection method are outlined. An example of using the bisection method to find the root of the equation f(x)=x3-x-1 is shown over 11 iterations, arriving at an approximate root of 1.32471.

Uploaded by

Marj Manlagnit
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
53 views22 pages

Roots of Nonlinear Equation BISECTION METHOD

This document discusses numerical methods for finding the roots of nonlinear equations. It focuses on the bisection method. The bisection method works by repeatedly bisecting an interval containing a root and narrowing in on the root. The steps of the bisection method are outlined. An example of using the bisection method to find the root of the equation f(x)=x3-x-1 is shown over 11 iterations, arriving at an approximate root of 1.32471.

Uploaded by

Marj Manlagnit
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
You are on page 1/ 22

Roots of Nonlinear Equation

MATH5E- NUMERICAL SOLUTIONS FOR CE PROBLEMS

PREPARED BY:
ENGR. RICHMONILYN A. SALVADOR, MSCE
 A Nonlinear equation can be defined as the
equation having the maximum degree 2 or
more than 2.

A linear equation forms a straight line on the


graph.
A nonlinear equation forms a curve on the
graph.
The general form of linear equation is,
y = mx +c.
Solutions of Equations in One Variable
Numerical Algorithm To find the
approximate solutions (roots) for non-linear
equations,

Bisection method
Newton-Raphson method (Newton’s method)
False Position Method (Regula Falsi method)
The Secant Method
Bisection method
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.
Steps for Bisection Method:
Steps for Bisection Method:
ALGORITHM

Bisection method Steps (Rule)


Step-1: Find points a and b such
that a<b and f(a)⋅f(b)<0.
Step-2: Take the interval [a,b] and
find next value x0=a+b2
Step-3: If f(x0)=0 then x0 is an exact root,
else if f(a)⋅f(x0)<0 then b=x0,
else if f(x0)⋅f(b)<0 then a=x0.
Step-4: Repeat steps 2 & 3
until f(xi)=0 or |f(xi)|≤Accuracy
Example:
Find a root of an equation, f(x)=x3-x-1
 Solution:  1st iteration :  2nd iteration :
x3-x-1=0 f(1)=-1<0 and f(2)=5>0 f(1)=-1<0 and f(1.5)=0.875>0
Let f(x)=x3-x-1
∴ Now, Root lies
Here: between 1 and 2 ∴ Now, Root lies between 1 and 1.5
x 0 1 2
x0=1+22=1.5
f(x) -1 -1 5 x1= (1+1.5)/2 =1.25
f(x0)=f(1.5)=0.875>0 f(x1)= f(1.25)= -0.29688<0
Example:
Find a root of an equation, f(x)=x3-x-1
 3rd iteration :  4th iteration :
f(1.25)=-0.29688<0 and f(1.25)=-0.29688<0 and f(1.375)=0.22461>0
f(1.5)=0.875>0
∴ Now, Root lies between 1.25 and 1.375
∴ Now, Root lies
between 1.25 and 1.5 x3=(1.25+1.375)/2=1.3125

x2=(1.25+1.50)/2=1.375 f(x3)=f(1.3125)=-0.05151<0

f(x2)=f(1.375)=0.22461>0
Example:
Find a root of an equation, f(x)=x3-x-1
 5th iteration :  6th iteration :
f(1.3125)=-0.05151<0 and f(1.3125)=-0.05151<0 and
f(1.375)=0.22461>0 f(1.34375)=0.08261>0

∴ Now, Root lies between ∴ Now, Root lies between


1.3125 and 1.375 1.3125 and 1.34375

x4=(1.3125+1.375)/2=1.34375 x5=(1.3125+1.34375)/2=1.32812

f(x4)=f(1.34375)=0.08261>0 f(x5)=f(1.32812)=0.01458>0
Example:
Find a root of an equation, f(x)=x3-x-1
 7th iteration :  8th iteration :
f(1.3125)=-0.05151<0 and f(1.32031)=-0.01871<0 and
f(1.32812)=0.01458>0 f(1.32812)=0.01458>0

∴ Now, Root lies between ∴ Now, Root lies between


1.3125 and 1.32812 1.32031 and 1.32812

x6=(1.3125+1.32812)/2=1.32031 x7=(1.32031+1.32812)/2=1.32422

f(x6)=f(1.32031)=-0.01871<0 f(x7)=f(1.32422)=-0.00213<0
Example:
Find a root of an equation, f(x)=x3-x-1
 9th iteration :  10th iteration :
f(1.32422)=-0.00213<0 and f(1.32422)=-0.00213<0 and
f(1.32812)=0.01458>0 f(1.32617)=0.00621>0

∴ Now, Root lies between ∴ Now, Root lies between


1.32422 and 1.32812
1.32422 and 1.32617
x8=(1.32422+1.32812)/2=1.32617
x9=(1.32422+1.32617)/2=1.3252
f(x8)=f(1.32617)=0.00621>0
f(x9)= f(1.3252)=0.00204>0
Example:
Find a root of an equation, f(x)=x3-x-1
 11th iteration : Approximate root of the
f(1.32422)=-0.00213<0 and
equation x3-x-1=0 using
f(1.3252)=0.00204>0
Bisection method
∴ Now, Root lies between is 1.32471
1.32422 and 1.3252

x10=(1.32422+1.3252)/2=1.32471

f(x10)=f(1.32471)=-0.00005<0
Example:
Find a root of an equation, f(x)=x3-x-1
Approximate root of the equation x3-x-1=0 using Bisection method is 1.32471
END

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