Download as pdf or txt
Download as pdf or txt
You are on page 1of 30

NUMERICAL METHODS

WHY?
leads to approximate solution by
repeated application of four basic
operations of Algebra.
h h h
FINITE DIFFERENCES BASICS

FORWARD DIFFERENCES BACKWARD DIFFERENCES


next - now
new - previous
f(x+h)-f(x)
f(x+h) - f(x)

SHIFT OPERATOR
D OPERATOR
now = next
f(x+h) = f(x) D= d
dx
RELATION:
E  1   -The operator δ
E  1
 1   -mean operator
(averaging
E  e hd operator) μ
BACKWARD DIFFERENCE TABLE
ERROR PROPAGATION IN THE DIFFERENCE TABLE
ERROR PROPAGATION
APPLICATION
INTERPOLATION
WITH EQUAL INTERVALS 1.Netwon's Binommial
expansion formula

2.Newton's forward
Interpolation- is an estimation of a value interpolation formula
within two known values in a sequence of
values
3.Newton-Gregory Backward
interpolation formula
Criteria:
 x near beginning 4.Central Difference
 x near end interpolaion Formula
 x in the middle
1.Netwon's Binommial expansion formula

PASCAL'S
TRIANGLE
2.Newton's forward interpolation formula
INTERPOLATION
WITH EQUAL
INTERVALS
3.Newton-Gregory Backward Interpolation formula
INTERPOLATION
WITH UNEQUAL INTERVALS 1.Netwon's General Divided
Difference formula

2. Lagrange Formula
Interpolation- is an estimation of a value
within two known values in a sequence of
values
LAGRANGE
INVERSE
LAGRANGE
SUCCESS!!
THANK YOU FOR WATCHING

You might also like