Scribd
Upload
60 views19 pages

UNIT-3 Numerical Methods: Title: Mathematics For Mechanical Engineers

The document discusses numerical methods for solving algebraic and transcendental equations. It introduces direct and iterative methods for finding roots. Newton's method is described as the most powerful iterative root-finding algorithm. The document provides the iterative formula for Newton's method and discusses its quadratic convergence. Examples demonstrate applying Newton's method to find roots of various equations. Iterative formulas for computing reciprocals and nth roots are also presented.

Uploaded by

Zayeem Zehek
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
60 views19 pages

UNIT-3 Numerical Methods: Title: Mathematics For Mechanical Engineers

The document discusses numerical methods for solving algebraic and transcendental equations. It introduces direct and iterative methods for finding roots. Newton's method is described as the most powerful iterative root-finding algorithm. The document provides the iterative formula for Newton's method and discusses its quadratic convergence. Examples demonstrate applying Newton's method to find roots of various equations. Iterative formulas for computing reciprocals and nth roots are also presented.

Uploaded by

Zayeem Zehek
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/ 19

UNIT-3

NUMERICAL METHODS
TOPIC1-SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

TITLE : MATHEMATICS FOR MECHANICAL


ENGINEERS

Dr. KHL, D.R, V.R.Siddhartha Engineering College 1


Algebraic and Transcendental Equations
What
  is an Algebraic Equation or a Polynomial Equation?

An equation of the form  where the coefficients are real numbers and is called Algebraic
Equation.
 
 
Ex:

 What is a Non-algebraic equation or Transcendental Equation?


 
An equation involving trigonometric, logarithmic or exponential functions is called
Transcendental Equation.

Ex: l

Dr.KHL, D.R, V.R.Siddhartha Engineering College 2


Root/Zero/Solution of
an Equation

■   A number for which


is called a Root of the
equation or a zero of
■ Geometrically, a root of
equation is the value of
at which the graph of the
equation intersects the –
axis

Dr.KHL, D.R, V.R.Siddhartha Engineering College 3


 
Methods to find the roots of algebraic and transcendental equations of
the form .
■ Direct Methods :
gives the exact value of the roots in a finite number of steps
We assume here that there are no round of errors.
determine all the roots at the same time.
■ Indirect / Iterative Methods:
the solution is obtained by successive approximation
the amount of computation depends on the degree of accuracy required.
What is meant by Iterative Process?
The repeated execution of the same process where at each step the result of the preceeding
step is used and is repeated till the result is obtained to a desired degree of accuracy.

  Iterative Methods are most common methods in Numerical Analysis

Dr.KHL, D.R, V.R.Siddhartha Engineering College 4


■ Descarte’s
  rule of signs:
No. of sign changes:1
No. of positive roots:1
No. of sign changes:2
No. of -ve roots:2

■ Intermediate Value Theorem:


Statement: If is continuous in some interval and are of opposite signs then there is a real root
of lies between .
 Ex:
,
Clearly is continuous in [2,3] and are of opposite signs
By Intermediate value theorem, a root of=0 lies between 2 & 3

Dr.KHL, D.R, V.R.Siddhartha Engineering College 5


Newton-Raphson Method
  Does Newton's method always
converge?

■ This is the most powerful root extraction method to find solution of Algebraic and
Transcendental Equations
■ This is the fastest convergence method, but requires analytical computation of the
derivative of function

 
Iterative formula or Recursive algorithm

Dr.KHL,D.R,V.R.Siddhartha Engineering College 6


The order of convergence of N – R method
2 (or) 2nd order quadratic convergence

Note: The error at each step is proportional to the square of the previous error and
as such the convergence is quadratic

■  
Convergence condition for N – R method

  Advantage
When is very large, (i.e.) when the slope is large, then ‘h’ will be calculated with
great rapidly and very little labour

  When this method fails?


The process will fail if in the neighborhood of the root (or if the initial
approximation is far away from the root)

Dr.KHL,D.R,V.R.Siddhartha Engineering College 7


Newton-Raphson Formula by using Taylor’s series
 

■ Let
  be an approximate root of the equation
If is better approximation than then

(Expanding by Taylor series)

(By neglecting and higher powers of .Since, is small)

Similarly,
In general,
ere is better approximation .
■ This method is also known as Method of tangents

Dr.KHL,D.R,V.R.Siddhartha Engineering College 8


Geometrical interpretation
of NR method

■ This method consists in


replacing the part of the
curve between the point P0
and the x axis by means of
the tangent to the curve at PO

Dr.KHL,D.R,V.R.Siddhartha Engineering College 9


Derivatives formulae Things to Remember
■  ()= ■ Problems
  in NR method contains trigonometric
functions like sin or cos  Change mode in
■ ()=- calculator to Radians (R).
■ ()= ■ Problems in NR method contains trigonometric
■ ()= n functions like tan or cot  Change them into sin
or cos
■ ()= or ()=
■ or Press ln
■ ()=
■ Press log
■ ()=
■ Press shift + ln
■ (uv)=uv’+u’v
■ Press shift + log

Dr.KHL,D.R,V.R.Siddhartha Engineering College 10


■Problems:
 
1.Apply NR method to find the approximate root of the equation which lies near (or)
Apply NR method to find the approximate root of the equation which lies in the interval
[2,3]

Solution: Let
N R formula:
i.e.
, ,1,2,……… -------------------(1)
Take initial approximation as
First approximation(Put and in (1))

Dr.KHL,D.R,V.R.Siddhartha Engineering College 11


■  

Second approximation(Put and in (1))

Third approximation(Put and in (1))

Fourth approximation (Put and in (1))

Clearly the values of obtained in the last two approximations are identically equal up to
three decimal places.
From last approximation, the required root

Dr.KHL,D.R,V.R.Siddhartha Engineering College 12


■ 2.Using
  Newton’s iterative method, find the real root of 1.2 correct to five decimal
places.
■ Solution: Let =-1.2 = 0.4343
N R iterative formula:
=
= ……………(1)
1.2<0 , )= 2-1.2=-0.59794<0 & 3-1.2=0.23136>0
Clearly is continuous in [2,3]
By Intermediate value theorem, root of =-1.2=0 lies between 2 and 3
Take initial approximation as
First approximation(Put and in (1))
= 2.81

Dr.KHL,D.R,V.R.Siddhartha Engineering College 13


■
Second
  approximation(Put and in (1))

Third approximation(Put and in (1))

Fourth approximation (Put and 406 in (1))

Clearly the values of obtained in the last two approximations are identically equal up to
four decimal places.
From last approximation, the required root

Dr.KHL,D.R,V.R.Siddhartha Engineering College 14


Practice Questions:

■  Using Newton-Raphson method, find a root of the


following equations correct to the three decimal places
1. (CONVERT INTO RADIAN)
2.
3.or =0 near to
4.+=0
5.+

Dr.KHL, D.R,V.R.Siddhartha Engineering College 15


Iterative formula or Iterative algorithm or Recursive formula

  1.To compute the reciprocal of a natural number N

■  
 
Let
N-R Iterative formula
 We have  

Substitute these in Newton’s Raphson formula then we get  


■

Dr.KHL,D.R,V.R.Siddhartha Engineering College 16


■  Evaluate the following
1. 1/31
Solution: Iterative formula to compute 1/N is
(1)
Taking N=31,(1) becomes
…… (2)
Take initial approximation as as 1/30=0.03
If n=0 in (2) then first approximation = =0.0321
If n=1 in (2) then second approximation = =0.032257
If n=2 in (2) then third approximation = =0.03226
Clearly upto 4 decimal places
From last approximation, 1/31 =0.0323

Dr.KHL,D.R,V.R.Siddhartha Engineering College 17


 
2.To compute kth root of N(N>0)

■
Let  
Take as

Substitute these in Newton’s Raphson formula then we get

Note: To compute (N>0) is Hint: Let or

Dr.KHL, D.R,V.R.Siddhartha Engineering College 18


■
2.  
Solution: Iterative formula to compute is
(1)
Taking N=28,(1) becomes
(2)
Take initial approximation as as =5
If n=0 in (2) then first approximation = =5.3
If n=1 in (2) then second approximation = =5.29151
If n=2 in (2) then third approximation = =5.29150
Clearly upto 4 decimal places
From last approximation, =5.29150

Dr.KHL, D.R, V.R.Siddhartha Engineering College 19

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