Numerical Analysis I | Department of Mathematics

Numerical Analysis I

Core course for B.Sc. (Research) Mathematics.

Credits (Lec:Tut:Lab) = 3:0:1 (3 lectures and 1 two-hour lab weekly)

Prerequisites: Class XII Mathematics

Overview: Numerical Analysis takes up the problems of practical computation that arise in various areas of mathematics, physics and engineering. The focus is on analyzing the numerical methods and algorithms for obtaining approximate solutions, error estimates and rate of convergence, and implementation of computer programs.

Detailed Syllabus:

  1. Solving Equations: Iterative methods, Bisection method, Secant method, Newton-Raphson method, Rates of convergence, Roots of polynomials.
  2. Interpolation: Lagrange and Hermite interpolation, Interpolating polynomials using difference operators.
  3. Numerical Differentiation: Methods based on interpolation, methods based on finite difference operators.
  4. Numerical Integration: Newton-Cotes formula, Gauss quadrature, Chebyshev’s formula.
  5. Systems of Linear Equations: Direct methods (Gauss elimination, Gauss-Jordan method, LU decomposition, Cholesky decomposition), Iterative methods (Jacobi, Seidel, and Relaxation methods)
  6. Labs: Computational work using C, Python or Matlab.


  1. E. Suli and D. Mayers, Introduction to Numerical Analysis, Cambridge University Press, 2003.
  2. R.L. Burden and J.D. Faires, Numerical Analysis, Cengage Learning, 9th Edition, 2010.
  3. M.K. Jain, S.R.K. Iyengar, and R.K. Jain, Numerical Methods for Scientific and Engineering Computation, New Age International Ltd., 1999.
  4. J.H. Mathews and K. Fink, Numerical Methods using Matlab, PHI Learning, 4th Edition, 2003.
Course Code: 
Course Credits: 
Course Level: