Scribd
Upload
76 views

TOPIC 3 - Roots of Non-Linear Equations

The document discusses methods for finding the real roots of nonlinear equations, including the bisection method, regula falsi method, and Newton's method. The bisection method uses interval halving to find a root within a closed domain. Regula falsi is similar but chooses new points along the line between function values. Newton's method uses calculus to iteratively find roots in an open domain by estimating the root as a function of the tangent line's x-intercept. Examples demonstrate applying each method to find the root of a sample function.

Uploaded by

Bryan Yu
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
76 views

TOPIC 3 - Roots of Non-Linear Equations

The document discusses methods for finding the real roots of nonlinear equations, including the bisection method, regula falsi method, and Newton's method. The bisection method uses interval halving to find a root within a closed domain. Regula falsi is similar but chooses new points along the line between function values. Newton's method uses calculus to iteratively find roots in an open domain by estimating the root as a function of the tangent line's x-intercept. Examples demonstrate applying each method to find the root of a sample function.

Uploaded by

Bryan Yu
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/ 34

REquations

oots of NonLinear

NUMSOL-CE
HOLY ANGEL UNIVERSITY
NONLINEAR EQUATIONS

ENGR. BRYAN DALE POLICARPIO YU, MSCE


NONLINEAR EQUATIONS
REAL ROOTS OF A SINGLE VARIABLE
FUNCTION

ENGR. BRYAN DALE POLICARPIO YU, MSCE


REAL ROOTS OF A SINGLE VARIABLE
FUNCTION
 
Given a continuous nonlinear function ,
find the value such that

ENGR. BRYAN DALE POLICARPIO YU, MSCE


NONLINEAR EQUATIONS

ENGR. BRYAN DALE POLICARPIO YU, MSCE


ENGR. BRYAN DALE POLICARPIO YU, MSCE
ENGR. BRYAN DALE POLICARPIO YU, MSCE
CLOSED DOMAIN METHOD

ENGR. BRYAN DALE POLICARPIO YU, MSCE


CLOSED DOMAIN METHOD

ENGR. BRYAN DALE POLICARPIO YU, MSCE


CLOSED DOMAIN METHOD
BISECTION METHOD

ENGR. BRYAN DALE POLICARPIO YU, MSCE


CLOSED DOMAIN METHOD
BISECTION METHOD

ENGR. BRYAN DALE POLICARPIO YU, MSCE


BISECTION METHOD
 
Example 1: Find the root of the function between x=0 and x=1

ENGR. BRYAN DALE POLICARPIO YU, MSCE


BISECTION METHOD
 
Example 1: Find the root of the function between x=0 and x=1
𝑎+ 𝑏 0 +1
= =0.50
2 2
First Iteration:
3
=0 ; 𝑓 ( 𝑎 )= ( 0 ) +2 ( 0 ) − 2; 𝑓 ( 𝑎 )=−2
3
=1; 𝑓 ( 𝑏 ) =( 1 ) +2 (1 ) − 2; 𝑓 ( 𝑎 ) =1
3
𝑐=0.50; 𝑓 ( 𝑐 )=( 0.50 ) + 2 ( 0.50 ) − 2; 𝑓 ( 𝑐 )=− 0.875
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


BISECTION METHOD
Based on the results:
=0.50 ; 𝑏=1 , 𝑐=( 0.50+1 ) =0.75

2nd Iteration:
3
𝑎=0.50 ; 𝑓 ( 𝑎 )= ( 0.50 ) +2 ( 0.50 ) − 2; 𝑓 ( 𝑎 )=−0.875
 

3
=1; 𝑓 ( 𝑏 ) =( 1 ) +2 (1 ) − 2; 𝑓 ( 𝑎 ) =1
3
𝑐=0.75; 𝑓 ( 𝑐 )=( 0.75 ) +2 ( 0.75 ) − 2; 𝑓 ( 𝑐 )=− 0.078125
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


BISECTION METHOD
Based on the results:
=0.75 ; 𝑏=1 , 𝑐=( 0.75+1 ) =0.875

3rd Iteration:
3
𝑎=0.50 ;𝑓 ( 𝑎 )= ( 0.75 ) +2 ( 0.75 ) − 2; 𝑓 ( 𝑎 )=−0.078125
 

3
=1; 𝑓 ( 𝑏 ) =( 1 ) +2 (1 ) − 2; 𝑓 ( 𝑎 ) =1
3
𝑐=0.875; 𝑓 ( 𝑐 )=( 0.875 ) +2 ( 0.875 ) − 2; 𝑓 ( 𝑐 )=0.4199
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


BISECTION METHOD
Based on the results:
 
𝑎=0.75 ; 𝑏=875 , 𝑐=( 0.75+ 0.875 )=0.8125

4th Iteration:
3
𝑎=0.50 ;𝑓 ( 𝑎 )= ( 0.75 ) +2 ( 0.75 ) − 2; 𝑓 ( 𝑎 )=−0.078125
 

3
𝑏=0.875 ;𝑓 ( 𝑏 )=( 0.875 ) +2 ( 0.875 ) − 2; 𝑓 ( 𝑏 )=0.4199
 

3
𝑐=0.8125; 𝑓 ( 𝑐 )=( 0.8125 ) +2 ( 0.8125 ) − 2; 𝑓 ( 𝑐 )=0.1613
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


BISECTION METHOD
Based on the results:
𝑎=0.75 ;𝑏=8125 , 𝑐=( 0.75+0.8125 )=0.78125
 

5th Iteration:
3
𝑎=0.50 ;𝑓 ( 𝑎 )= ( 0.75 ) +2 ( 0.75 ) − 2; 𝑓 ( 𝑎 )=−0.078125
 

3
𝑏=0.8125 ;𝑓 ( 𝑏 )=( 0.8125 ) +2 ( 0.8125 ) −2 ; 𝑓 ( 𝑏 )=0.1613
 

3
𝑐=0.78125; 𝑓 ( 𝑐 )=0.78125 +2 ( 0.78125 ) − 2; 𝑓 ( 𝑐 )=0.03933
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


BISECTION METHOD
Based on the results:
𝑎=0.75 ;𝑏=0.78125 , 𝑐=( 0.75+0.78125 )=0.765625
 

6th Iteration:
3
𝑎=0.50 ;𝑓 ( 𝑎 )= ( 0.75 ) +2 ( 0.75 ) − 2; 𝑓 ( 𝑎 )=−0.078125
 

3
𝑏=0.78125 ;𝑓 ( 𝑏 )=0.78125 +2 ( 0.78125 ) − 2; 𝑓 ( 𝑏 )=0.03933
 

3
𝑐=0.765625; 𝑓 ( 𝑐 )=0.765625 +2 ( 0.765625 ) − 2; 𝑓 ( 𝑐 )=− 0.02
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


BISECTION METHOD
Based on the results:
𝑎=0.765625;𝑏=0.78125,𝑐=( 0.765625+0.78125 )=0.77343
 

7th Iteration:
3
𝑎=0.765625 ;𝑓 ( 𝑎 )=0.765625 +2 ( 0.765625 ) − 2; 𝑓 ( 𝑎 )=−0.02
 

3
𝑏=0.78125 ;𝑓 ( 𝑏 )=0.78125 +2 ( 0.78125 ) − 2; 𝑓 ( 𝑏 )=0.03933
 

3
𝑐=0.77343; 𝑓 ( 𝑐 )=0.77343 +2 ( 0.77343 ) − 2; 𝑓 ( 𝑐 )=0.001
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


BISECTION METHOD
Based on the results:
𝑒 𝑓 ( 0.77343 ) ≈ 0
=0.77

ENGR. BRYAN DALE POLICARPIO YU, MSCE


CLOSED DOMAIN METHOD
REGULA FALSI

ENGR. BRYAN DALE POLICARPIO YU, MSCE


CLOSED DOMAIN METHOD
REGULA FALSI

ENGR. BRYAN DALE POLICARPIO YU, MSCE


REGULA FALSI

ENGR. BRYAN DALE POLICARPIO YU, MSCE


REGULA FALSI METHOD

ENGR. BRYAN DALE POLICARPIO YU, MSCE


REGULA FALSI METHOD
 
Example 1: Find the root of the function between x=0 and x=1
 
(1)− 0
𝑐 = (1 ) − ( 1 ) =0.
1 − (− 2 )

First Iteration:
3
=0 ; 𝑓 ( 𝑎 )= ( 0 ) +2 ( 0 ) − 2; 𝑓 ( 𝑎 )=−2
3
=1; 𝑓 ( 𝑏 ) =( 1 ) +2 (1 ) − 2; 𝑓 ( 𝑎 ) =1
3
𝑐=0.667; 𝑓 ( 𝑐 )= ( 0.50 ) +2 ( 0.50 ) − 2; 𝑓 ( 𝑐 )=− 0.370
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


REGULA FALSI METHOD
Based on the results:
=0.667 ; 𝑏=1 , 𝑐=0.757

2nd Iteration:
3
𝑎=0 ; 𝑓 ( 𝑎 )= ( 0.667 ) +2 ( 0.667 ) −2 ; 𝑓 ( 𝑎 )=− 0.370
 

3
=1; 𝑓 ( 𝑏 ) =( 1 ) +2 (1 ) − 2; 𝑓 ( 𝑎 ) =1
3
𝑐=0.757; 𝑓 ( 𝑐 )= ( 0.757 ) +2 ( 0.757 ) −2 ;𝑓 ( 𝑐 )=−0.05
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


REGULA FALSI METHOD
Based on the results:
=0.757 ; 𝑏=1 , 𝑐=0.769

2nd Iteration:
3
𝑎=0.757 ; 𝑓 ( 𝑎 ) =( 0.757 ) +2 ( 0.757 ) −2 ;𝑓 ( 𝑎 )=− 0.05
 

3
=1; 𝑓 ( 𝑏 ) =( 1 ) +2 (1 ) − 2; 𝑓 ( 𝑎 ) =1
3
𝑐=0.769; 𝑓 ( 𝑐 )=( 0.769 ) +2 ( 0.769 ) − 2; 𝑓 ( 𝑐 )=− 0.007
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


REGULA FALSI METHOD
Based on the results:
=0.757 ; 𝑏=1 , 𝑐=0.769

3rd Iteration:
3
𝑎=0.757 ; 𝑓 ( 𝑎 ) =( 0.757 ) +2 ( 0.757 ) −2 ;𝑓 ( 𝑎 )=− 0.05
 

3
=1; 𝑓 ( 𝑏 ) =( 1 ) +2 (1 ) − 2; 𝑓 ( 𝑎 ) =1
3
𝑐=0.769; 𝑓 ( 𝑐 )=( 0.769 ) +2 ( 0.769 ) − 2; 𝑓 ( 𝑐 )=− 0.007
 

ENGR. BRYAN DALE POLICARPIO YU, MSCE


REGULA FALSI METHOD
Based on the results:
𝑐𝑒 𝑓 ( 0.769 ) ≈ 0
=0.77

ENGR. BRYAN DALE POLICARPIO YU, MSCE


OPEN DOMAIN METHOD
NEWTON’S METHOD

ENGR. BRYAN DALE POLICARPIO YU, MSCE


OPEN DOMAIN METHOD
NEWTON’S METHOD

ENGR. BRYAN DALE POLICARPIO YU, MSCE


OPEN DOMAIN METHOD
NEWTON’S METHOD

ENGR. BRYAN DALE POLICARPIO YU, MSCE


OPEN DOMAIN METHOD
NEWTON’S METHOD

ENGR. BRYAN DALE POLICARPIO YU, MSCE


NEWTON’S METHOD
Example 1: Find the root of the function
 

2
) =3 𝑥 + 2
𝑥 𝑛 =1
 
𝑥=0.7709

ENGR. BRYAN DALE POLICARPIO YU, MSCE

You might also like