Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Numerical Methods: Roots of Equations, Interpolation, and Curve Fitting, Lecture notes of Numerical Methods in Engineering

To find the roots of the equation in mathematics, we use different methods.

Typology: Lecture notes

2020/2021

Uploaded on 05/11/2021

Rocky_12Dhakal
Rocky_12Dhakal ๐Ÿ‡ฎ๐Ÿ‡ณ

1 / 34

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
UNIT NO. 5
โžขTOPICS
โžขRoots of equation [Bisection method, False position
(Regula Falsi) method and Newton โ€“Raphson method.]
โžขInterpolation [Finite difference, Forward and backward
differences, Interpolation. Newtonโ€™s forward interpolation
formula, Newtonโ€™s backward interpolation formula,
Lagrangeโ€™s interpolation formula and Newtonโ€™s divided
difference formula,,
โžขCurve fitting [Least squares curve fitting methods, linear
and nonlinear curve fitting
Roots of equations,
Interpolation and Curve fitting
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22

Partial preview of the text

Download Numerical Methods: Roots of Equations, Interpolation, and Curve Fitting and more Lecture notes Numerical Methods in Engineering in PDF only on Docsity!

UNIT NO. 5

โžขTOPICS

โžขRoots of equation [Bisection method, False position

(Regula Falsi) method and Newton โ€“ Raphson method.]

โžขInterpolation [Finite difference, Forward and backward

differences, Interpolation. Newtonโ€™s forward interpolation

formula, Newtonโ€™s backward interpolation formula,

Lagrangeโ€™s interpolation formula and Newtonโ€™s divided

difference formula,,

โžขCurve fitting [Least squares curve fitting methods, linear

and nonlinear curve fitting

Roots of equations, Interpolation and Curve fitting

Theory Marks (^) Viva / TW ESE IA CSE Viva Term Work Total Marks 50 30 20 25 25 150 conducted centrally conducted centrally Assignments End semester viva Lab work

Evaluation Process

Application

LINK: https://youtu.be/4fu-DC2jRHA

INTRODUCTION Years ago , we learn to use the quadratic formula to solve F(x). The values calculated with this equation are called the โ€˜โ€™rootsโ€™โ€™. They represents the values of x that make f(x) equal to zero. we can define the roots of an equation as the value of x that makes f(x)=0. Thus , roots are sometimes called the zeros of the equation

Quadratic equation : ๐’‚๐’™

๐Ÿ

+bx + c
And its solution is x =

โˆ’๐‘ยฑ ฮ” 2๐‘Ž

here ฮ” = ๐‘

2

Roots of equation

Types of equation

1..Algebraic Equation

The equation of the form with degree n is called Algebraic equation

Example: ๐’™

2..Transcendental Equation

A non Algebraic Equation is called Transcendental equation

Intermediate Value theorem If a continuous function f(x) assumes value of opposite sign at the end points of an intervals [a ,b] ie. f(a) f(b) < 0 Then interval [a, b] contains at least one root of the equation f(x) = 0 i.e There exist c โˆˆ [a , b] such that f(c) = 0

  • In particular Suppose f(๐‘ฅ

) <0 then root lies in between [๐‘ฅ

, b] then again bisect this interval to next point ๐‘ฅ

=

  • Repeat this procedure to generate x 1 , x 2 ,,,,, till the root up to desired accuracy is obtained

Solution : Here f(x) = ๐‘ฅ

โˆ’ ๐‘ฅ โˆ’ 11 = 0 NOTE : USE โ€œRADIAN MODEโ€ IN YOUR CALCULATOR FOR SOLUTION ANY EXAMPLE OF NUMERICAL METHODS First find the interval [a ,b] where f(a) < 0 and f(b) > 0 f(2) = 8 โ€“ 2 - 11 = - 5 < 0 i.e a = 2 f(3) =27 - 3 - 11 = 13 > 0 i.e b = 3 So the root lies in between 2 and 3 Ex - 1 Find the root of equation ๐‘ฅ 3 โˆ’ ๐‘ฅ โˆ’ 11 = 0 using the bisection method up to forth approximation

Solution : Here f(x) =๐‘๐‘œ๐‘  ๐‘ฅ โˆ’ ๐‘ฅโ…‡

= 0 First find the interval [a ,b] where f(a) < 0 and f(b) > 0 f(0) = 1 > 0 i.e b = 0 f(1) = - 2.1780 <0 i.e a= 1 So the root lies in between 1 and 0 Ex - 2 Perform the five iteration of the bisection method to obtain a root of the equation f(x) = cos ๐‘ฅ โˆ’ ๐‘ฅโ…‡ ๐‘ฅ = 0

Solution of equation is 0.

NO of
iterations
a
f(a) <
b
f(b) > 0
F (xn)
1 1 0 ๐‘ฅ 1 = 0.5 F(๐‘ฅ 1 ) = 0.0532 > 0
2 1 0.5 ๐‘ฅ 2 = 0.75 F(๐‘ฅ 2 ) = - 0.8561 < 0
3 0.75 0.5 ๐‘ฅ 3 = 0.625 F(๐‘ฅ 3 ) = - 0.3567 < 0
4 0.625 0.5 ๐‘ฅ 4 = 0.5625 F(๐‘ฅ 4 ) = - 0.1413 < 0

NO of iterations a f(a) <0 b f(b) > 0 ๐‘ฅ๐‘› = ๐‘Ž + ๐‘ 2 F (xn) 1 0 1 X1= 0.5 F(x1) = - 0.3776 < 0 2 0.5 1 X2= 0.75 F(x2) = 0.0183 > 3 0.5 0.75 X3= 0.625 F(x3) = - 0.186 < 4 0.625 0.75 X4= 0.6875 F(x4) =-0.0853 < 5 0.6875 0.75 X5 =0.71875 F(x5) =-0.0338 < 6 0.71875 0.75 X6 = 0.7344 F(x6)= - 0.0078 < 0 7 0.7344 0.75 X7 = 0.7422 F(x7) = 0.0052 > 8 0.7344 0.7422 X8 = 0.7383 F(x8) = - 0.0013 < 9 0.7383 0.7422 X9 = 0.74025 F(x9)= 0.00195 > 10 0.7383 0.74025 X10 = 0.7393 F(10) =0.0004 > 0 11 0.7383 0.7393 X11= 0. Ans is 0.

Solution : Here f(x) = ๐‘ฅ

โˆ’ 4๐‘ฅ โˆ’ 9 = 0 First find the interval [a ,b] where f(a) < 0 and f(b) > 0 f(2) = - 9 < 0 i.e a = 2 f(3) = 6 > 0 i.e b= 3 So the root lies in between 2 and 3 NO of iterations a f(a) <0 b f(b) > 0 ๐‘ฅ๐‘› = ๐‘Ž + ๐‘ 2 F (xn) 1 2 3 4

Ex - 4 Find the root of the equation ๐‘ฅ

3

โˆ’ 4๐‘ฅ โˆ’ 9 = 0 using the bisection method in four stages

Solution : Here f(x) = ๐‘ฅโ…‡

โˆ’ 2 = 0 First find the interval [a ,b] where f(a) < 0 and f(b) > 0 f(0) = - 2 < 0 i.e a = 0 f(1) = 0.7182 > 0 i.e b= 1 So the root lies in between 1 and 0 NO of iterations a f(a) <0 b f(b) > 0 ๐‘ฅ๐‘› = ๐‘Ž๐‘“ ๐‘ โˆ’ ๐‘๐‘“ ๐‘Ž ๐‘“ ๐‘ โˆ’ ๐‘“ ๐‘Ž F (xn) 1 0 - 2 1 0.7182 X1= 0.735759 - 0.4644 < 0 2 0.735759 - 0.4644 1 0.7182 X2 = 0.8395 - 0.056293 < 3 0.8395 - 0.056293 1 0.7182 X3 = 0.851184 - 0.006171 < 0 4 0.851184 - 0.006171 1 0.7182 X4 =0. Ex - 1 Find the root of the equation ๐‘ฅโ…‡

โˆ’ 2 = 0 by the Regula false method in four stages

Solution : Here f(x) = ๐Ÿ‘๐’™ โˆ’ ๐’„๐’๐’”๐’™ โˆ’ ๐Ÿ = 0 First find the interval [a ,b] where f(a) < 0 and f(b) > 0 f(0) = - 2 < 0 i.e a = 0 f(1) = 1.4597 > 0 i.e b= 1 So the root lies in between 0 and 1 NO of iterations a f(a) <0 b f(b) > 0 ๐‘ฅ๐‘› = ๐‘Ž๐‘“ ๐‘ โˆ’ ๐‘๐‘“ ๐‘Ž ๐‘“ ๐‘ โˆ’ ๐‘“ ๐‘Ž F (xn) 1 0 - 2 1 1.4597 X1=0.5781 - 0.1032< 0 2 0.5781 - 0.1032 1 1.4597 X2 =0.6060 - 0.003933 < 3 0.6060 - 0.003933 1 1.4597 X3 = 0.6071 - 0.000005 < 0 4 0.6071 - 0.000005 1 1.4597 X4 =0. Ex โ€“ 2 Find the root of the equation ๐Ÿ‘๐’™ โˆ’ ๐’„๐’๐’”๐’™ โˆ’ ๐Ÿ = 0 by the Regula false method in four stages