Skip to content
← Back to courses
MA2L304 Undergraduate (ITEP) · Generally offered: Spring

Numerical Methods

L 3 T 1 P 0 Credits 4 Hours 4
Unit I: Errors in numerical computations, floating-point arithmetic, Solution of nonlinear equations: Bisection, Newton-Raphson, Secant, Fixed-point iteration methods, rate of convergence.

Unit II: Interpolation: Lagrange, Newton divided difference, finite difference operators, Newton forward and backward interpolation, Cubic spline interpolation. Numerical differentiation and integration: Trapezoidal, Simpson’s rules, Gaussian quadrature.

Unit III: Solution of systems of linear equations: Gauss elimination, pivoting, LU decomposition, Jacobi and Gauss-Seidel iterative methods. Eigenvalue problems: Power method.

Unit IV: Numerical solution of ordinary differential equations: Euler, Modified Euler, Runge-Kutta methods of order 2 and 4, Multistep methods. Introduction to numerical solution of PDEs.
Full syllabus document →

1 question tagged to this course

0 Votes

Rate of convergence of Jacobi and Gauss-Seidel Algorithms

I am aware of the two cases: a) 2X2 matrices b) Stein-Rosenberg case (where a_ii>0, a_ij