PROGRAMME:B.

Sc BRANCH/SPECIALIZATION: Mathematics

Weekly
Subject Total Contact Credit
Semester Subject Name Hours
Code Hours
L T P
4
V UM304 Numerical Methods 60 4 1 -

COURSE OBJECTIVES
By the end of the course, students will be able to:

 Solve the various types of equations.

 Know the basic properties and error propagation in a difference table.
 Find the missing data by applying the interpolation concept.
 Compute the derivative up to second order and integration of tabulated data.

COURSE OUTCOMES
At the end of the course, the students will be able to:

Bloom’s Taxonomy
(Knowledge/Comprehension/
CO No. Course Outcomes
Application/ Analysis/
Synthesis/Evaluation)
CO1 Able to solve the various types of equations (Knowledge/Comprehension)

CO2 Able to summarize the finite (Knowledge/Comprehension/Application)

difference table for both equal and
unequal intervals
CO3 Able to understand the concept of (Knowledge/Comprehension/
interpolation and can able to find the Application/ Analysis)
missing data by applying it so.
CO4 Able to elaborate the concept of (Knowledge/Comprehension/
Numerical differentiation upto higher order Application/ Evaluation)
CO5 Able to compute the integration of (Knowledge/Comprehension/Evaluation)
tabulated data
 Mapping with Program Outcome

PO1 PO2 PO3 PO4 PO5 PO6

CO1 S M S L M L
CO2 S M S L M L
CO3 S M S L M L
CO4 S M S L M L
CO5 S M S L M L

S – Strong, M – Medium, L - Low

Assessment Pattern

Bloom’s Continuous Assessment Tests Terminal

st
Category I Internal IInd Internal Examination
(30marks) (30 marks) (100marks)
Knowledge 5 5 40+10
Comprehension 5 5 10
Application 5 5 10
Analysis 5 5 10
Synthesis 5 5 10
Evaluation 5 5 10
Total 100

SYLLABUS - NUMERICAL METHODS

Unit I Solution of equations [12Periods]

Solution of algebraic and transcendental equations - Bisection method – Method of false position (Regula-Falsi Method) - Newton-
Raphson Iterative method - Solution of linear simultaneous equations - Direct methods of solution: Gauss elimination method , Gauss –
Jordan method – Iterative methods of solution : Jacobi’s method , Gauss – Seidel method

Unit II Finite differences [12Periods]

Introduction – First differences – Higher Differences – Difference Tables- Backward Differences- Central Difference Notation – Properties
of the operator ∆ - Differences of a polynomial – Factorial Polynomials – Simple Problems – Error Propagation ina difference table
– Operators E, ∇, δ, μ – Basic Properties.
 Unit III Interpolation [12Periods]
Introduction- Linear Interpolation- Gregory Newton’s forward interpolation formula – Newton’s backward interpolation formula –
equidistant terms with one or more missing values – error in polynomial interpolation- error in Newton’s interpolation formulae

Central difference interpolation formulae:

Central difference tables- Central difference interpolation formulae- Gauss’s Forward and Backward Interpolation Formulae – Stirling’s
Formula- Bessel’s Formua – Laplace – Everett Formula- Simple Problems.

Unit IV Interpolation with Unequal Intervals [12Periods]

Divided difference – properties of divided differences – Newton’s Interpolation formula for unequal intervals- Lagrange’s interpolation
formula- Inverse Interpolation – simple problems.

Unit V Numerical differentiation: [12Periods]

Introduction - Newton’s Forward and Backward difference formula to compute the derivatives upto second order – Derivatives using
Strilings formula- Maxima and Minima of a tabulated function
Numerical Integration:
The Trapezoidal rule -Simpson’s one-third rule - Simpson’s three-eighth rule – Truncation error in Simpson’s formula.

Essential Reading Book:

M.K. Venkataraman. (1992) Numerical methods for Science and Engineering National Publishing Company, Chennai.

Recommended Reading Books:

1. S. Arumugham. (2003) Numerical Methods, New Gamma Publishing,Palamkottai.

2. H.C. Saxena. (1991) Finite differences and Numerical analysis S.Chand& Co.,Delhi
3. A.Singaravelu (2004). Numerical Methods Meenakshi Agency,Chennai
4. P.Kandasamy, K.Thilagavathy (2003) Calculus of Finite difference & Numerical Analysis, S.Chand& Company Ltd., NewDelhi-55.
 COURSE PLAN

Topic No. of Proposed Date of Home Submission

Topic Name
No Periods Completion Assignments Assignments
UNIT – I : Solution ofequations
1 Solution of algebraic and transcendental equations- 1 10/08/2020 
Introduction.
2 Bisection method 1 10/08/2020 
3 Method of false position (Regula-Falsi Method) 1 12/08/2020 
4 Newton-Raphson Iterative method 1 12/08/2020 
Solution of linear simultaneous equations
5 2 17/08/2020 
6 Direct methods of solution: Gauss elimination method 1 19/08/2020 
Gauss – Jordan method
7 1 19/08/2020 
Iterative methods of solution : Jacobi’s method
8 2 24/08/2020 
Gauss – Seidel method
9 2 26/08/2020  
UNIT –II : Finite differences
1 Finite Differences - Introduction 1 31/08/2020 
2 Higher Differences 1 31/08/2020 
3 Difference Tables- Backward Differences 1 02/09/2020 
4 Central Difference Notation – Properties of ∆ 1 02/09/2020 
5 Differences of a polynomial 1 07/09/2020 
6 Factorial Polynomials 1 07/09/2020 
7 Simple Problems 1 09/09/2020 
8 Error Propagation in a difference table 1 09/09/2020 
9 Operators E, ∇ 1 14/09/2020 
10 Operators δ, μ 1 14/09/2020 
11 Basic Properties 1 16/09/2020 
12 Review of Unit-I & II 1 16/09/2020  
UNIT – IIII : Interpolation
Introduction- Linear Interpolation
1 1 28/09/2020 
2 Gregory Newton’s forward interpolation formula 1 28/09/2020 
3 Newton’s backward interpolation formula 1 30/09/2020 
4 Equidistant terms with one or more missing values 1 30/09/2020 
5 Error in polynomial interpolation 1 05/10/2020 
6 Central difference tables 1 05/10/2020 
7 Central difference interpolation formulae 1 07/10/2020 
8 Gauss’s Forward and Backward Interpolation 1 07/10/2020 
Formulae
Stirling’s Formula
9 2 12/10/2020 
10 Bessel’s Formua 1 14/10/2020 
11 Laplace – Everett Formula 1 14/10/2020  
12 Simple Problems
UNIT – IV : Interpolation with Unequal Intervals
Finite and Divided differences
1 2 19/10/2020 
2 Properties of divided differences 2 21/10/2020 
3 Newton’s Interpolation formula for unequal intervals 2 26/10/2020 
4 Lagrange’s interpolation formula 2 28/10/2020 
5 Inverse Interpolation 2 02/11/2020 
6 Simple problems 2 04/11/2020  
UNIT – V : Numerical differentiation & Integration
1 Newton’s formula to compute the derivatives -2nd 2 09/11/2020 
order- Introduction
2 Derivatives using Striling’s formula 2 11/11/2020 
3 Maxima and Minima of a tabulated function 2 16/11/2020 
4 The Trapezoidal rule 2 18/11/2020 
5 Simpson’s one-third rule 2 23/11/2020 
6 Simpson’s three-eighth rule 2 25/11/2020  
Total Periods 60
Total Hours 60
Lecture -2 (Bisection Method)

Bisection method is a straightforward technique to find numerical solutions of an equation with one unknown. Among all the numerical methods,
the bisection method is the simplest one to solve an algebraic ortranscendental equation. In this class, we will discuss the bisection method with
solved problems in detail.

The bisection method is used to find the roots of an algebraic or transcendental equation. It separates the interval and subdivides the interval in
which the root of the equation lies. The principle behind this method is the intermediate theorem for continuous functions. It works by narrowing
the gap between the positive and negative intervals until it closes in on the correct answer. This method narrows the gap by taking the average of
the positive and negative intervals. It is a simple method, and it is relatively slow. The bisection method is also known as interval halving method,
root-finding method, binary search method or dichotomy method.

Let, consider a continuous function “f” which is defined on the closed interval [a, b], is given with f(a) and f(b) of different signs. Then by
intermediate theorem, there exists a point x belong to (a, b) for which f(x) =0.

Bisection Method Algorithm:

Follow the below procedure to get the solution for the continuous function:
For any continuous function f(x),
 Find two points, say a and b such that a < b and f(a)* f(b) < 0
 Find the midpoint of a and b, say ‘t’, i.e. t=(a+b)/2
 t is the root of the given function if f(t) = 0; else follow the next step
 Divide the interval [a, b]
 If f(t)*f(b) <0, let a = t
 Else if f(t) *f(a)<0, let b = t
  Repeat above three steps until f(t) = 0.
The bisection method is an approximation method to find the roots of the given equation by repeatedly dividing the interval. This method will divide
the interval until the resulting interval is found, which is extremely small.

Problem 1:
Determine the root of the given equation x2-3 = 0 for x ∈ [1, 2] using bisection method
Solution:
Given: x2-3 = 0
Let f(x) = x2-3
Now, find the value of f(x) at a= 1 and b=2.
f(x=1) = 12-3 = 1 – 3 = -2 < 0
f(x=2) = 22-3 = 4 – 3 = 1 > 0
The given function is continuous, and the root lies in the interval [1, 2].
Let “t” be the midpoint of the interval.
I.e., t = (1+2)/2
t =3 / 2
t = 1.5
Therefore, the value of the function at “t” is
f(t) =f(1.5) = (1.5)2-3 = 2.25 – 3 = -0.75 < 0
f(t) is negative, so b is replaced with t= 1.5 for the next iterations.
The iterations for the given functions are:
 Iterations a b t f(a) f(b) f(t)

1 1 2 1.5 -2 1 -0.75

2 1.5 2 1.75 -0.75 1 0.062

3 1.5 1.75 1.625 -0.75 0.0625 -0.359

4 1.625 1.75 1.6875 -0.3594 0.0625 -0.1523

5 1.6875 1.75 1.7188 -01523 0.0625 -0.0457

6 1.7188 1.75 1.7344 -0.0457 0.0625 0.0081

7 1.7188 1.7344 1.7266 -0.0457 0.0081 -0.0189

So, at the seventh iteration, we get thes interval [1.7266, 1.7344]

Hence, 1.7344 is the approximated solution.

Problems: 2
Determine the root of the equation x-cos(x) =0 using bisection method?
Let f (x) = x − cos (x)
Here f (0) = −1 <0 ; f (1) = 0.45 > 0
Let a= 0; b=1; (f(a)<0;f(b)>0)
c=(a+b)/2=0.5
Now f(c) <0. Take a=0.5; b=1
c=(a+b)/2 =0.75
Now f(c) >0. Take a=0.5; b=0.75
c= (a+b)/2 = 0.625
Now f(c)<0 . Take a=0.625; b=0.75
c= (a+b)/2=0.6875
We continue this process until to get the desired accuracy.
After 14 iterations c=0.7391 and f(c)=-0.0001
Implementation of bisection algorithm to MATLAB- Solved problem-2
f=@(x) x-cos(x);
a=0;b=1; % f(a)<0 ; f(b)>0
for i=1:14
c=(a+b)/2;
f_value(i)=f(c);
if f(c)>0
b=c;
else
a=c;
end
end
root=c
er=f_value-f(c);
plot(er, ':.') % Error Plotting

Assignment Problems

1. By using the bisection method, find an approximate root of the equation sin(x) =1/x , that lies between x=1 and x=1.5 ( measured in radius).
Carry out computations upto the 7th stage.
 2. Find the root of the equation x4-x-10=0 correct to the three decimal places using bisection method?
3. By using the bisection method, find an approximate root of the equation xex =sin(x) correct to the three decimal places?
4. Using bisection method, find a real root of x+log10x =3.375 correct to the three decimal places?
5. Find the root of the equation ex-x=2 lying between 1 and 1.4 using bisection method correct to the three decimal places?

Sample Home assignments and submission assignments:

Unit No. Part-A Part-B

1. Write Newton-Raphson formula to obtain the 1. Find the iterative formula for finding 3
N where N is a positive real
cube root of N.
number using N-R method. Hence evaluate 3 10 to four decimal places.
2. Find the first approximation of the equation
2. Solve by gauss elimination method 2 x  y  4 z  12; 8 x  3 y  2 z  20;
x log10 x  1.2  0 by Newton-Raphson
4 x  11 y  z  33.
method.
1 3. Find the inverse of the matrix using Gauss elimination method
3. Write the demerit of bisection method.
4. Write a sufficient condition for Gauss Jacobi  2 1 1
 
and Seidal method to converge. A   3 2 3 .
 1 4 9
 
4. Solve 28 x  4 y  z  32; x  3 y  10 z  24; 2 x  17 y  4 z  35.

1. Prove that E  1   . 1. Find the missing value of y if the first differences given below
2. Show that        2 .
y: 2 - - - - -
3. Show that E  E .
y : 3 5 7 9 9 13
 
4. Prove that      .
 
 n  1 1  1 
2 5. Prove that E 1 / 2    1 / 2 . 2. Prove the following i)  tan 1    tan  2  .
 n   2n 
6. Prove that E  e hD . 3. Form the difference table for the following data and hence find 5 y 0 .
7. Prove that 2 y 2   2 y 4 .
 8. Prove that m n  f  x   m  n f  x  . x: 0 1 2 3 4 5
y: 1 5 19 55 125 241
4. The following is a table of values of a polynomial of degree 5. It is
known that f 3 is in error. Correct the error.

x: 0 1 2 3 4 5 6
y: 1 2 33 254 1025 3126 7777
1. If f 3  5, f 5  3 , what is the linear 1. From the data given below, find the number of students whose weight
interpolation function f  x  ? is between 60 and 70.
2. What is the relation between Bessel’s and weight 0-40 40-60 60-80 80-100 100-120
3 Everett’s formulae? No. of Students 250 120 100 70 50
3. Form the central difference table for the
following data choosing x  35 as the origin. 2. Derive Gauss forward interpolation formula
3. Derive Gauss backward interpolation formula
x: 20 25 30 35 40 45
4. Estimate 1.12 using Stirling’s formula from the following table
y: 12 15 20 27 39 52
x: 1.00 1.05 1.10 1.15 1.20 1.25 1.30
x: 1.0000 1.0247 1.0488 1.0724 1.0954 1.1180 1.1402

5. Use Bessel’s formula to find tan f 28 given that

x: 15 20 25 30 35 40
f x  : 10.3797 12.4622 14.0939 15.3725 16.3742 17.1591

1. State any two properties of divided differences 1. Find U 2 , given that U 0  2, U 1  5, U 3  29 and U 7  19.
2. Form the divided difference table for the 2. The following are the measurements of t made on a curve recorded by
following data: an oscillograph representing a change in the conditions of an electric
4 x: 2 5 10 current.
y: 5 29 109
t: 1.2 2.0 2.5 3.0
3. What is inverse interpolation
i: 1.36 0.58 0.34 0.20
 Find the value of i when t  1.6

3. Find the parabola of the form y=ax2+bx+c passing through the points
(0,0),(1,1),(2,20)
4. From the data given below, find the value of x when y=13.5

x: 93.0 96.2 100.0 104.2 108.7

y: 11.38 12.80 14.70 17.07 19.91
1. How to get more accurate result in trapezoidal
rule. 1. Find the first two derivatives of (x)1/3 at x=50 and x=56 given the table
2. State Simpson’s one-third rule below
3. State Simpson’s three-eighth rule
x 50 51 52 53 54 55 56
4. Define truncation error of Simpson’s three- 1/3
y=x 3.6840 3.7084 3.7325 3.7563 3.7798 3.8030 3.8259
eighth rule.
2. The population of a certain town is given below. Find the rate of growth
of the population
5 in 1931, 1941, 1961 and 1971.
Year (x) 1931 1941 1951 1961 1971
Population in ‘000 (y) 40.62 60.80 79.95 103.56 132.65

3. A curve passes through the points (1,2),

(1.5,2.4),(2,2.7),(2.5,2.8),(3,3),(3.5,2.6) and (4.0,2.1). Obtain the area
bounded by the curve, the x-axis and x=1 and x=4.
6
1
4. Evaluate the integral 1 x
0
2
dx By using Trapezoidal rule and

Simpson's rule, also verify you answer by actual integration