Optimasi Proses

Solving Non-Linear Equation

Using Newton-Raphson
Method
Wahyuni Ningsih
Chemical Engineering
Politeknik Negeri Malang
2024
Learning Outcomes
● Students can solve non-linear equations using Newton-Raphson Method as Graphical
Method
● Students can solve non-linear equations using Newton-Raphson Method as iteration
method
● Students can solve non-linear equations using Newton-Raphson Method in MATLAB
What will we learn in this lesson?
01. Linear & Non-Linear Equation

02. Newton-Raphson Method – as graphical & iteration method

03. Newton-Raphson Method – in MATLAB

04. Real life applications

01. Linear & Non-Linear
Equations
Linear & Non-Linear Equations
Linear equation
● An equation in which the maximum degree of a term is one

● A linear equation value when plotted on the graph forms a straight line.

● Examples:

1. 3𝑥 + 5𝑦 = 6
2. 2𝑥 + 4𝑦 − 3𝑧 = 7
Linear & Non-Linear Equations
System of Linear Equations
● A system of linear equations is a collection of two or more linear

equations involving the same set of variables

● Example

2𝑥1 − 𝑥2 + 4𝑥3 = 6
𝑥1 + 3𝑥2 − 𝑥3 = 3
−3𝑥1 + 𝑥2 + 3𝑥3 = 10
Linear & Non-Linear Equations
Non-Linear equation
● An equation in which the maximum degree of a term is 2 or more than two
● The nonlinear equation values when plotted on the graph forms a curve.
● Examples:

Quadratic Equations 𝑦 = 𝑥2 + 𝑥 − 1
Polynomial Equations of Higher Degree 𝑦 = 𝑥 5 − 2𝑥 4 + 𝑥 3 − 2𝑥 2 + 𝑥 − 4
Exponential Equations 𝑦 = 𝑒 2𝑥
Logarithmic Equations 𝑦 = 𝑙𝑜𝑔(3𝑥 + 1)
Trigonometric Equations 𝑦 = 𝑠𝑖𝑛 𝑥 + 3 𝑐𝑜𝑠 𝑥
Rational Equations 𝑥−2
𝑦=
𝑥+3
Implicit Equations 𝑥2 + 𝑦2 = 9
 𝑦 = 𝑒 2𝑥 𝑦 = sin 𝑥 + 3 cos 𝑥
𝑦 = 𝑥2 + 𝑥 − 1

𝑥2 + 𝑦2 = 9

𝑥−2
5 4 3 2
𝑦 = 𝑥 − 2𝑥 + 𝑥 − 2𝑥 + 𝑥 − 4 𝑦=
𝑥+3
𝑦 = log(3𝑥 + 1)
Introduction about solving non linear equation
Solving nonlinear equations can be more challenging than solving linear equations because they involve
functions with nonlinear relationships between variables. There is no universal method that works for all types
of nonlinear equations, but there are several techniques commonly used to solve them:
1. Analytical Methods:
1) Substitution Method
2) Elimination Method
3) Factoring
4) Special Techniques: For example, quadratic equations can be solved using the quadratic formula.
2. Numerical Methods:
1) Graphical Method
2) Iteration Methods: such as Newton's method or the bisection method to approximate solutions.
3) Root-Finding Algorithms: Utilize numerical algorithms like the Newton-Raphson method or the
secant method to find roots.
3. Symbolic Computation:
Use computer algebra systems (CAS) like Mathematica, Maple, or using MATLAB.

The choice of method depends on the specific form and complexity of the nonlinear equation, as well as the
available computational resources and the desired level of precision. In many cases, a combination of
analytical and numerical techniques is employed to obtain solutions.
The Newton-Raphson Method
The Newton-Raphson Method
The Newton-Raphson method, also known as
Newton's method, is an iterative numerical
technique used to find the roots of a real-valued
function. It's based on linear approximation and
relies on an initial guess to iteratively converge
towards a more accurate approximation of the root.

● This method is widely used due to its rapid convergence for well-behaved functions
and its simplicity to implement.
● it's important to note that the method may fail or converge slowly if the initial guess is
far from the actual root that make it challenging for the method to converge.
● Additionally, care must be taken to handle cases where the derivative is close to
zero or undefined.
02.1 Newton-Raphson
Method
Graphical Method
Newton-Raphson Method Graphically
𝑦 𝑔1
𝑓 𝑥
𝑔2 Find the roots of non-linear equations using
Newton-Raphson Method Graphically
𝑓 𝑥0 𝑔3
1. Plot the Function 𝒇(𝒙)
2. Select an Initial Guess (𝑥0 )
3. Calculate the Tangent Line (𝒈𝟏 ) using
The root of 𝑓(𝑥)
𝐲 − 𝒇 𝒙𝟎 = 𝒇′ 𝒙𝟎 (𝒙 − 𝒙𝟎 )
𝑓 𝑥1 4. Find the Intersection with the x-axis
5. Update the Guess (𝒙𝟏 )
𝑓 𝑥2
𝑥3 𝑥2 𝑥1 𝑥 6. Repeat the Process until get the root 𝒙𝒏
𝑥0
7. Verification: 𝑓 𝑥𝑛 = 0
8. Graphical Visualization
02.2 Newton-Raphson
Method
Iteration method
Newton-Raphson Method - Iteration Method
[Link] an Initial Guess 𝒙𝟎
[Link] the first order derivative of 𝒇(𝒙): 𝒇’(𝒙)
[Link] 𝒇(𝒙𝟎 ) and 𝒇′(𝒙𝟎 ) Iteration x_n f(xn) f '(xn) x_n+1 error

[Link] Formula 0 2 3 8 1,625 0,1875

1 1,625 0,650391 4,671875 1,485786 0,08567
𝑓(𝑥𝑛 )
𝑥𝑛+1 = 𝑥𝑛 − 2 1,485786 0,072402 3,651108 1,465956 0,013346
𝑓′(𝑥𝑛+1 )
[Link] (step 3-4) 3 1,465956 0,001352 3,515168 1,465571 0,000262

[Link] an error value 4 1,465571 5,02E-07 3,512556 1,465571 9,76E-08

5 1,465571 6,93E-14 3,512555 1,465571 1,35E-14
𝑥𝑛+1 − 𝑥𝑛
𝜀= 6 1,465571 0 3,512555 1,465571 0
𝑥𝑛
[Link] Criteria: You can choose a stopping
criterion, such as reaching a certain tolerance level The root of 𝑓(𝑥)
(e.g. tolerance level = 10−5 ) Stopping Criteria
an Initial Guess
𝜀 ≤ 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 𝑙𝑒𝑣𝑒𝑙
or when 𝑓 𝑥𝑛+1 = 0
Examples
Use the Newton-Raphson method to the root in the following cases.
𝑓 𝑥 = 𝑒 𝑥 − 2 from initial estimate 𝑥0 = 1.
Solution
Step 1 Chose an initial guess 𝑥0 and tolerance value 𝑥0 = 1; 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 = 10−6
Step 2 Find 𝑓′(𝑥) 𝑓′ 𝑥 = 𝑒𝑥
Step 3 Find the 𝑓(𝑥0 ) and 𝑓 ′ 𝑥0 𝑓 1 = 𝑒 − 2; f′ 1 = e
Step 4 𝑓 𝑥
Find the 𝑥𝑛+1 using 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′(𝑥𝑛 ) 𝑓 𝑥0 𝑒−2
𝑥1 = 𝑥0 − = 1 −
𝑛
𝑓 ′ 𝑥0 𝑒
Step 5 𝑥𝑛+1 −𝑥𝑛 𝑒−2
Find the error using 𝑒𝑟𝑟𝑜𝑟 = 𝑥1 − 𝑥0 − 𝑒 𝑒−2
𝑥𝑛
𝑒𝑟𝑟𝑜𝑟 = = =
𝑥0 1 𝑒
Step 6 Repeat step 3-5 𝑥2 , 𝑥3 , … , 𝑥𝑛+1
Step 7 Stop the iteration when 𝑒𝑟𝑟𝑜𝑟 < 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 𝑣𝑎𝑙𝑢𝑒
Examples
Use the Newton-Raphson method to the root in the following cases.
𝑓 𝑥 = 𝑒 𝑥 − 2 from initial estimate 𝑥0 = 1.
Solution
Step 1 Chose an initial guess 𝑥0 and tolerance value 𝑥0 = 1; 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 = 10−6
Step 2 Find 𝑓′(𝑥) 𝑓′ 𝑥 = 𝑒𝑥
Step 3 Find the 𝑓(𝑥0 ) and 𝑓 ′ 𝑥0 𝑓 1 = 𝑒 − 2; f′ 1 = e
Step 4 𝑓 𝑥
Find the 𝑥𝑛+1 using 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′(𝑥𝑛 ) 𝑓 𝑥0 𝑒−2
𝑥1 = 𝑥0 − = 1 −
𝑛
𝑓 ′ 𝑥0 𝑒
Step 5 𝑥𝑛+1 −𝑥𝑛 𝑒−2
Find the error using 𝑒𝑟𝑟𝑜𝑟 = 𝑥1 − 𝑥0 − 𝑒 𝑒−2
𝑥𝑛
𝑒𝑟𝑟𝑜𝑟 = = =
𝑥0 1 𝑒
Step 6 Repeat step 3-5 𝑥2 , 𝑥3 , … , 𝑥𝑛+1
Step 7 Stop the iteration when 𝑒𝑟𝑟𝑜𝑟 < 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 𝑣𝑎𝑙𝑢𝑒
Examples
Use the Newton-Raphson method to the root in the following cases.
𝑓 𝑥 = 𝑒 𝑥 − 2 from initial estimate 𝑥0 = 1.
Solution
Step 1 Chose an initial guess 𝑥0 and tolerance value 𝑥0 = 1; 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 = 10−6
Step 2 Find 𝑓′(𝑥) 𝑓′ 𝑥 = 𝑒𝑥
Step 3 Find the 𝑓(𝑥0 ) and 𝑓 ′ 𝑥0 𝑓 1 = 𝑒 − 2; f′ 1 = e
Step 4 𝑓 𝑥
Find the 𝑥𝑛+1 using 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′(𝑥𝑛 ) 𝑓 𝑥0 𝑒−2
𝑥1 = 𝑥0 − = 1 −
𝑛
𝑓 ′ 𝑥0 𝑒
Step 5 𝑥𝑛+1 −𝑥𝑛 𝑒−2
Find the error using 𝑒𝑟𝑟𝑜𝑟 = 𝑥1 − 𝑥0 − 𝑒 𝑒−2
𝑥𝑛
𝑒𝑟𝑟𝑜𝑟 = = =
𝑥0 1 𝑒
Step 6 Repeat step 3-5 𝑥2 , 𝑥3 , … , 𝑥𝑛+1
Step 7 Stop the iteration when 𝑒𝑟𝑟𝑜𝑟 < 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 𝑣𝑎𝑙𝑢𝑒
Examples
Use the Newton-Raphson method to the root in the following cases.
𝑓 𝑥 = 𝑒 𝑥 − 2 from initial estimate 𝑥0 = 1.
Solution
Step 1 Chose an initial guess 𝑥0 and tolerance value 𝑥0 = 1; 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 = 10−6
Step 2 Find 𝑓′(𝑥) 𝑓′ 𝑥 = 𝑒𝑥
Step 3 Find the 𝑓(𝑥0 ) and 𝑓 ′ 𝑥0 𝑓 1 = 𝑒 − 2; f′ 1 = e
Step 4 𝑓 𝑥
Find the 𝑥𝑛+1 using 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′(𝑥𝑛 ) 𝑓 𝑥0 𝑒−2
𝑥1 = 𝑥0 − = 1 −
𝑛
𝑓 ′ 𝑥0 𝑒
Step 5 𝑥𝑛+1 −𝑥𝑛 𝑒−2
Find the error using 𝑒𝑟𝑟𝑜𝑟 = 𝑥1 − 𝑥0 − 𝑒 𝑒−2
𝑥𝑛
𝑒𝑟𝑟𝑜𝑟 = = =
𝑥0 1 𝑒
Step 6 Repeat step 3-5 𝑥2 , 𝑥3 , … , 𝑥𝑛+1
Step 7 Stop the iteration when 𝑒𝑟𝑟𝑜𝑟 < 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 𝑣𝑎𝑙𝑢𝑒
Examples
Use the Newton-Raphson method to the root in the following cases.
𝑓 𝑥 = 𝑒 𝑥 − 2 from initial estimate 𝑥0 = 1.
Solution
Step 1 Chose an initial guess 𝑥0 and tolerance value 𝑥0 = 1; 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 = 10−6
Step 2 Find 𝑓′(𝑥) 𝑓′ 𝑥 = 𝑒𝑥
Step 3 Find the 𝑓(𝑥0 ) and 𝑓 ′ 𝑥0 𝑓 1 = 𝑒 − 2; f′ 1 = e
Step 4 𝑓 𝑥
Find the 𝑥𝑛+1 using 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′(𝑥𝑛 ) 𝑓 𝑥0 𝑒−2
𝑥1 = 𝑥0 − = 1 −
𝑛
𝑓 ′ 𝑥0 𝑒
Step 5 𝑥𝑛+1 −𝑥𝑛 𝑒−2
Find the error using 𝑒𝑟𝑟𝑜𝑟 = 𝑥1 − 𝑥0 − 𝑒 𝑒−2
𝑥𝑛
𝑒𝑟𝑟𝑜𝑟 = = =
𝑥0 1 𝑒
Step 6 Repeat step 3-5 𝑥2 , 𝑥3 , … , 𝑥𝑛+1
Step 7 Stop the iteration when 𝑒𝑟𝑟𝑜𝑟 < 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 𝑣𝑎𝑙𝑢𝑒
Examples
Use the Newton-Raphson method to the root in the following cases.
𝑓 𝑥 = 𝑒 𝑥 − 2 from initial estimate 𝑥0 = 1.
Solution
Step 1 Chose an initial guess 𝑥0 and tolerance value 𝑥0 = 1; 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 = 10−6
Step 2 Find 𝑓′(𝑥) 𝑓′ 𝑥 = 𝑒𝑥
Step 3 Find the 𝑓(𝑥0 ) and 𝑓 ′ 𝑥0 𝑓 1 = 𝑒 − 2; f′ 1 = e
Step 4 𝑓 𝑥
Find the 𝑥𝑛+1 using 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′(𝑥𝑛 ) 𝑓 𝑥0 𝑒−2
𝑥1 = 𝑥0 − = 1 −
𝑛
𝑓 ′ 𝑥0 𝑒
Step 5 𝑥𝑛+1 −𝑥𝑛 𝑒−2
Find the error using 𝑒𝑟𝑟𝑜𝑟 = 𝑥1 − 𝑥0 − 𝑒 𝑒−2
𝑥𝑛
𝑒𝑟𝑟𝑜𝑟 = = =
𝑥0 1 𝑒
Step 6 Repeat step 3-5 𝑥2 , 𝑥3 , … , 𝑥𝑛+1
Step 7 Stop the iteration when 𝑒𝑟𝑟𝑜𝑟 < 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 𝑣𝑎𝑙𝑢𝑒
Examples
Use the Newton-Raphson method to the root in the following cases.
𝑓 𝑥 = 𝑒 𝑥 − 2 from initial estimate 𝑥0 = 1.
Solution
Step 1 Chose an initial guess 𝑥0 and tolerance value 𝑥0 = 1; 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 = 10−6
Step 2 Find 𝑓′(𝑥) 𝑓′ 𝑥 = 𝑒𝑥
Step 3 Find the 𝑓(𝑥0 ) and 𝑓 ′ 𝑥0 𝑓 1 = 𝑒 − 2; f′ 1 = e
Step 4 𝑓 𝑥
Find the 𝑥𝑛+1 using 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′(𝑥𝑛 ) 𝑓 𝑥0 𝑒−2
𝑥1 = 𝑥0 − = 1 −
𝑛
𝑓 ′ 𝑥0 𝑒
Step 5 𝑥𝑛+1 −𝑥𝑛 𝑒−2
Find the error using 𝑒𝑟𝑟𝑜𝑟 = 𝑥1 − 𝑥0 − 𝑒 𝑒−2
𝑥𝑛
𝑒𝑟𝑟𝑜𝑟 = = =
𝑥0 1 𝑒
Step 6 Repeat step 3-5 𝑥2 , 𝑥3 , … , 𝑥𝑛+1
Step 7 Stop the iteration when 𝑒𝑟𝑟𝑜𝑟 < 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 𝑣𝑎𝑙𝑢𝑒
Examples
Use the Newton-Raphson method to the root in the following cases.
𝑓 𝑥 = 𝑒 𝑥 − 2 from initial estimate 𝑥0 = 1.
Solution
Step 1 Chose an initial guess 𝑥0 and tolerance value 𝑥0 = 1; 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 = 10−6
Step 2 Find 𝑓′(𝑥) 𝑓′ 𝑥 = 𝑒𝑥
Step 3 Find the 𝑓(𝑥0 ) and 𝑓 ′ 𝑥0 𝑓 1 = 𝑒 − 2; f′ 1 = e
Step 4 𝑓 𝑥
Find the 𝑥𝑛+1 using 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′(𝑥𝑛 ) 𝑓 𝑥0 𝑒−2
𝑥1 = 𝑥0 − = 1 −
𝑛
𝑓 ′ 𝑥0 𝑒
Step 5 𝑥𝑛+1 −𝑥𝑛 𝑒−2
Find the error using 𝑒𝑟𝑟𝑜𝑟 = 𝑥1 − 𝑥0 − 𝑒 𝑒−2
𝑥𝑛
𝑒𝑟𝑟𝑜𝑟 = = =
𝑥0 1 𝑒
Step 6 Repeat step 3-5 𝑥2 , 𝑥3 , … , 𝑥𝑛+1
Step 7 Stop the iteration when 𝑒𝑟𝑟𝑜𝑟 < 𝑡𝑜𝑙𝑒𝑟𝑎𝑛𝑐𝑒 𝑣𝑎𝑙𝑢𝑒
Examples
Use the Newton-Raphson method to the root in the following cases.
𝑓 𝑥 = 𝑒 𝑥 − 2 from initial estimate 𝑥0 = 1.
Solution
Iteration x_n f(xn) f'(xn) x_n+1 error
0 1 0,718282 2,718282 0,735759 0,264241
1 0,735759 0,087065 2,087065 0,694042 0,056699
2 0,694042 0,001791 2,001791 0,693148 0,001289
3 0,693148 8,01E-07 2,000001 0,693147 5,78E-07
4 0,693147 1,6E-13 2 0,693147 1,16E-13
5 0,693147 0 2 0,693147 0
So, the root of 𝑓 𝑥 = 𝑒 𝑥 − 2 when 𝑓 𝑥 = 0 is 𝑥 = 0,693147.
03 Newton-Raphson
Method
In MATLAB
 Start

Flowchart of tolerance value; 𝑥0 ; error

initial value
Newton-Raphson
Method Algorithm Error >= tolerance
value

𝑓 𝑥𝑛 ;
𝑓 ′ 𝑥𝑛 ;
𝑓 𝑥𝑛
𝑥𝑛+1 = 𝑥𝑛 − ′ ;
𝑓 𝑥𝑛
𝑥𝑛+1 − 𝑥𝑛
𝑒𝑟𝑟𝑜𝑟 =
𝑥𝑛

Iteration;
𝑥𝑛+1 = 𝑥𝑛

end
 clc;
Examples clear all;
fprintf('iterasi | x | y | dy/dx | error \n’);
Use the Newton- toleransi=1e-020;
Raphson method e=1; %inisial awal nilai error
to find the root in y=1; %inisial awal nilai y
the following x=1; %tebakan awal nilai x, 𝑥0
case. while e>=toleransi && y~=0 %syarat mendapatkan akar
y=exp(x)-2; %fungsi yang dicari akarnya saat y=0
𝑓 𝑥 = 𝑒 𝑥 − 2 from
yaksen=exp(x); %turunan dari y
initial estimate
z=x-(y/yaksen); %rumus metode Newton-Raphson
𝑥0 = 1. e=abs((z-x)/x); %error
fprintf('%4d %11.4f %2.4f %8.4f %8.4f\n',i,x,y,dety,e);
i=i+1; %update proses iterasi
x=z; %update nilai variable x
end
fprintf('jadi, akar dari persamaan y=(e^x)-2 saat y=0 yaitu x = %0.4f\n',x)
Example
Listing Program of The Newton-Raphson Method
in MATLAB
clc;
clear all;
fprintf('iterasi | x | y | dy/dx | error \n’);
toleransi=1e-020;
e=1; %inisial awal nilai error
y=1; %inisial awal nilai y
x=… ; %tebakan awal nilai x, 𝑥0
while e>=toleransi && y~=0 %syarat mendapatkan akar
y=………...; %fungsi yang dicari akarnya saat y=0
yaksen=………..; %turunan dari y
z=x-(y/yaksen); %rumus metode Newton-Raphson
e=abs((z-x)/x); %error
fprintf('%4d %11.4f %2.4f %8.4f %8.4f\n',i,x,y,dety,e);
i=i+1; %update proses iterasi
x=z; %update nilai variable x
end
fprintf('jadi, akar dari persamaan y=………… saat y=0 yaitu x = %0.4f\n',x)
Exercises
1. Use the Newton-Raphson method to the root in the following cases.
a. 𝑔 𝑥 = 𝑥 3 − 2𝑥 + 2 from initial estimate 𝑥0 = −1.5.
b. ℎ 𝑥 = ln 𝑥 − 2 from initial estimate x0 = 8.

2. You have a spherical storage tank containing oil. The tank has a
diameter of 6 meters. You are asked to calculate the height ℎ to
which a dipstick 8 meters long would be wet with oil when
immersed in the tank when it contains 6 𝑚3 of oil.
The equation that gives the height ℎ of the liquid in the spherical
tank for the given volume and radius is given by
𝑓 ℎ = ℎ3 − 9ℎ2 + 3.8197 = 0
Use the Newton-Raphson method of finding roots of equations to
find the height ℎ to which the dipstick is wet with oil.
 Thanks!

CREDITS: This presentation template was created by Slidesgo, and includes

icons by Flaticon, and infographics & images by Freepik

Please keep this slide for attribution

Resources
Garrett, S. J. (2015). Introductory Numerical Methods. Introduction to
Actuarial and Financial Mathematical Methods, 411–463.
[Link]
Edgar, T.F., D.M. Himmelblau, and L.S. Lasdon.
2000. Optimization of Chemical Processes, 2nd Edition, McGraw-
Hill, Boston
Kenneth J. Beers. 2007. “Numerical Methods for Chemical Engineering:
Application in MATLAB”, Cambridge University Press