Scribd
Upload
51 views

Numerical Methods: Biplove Pokhrel Teaching Assistant, WRC

This document discusses numerical methods for finding the roots of equations. It introduces iterative methods, which are algorithms that start with an initial guess for the root and successively improve the approximation until a desired level of accuracy is reached. Two iterative methods are described in detail: the regula falsi method and the secant method. The regula falsi method uses the slope of a line between two points to estimate the next root, while the secant method uses the slope of a secant line between two points. Numerical examples demonstrating how to apply these methods are provided.

Uploaded by

Biplove Pokhrel
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
51 views

Numerical Methods: Biplove Pokhrel Teaching Assistant, WRC

This document discusses numerical methods for finding the roots of equations. It introduces iterative methods, which are algorithms that start with an initial guess for the root and successively improve the approximation until a desired level of accuracy is reached. Two iterative methods are described in detail: the regula falsi method and the secant method. The regula falsi method uses the slope of a line between two points to estimate the next root, while the secant method uses the slope of a secant line between two points. Numerical examples demonstrating how to apply these methods are provided.

Uploaded by

Biplove Pokhrel
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/ 22

NUMERICAL

METHODS

Biplove Pokhrel
Teaching Assistant,WRC
BASIC PROPERTIES OF
EQUATION
 I. If f(x) is exactly divisible by x-a, then a is root
of f(x) =0.
 II. Every equation of the nth degree has only n
roots (real or imaginary).
 Conversely if a , a , …, a are the roots of the
1 2 n
nth degree equation f(x) =0
Then,
f(x)=A(x - a1) (x - a2) (x - an) Where A is a
constant.
METHOD OF SOLUTION
 Direct Analytical Method (Quadratic
Equation)
 Graphical Method
 Trial And Error Method
 Iterative Method
ITERATIVE METHOD
 Iterative Method are the algorithmic
approaches to Numerical Calculation. These
are more Accurate as compared to other
method.
 An Iterative Method begin with the initial
Guess of the Root Value which is Successively
Corrected iteration by iteration until the
certain level of Error Satisfaction is meet.
 Types of Iterative Method

A. Bracketing Method
B. Open End Method
 Bracketing Methods Starts with the initial
Guess that brackets the root and then
systematically reduce the width of the
Bracket until the solution is reached.
 These Methods are based on the assumption
that the function changes its sign in the
Vicinity of the root.
 Open End Methods start with the single
starting Value or True Value that does not
necessary brackets the Root.
ALGORITHM
 Start
 Choose and as two guesses for the root such that
f()f()<0 and Stopping Criteria E.
 Compute f() and f().
 Estimate the root X0 of the equation f(x)=0 as the
mid point between and . as
 Now check the following
 If f()f()=0 then the root is . Goto stop
 If f()f()<0 then the root lies between and . Set = .
 If f()f()>0 then the root lies between and . Set =
 Find the absolute relative error
NUMERICAL PROBLEMS
 Solve the equation and find the negative root
of x2-4x-10.
Solution:

X -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7

F(X) 35 22 11 2 -5 - - - - - -5 2 11
10 13 14 13 10

For negative Root the value lies between -1 and


-2
ITERATION TABLE
N of X1 X2 F(x1) F(x2)
Iteration
1 -1 -2 -5 2 -1.5
2 -1.5 -2 -1.75 2 -1.75
3 -1.5 -1.75 -1.75 0.065 -1.625
4 -1.625 -1.75 0.8543 0.0625 -1.6875
5 -1.6875 -1.75 -0.4023 0.0625 2
-1.7187
6 -1.7187 -1.75 -0.1712 0.0625 -1.7343
7 -1.7343 -1.75 -0.0546 0.0625 -
1.74215

Hence our Result gives the answer -1.742.


WHY DOES FIXED POINT ITERATION HAVE TO
BE IN RADIANS?

 The definitions in terms of right angles cannot


be used in general as that requires the angle to
be between 0 and 90 degrees but, in order to
use them as functions we want them defined for
all real numbers.
 To use them as a degree
NUMERICAL PROBLEM (IOE)
 Find an approximate root of the equation
Solution:
Make sure your Calculator is in Radian.
Given equation becomes ,

X -3 -2.5 -2 -1.5 -1 -0.5 0 0.5 1 1.5 2

- 0.49 0.81 0.49 - - -1 - - 0.49 0.81


F(X) 0.57 61 85 62 0.15 0.76 0.76 0.15 62 85
6 8 8

For Positive Root the value lies between 1 and


1.5
ITERATION TABLE
N of X1 X2 F(x1) F(x2) Shift
Iteration

1 1 1.5 -0.15849 0.49625 1.25 X2=x0

2 1 1.25 -0.15849 -0.18627 1.125 “

3 1 1.125 -0.15849 0.015051 1.0625 “

4 1.0625 1.125 -0.071827 -0.0718 1.093750 X1=x0

5 1.093750 1.125 -0.28362 -0.0718 1.10937 “

6 1.10937 1.125 -0.00664 0.00421 1.11719 “

7 1.10937 1.11719 -0.00664 0.004212 1.11328 X2=x0

8 1.11328 1.11719 -0.001218 0.004212 1.11523


REGULA FALSI METHOD
 Regula-Falsi Method is numerical method
approach towards finding the roots of a
polynomial expression.
 The false-position is defined as the x position
where a line connecting the two boundary points
crosses the axis.
DERIVATION
We choose 2 points Such that x1 and
x0 which has opposite sign.
the graph of y = f(x) crosses the x-
axis between these points
(This indicates that a root lies
between x0 and x1 and consequently
f (x0) .f (x1) < 0.

Equation of the chord joining the


points A[x0, f(x0)] and B[x1, f(x1)] is
 When x2 cuts the curve at y = 0.Our equation
becomes

For xr We Can Write as below.


NUMERICAL PROBLEM
 Find a real root of the equation x3 -2x- 5= 0
by the method of false position correct to
three decimal places.
 Answer :

X
-5 -4 -3 -2 -1 0 1 2 3 4 5

- - - -9 -4 -5 -6 -1 16 51 11
F(X)
12 61 26 0
0

Root lies between 2 and 3 .


N of X0 X1 F(x0) F(x1) (xr) F(xr)
Iteration

1 2 3 -1 16 2.058824 -0.3908

2 2.05882 3 -0.3908 16 2.0813 -


0.146804

3 2.0813 3 - 16 2.0862 -0.09277


0.146804

4 2.0862 3 -0.09277 16 2.0915 -0.034


5 2.0915 3 -0.034 16 2.0934 -0.01284
6 2.0934 3 -0.01284 16 2.0941 -
0.005038

7 2.0941 3 - 16 2.0943
0.005038
ASSIGNMENT
 Find the root of the equation cos x = xex
using the regula-falsi method correct to four
decimal places. (8 marks )
 Find a real root of the equation x log10x =
1.2 by regula-falsi method correct to four
decimal places. (2 marks )
SECANT METHOD

You might also like