BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI-K K Birla GOA CAMPUS

INSTRUCTION DIVISION
SECOND SEMESTER 2019-2020
Course Handout (Part II)
Date: 07/01/2020
In addition to part I (General Handout for all courses appended to the time table) this portion gives further
specific details regarding the course.

Course No. : MATH F313

Course Title : Numerical Analysis
Instructor-in-charge : P. DANUMJAYA

1. Scope and Objective of the Course: This course enables one to devise algorithms for numerical
solutions of different mathematical problems and also discuss the error analysis of different algorithms.

2. Text Book:
R. L. Burden and J. D. Faires, Numerical Analysis; Theory and Applications, Cengage Learning,
India Edition (2010).

3. Reference Books:
R1. Brian Bradie, A friendly introduction to Numerical Analysis, Pearson Education, 2007.
R2. Kendall E Atkinson, An Introduction to Numerical Analysis, John Wiley & Sons, 2001.
R3. Curtis F. Gerald, Patrick O. Wheatley, Applied Numerical Analysis, Pearson Education, 7th Edn., 2009.

4. Course Plan:
Lect.
Learning Objective Topics to be Covered (Refer to Text Book)
No.

To understand the potential and pitfall of Computer arithmetic, Kinds of Errors in Numerical
1-4
the numerical computation. Computation, Significant digits, Error bounds and
Evaluation of polynomials.
Bisection method, False–position method, Secant
method, Newton’s method, Fixed-point iteration
To find the roots of nonlinear equations
method, Newton’s method for multiple roots, Order of
5-12 and understand the relative strengths and
convergences of all the above methods. Newton’s
weaknesses of each method.
method and fixed-point iteration method for the system
of non-linear equations.
The Gaussian elimination method, Pathology in linear
To solve the system of linear algebraic systems-singular matrices, Determinants and matrix
equations by using direct methods and inversions, Doolittle and Crout decompositions,
13-18
iterative methods. Find the error bounds Tridiagonal and positive definite matrices, Norms,
and discuss the stability. Condition numbers and errors in solutions; Iterative
methods: Jacobi, Gauss-Seidel and SOR Methods.
Lagrange interpolation, Existence and uniqueness of
interpolating polynomial, Divided differences,
19-24 To construct an interpolating polynomial Newton's forward and backward interpolations, Errors
and evaluate at unknown points of interpolations, Piecewise linear, Piecewise
quadratic interpolations, Cubic spline construction and
Least-Square Regression.

1
 Numerical differentiation, Newton-Cotes integration
To compute numerical derivatives and
25-30 formulae, Composite rules, Error terms for Newton-
integrations using discrete data points
Cotes formulae and composite rules, Method of
and learn how to integrate functions
undetermined coefficients, Two point and Three point
containing singularities
Gaussian-Legendre quadrature rules.
Difference Equations, Forward Euler, Backward Euler
and Modified Euler methods, Taylor Series methods, 2nd
th
31-36 To compute the numerical solution of order and 4 order Runge-Kutta methods, System of
initial value problems (IVPs) ODEs and Higher order ODEs. Multistep methods:
Adams-Bashforth methods, Adams-Moulton methods,
Adams-Moulton Predictor-Corrector Method.
37-39 To solve two point boundary value
Finite difference methods
problems (BVP)

40-41 Power method, Inverse power method, QR methods of

Eigenvalues and eigenvectors of matrices
finding eigenvalues and eigenvectors of matrices.

5. Self Learning Component (SLC):

(i) Implementation of Bisection, False-position, Secant, Newton's method, Fixed-Point method
and verifying order of convergence of each method by using MATLAB.
(ii) Implementation of Gaussian elimination method and iterative methods (Jacobi, Gauss-Seidel
and SOR methods) using MATLAB.
(iii) Implementation of Interpolating polynomial, Divided differences, Newton’s forward and
Backward Interpolating polynomials using MATLAB.
(iv) Implementation of numerical differentiation and numerical integration using different
quadrature rules using MATLAB.
(v) Solving initial value problems (IVPs) and boundary value problems (BVPs) using MATLAB.

6. Evaluation Scheme:

Evaluation Duration Weightage

EC No. Date, Time Remarks
Component (%)
1 Mid Term 90 Min. 35 02/03/2020, 4:00-5:30 PM CB
Attendance/ SLC/
2 *** 25 ***
Quiz//Lab Exam
3 Comprehensive Exam 3 Hours 40 15/05/2020, 9:00-12:00 Noon CB

*** To be announced latter.

7. Problems: Students are strongly advised to workout all the problems in the text-book and do similar
problems from the reference books (R1, R2, R3). It is also strongly recommended that the students should
implement all the algorithms on computers to get a better understanding of the subject.
8. Chamber Consultation Hours: To be announced by the respective instructor.
9. Make-up: Make up for any component of evaluation will be given only in the genuine cases.
10. Notices: All the notices regarding this course will be put up only in the Moodle server.

Instructor-In-Charge
MATH F313