Scribd
Upload
289 views3 pages

EL - 504 Numerical Methods - DC-II Maths

This document outlines the syllabus for a Numerical Methods course over 12 weeks. It includes the breakdown of theory and practical sessions each week, covering topics such as floating point representation, root finding methods, linear systems solving, interpolation, numerical integration, ordinary differential equations, and programming in MATLAB. Students will implement algorithms for root finding, linear systems, interpolation, integration, and ODE solving in weekly practical assignments. The course is assessed through theory, practical, and internal exams with references to three textbooks on numerical analysis.

Uploaded by

Bhawana Rawat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
289 views3 pages

EL - 504 Numerical Methods - DC-II Maths

This document outlines the syllabus for a Numerical Methods course over 12 weeks. It includes the breakdown of theory and practical sessions each week, covering topics such as floating point representation, root finding methods, linear systems solving, interpolation, numerical integration, ordinary differential equations, and programming in MATLAB. Students will implement algorithms for root finding, linear systems, interpolation, integration, and ODE solving in weekly practical assignments. The course is assessed through theory, practical, and internal exams with references to three textbooks on numerical analysis.

Uploaded by

Bhawana Rawat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Numerical Methods

Total marks: 150(Theory: 75, Practical: 50, Internal Assessment: 25)


5 Periods (4 lectures +1 students presentation),
Practical (4 periods per week per student),

Use of Scientific Calculators is allowed.


(1stWeek)
Floating point representation and computer arithmetic, Significant digits, Errors: Roundoff error, Local truncation error, Global truncation error, Order of a method, Convergence
and terminal conditions, Efficient computations
Sections 1.2.3, 1.3 (Pages 16 to 25 and Page 30) [1]

(2ndWeek)
Bisection method, Secant method, RegulaFalsi method
Sections 2.1, 2.2 [1]

(3rdWeek)
NewtonRaphson method, Newtons method for solving nonlinear systems
Sections 2.3, 7.1.1(Pages 266 to 270) [1]

(4thWeek)
Gauss elimination method (with row pivoting) and GaussJordan method, Gauss Thomas
method for tridiagonal systems
Sections 3.1 (Pages 110 to 115), 3.2, 3.3 [1]

(5thWeek)
Iterative methods: Jacobi and Gauss-Seidel iterative methods
Sections 6.1 (Pages 223 to 231), 6.2 [1]

(6thWeek)
Interpolation: Lagranges form and Newtons form
Sections 8.1 (Pages 290 to 299 and Pages 304 to 305) [1]

(7thWeek)
Finite difference operators, Gregory Newton forward and backward differences
Interpolation
Sections 4.3, 4.4 (Pages 235 to 236) [2]

Page 70 of 91

(8thWeek)
Piecewise polynomial interpolation: Linear interpolation, Cubic spline interpolation (only
method), Numerical differentiation: First derivatives and second order derivatives,
Richardson extrapolation
Sections 16.1, 16.2 (Pages 361 to 363), 16.4 [3]
Section 11.1 (Pages 426 to 430 and Pages 432 to 433) [1]

(9thWeek)
Numerical integration: Trapezoid rule, Simpsons rule (only method), NewtonCotes open
formulas
Sections 11.2 (Pages 434 to 445) [1]

(10thWeek)
Extrapolation methods: Romberg integration, Gaussian quadrature, Ordinary differential
equation: Eulers method
Sections 11.2.4, 11.3.1 [1]
Section 20.2 (Pages 481 to 485) [3]

(11thWeek)
Modified Eulers methods: Heun method and Mid-point method, Runge-Kutta second
methods: Heun method without iteration, Mid-point method and Ralstons method
Sections 20.3, 20.4 (Pages 493 to 495) [3]

(12thWeek)

Classical 4th order Runge-Kutta method, Finite difference method for linear ODE
Section 20.4.2 [3]
Section 14.2.1 [1]

PRACTICALS
1. Find the roots of the equation by bisection method (Exercises P2.1 to P2.20 [1])
2. Find the roots of the equation by secant/RegulaFalsi method (Exercises P2.1 to
P2.20 [1])
3. Find the roots of the equation by Newtons method (Exercises P2.11 to 2.29 [1])
4. Find the solution of a system of nonlinear equation using Newtons method
(Exercises P7.1 to P7.15 [1])
5. Find the solution of tridiagonal system using Gauss Thomas method (Exercises
P3.21 to P3.25, C3.1 to C3.3, A3.7, A3.8[1])
Page 71 of 91

6. Find the solution of system of equations using Jacobi/Gauss-Seidel method


(Exercises P6.1 to P6.18 [1])
7. Find the cubic spline interpolating function (Exercises C8.1 to C8.5 [1])
8. Evaluate the approximate value of finite integrals using Gaussian/Romberg
integration (Exercises P11.6 to P11.20 [1])
9. Solve the initial value problem using Eulers method and compare the result with
the exact solutions (Exercises P12.11 to P12.20 [1])
10. Solve the boundary value problem using finite difference method (Exercises P14.1
to P14.25 [1])
Note: Programming is to be done in any one of Computer Algebra Systems:
MATLAB/MATHEMATICA/MAPLE.

REFERNCES:
[1] Laurence V. Fausett, Applied Numerical Analysis, Using MATLAB, Pearson, 2/e
(2012)
[2] M.K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and
Engineering Computation, New Age International Publisher, 6/e (2012)
[3] Steven C Chapra, Applied Numerical Methods with MATLAB for Engineers and
Scientists, Tata McGraw Hill, 2/e (2010)

Page 72 of 91

You might also like