Scribd
Upload
73 views

MA1251 Syllabus

This document outlines the course structure and content for MA1251 Numerical Methods. The course is divided into 5 units that cover various numerical analysis topics like solving equations, interpolation, differentiation, integration, and solving ordinary and partial differential equations. Methods covered include Newton's method, Gaussian elimination, interpolation with cubic splines, numerical integration techniques like trapezoidal and Simpson's rules, solving initial value problems using single step and multistep methods, and finite difference methods for boundary value problems. The course allots 60 hours total, with 15 hours dedicated to tutorials. Two textbooks and two references are listed.

Uploaded by

Johny Digel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
73 views

MA1251 Syllabus

This document outlines the course structure and content for MA1251 Numerical Methods. The course is divided into 5 units that cover various numerical analysis topics like solving equations, interpolation, differentiation, integration, and solving ordinary and partial differential equations. Methods covered include Newton's method, Gaussian elimination, interpolation with cubic splines, numerical integration techniques like trapezoidal and Simpson's rules, solving initial value problems using single step and multistep methods, and finite difference methods for boundary value problems. The course allots 60 hours total, with 15 hours dedicated to tutorials. Two textbooks and two references are listed.

Uploaded by

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

MA1251 NUMERICAL METHODS 3 1 0 100

UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9+3

Linear interpolation methods (method of false position) – Newton’s method – Statement of Fixed Point
Theorem – Fixed point iteration: x=g(x) method – Solution of linear system by Gaussian elimination and
Gauss-Jordon methods- Iterative methods: Gauss Jacobi and Gauss-Seidel methods- Inverse of a matrix
by Gauss Jordon method – Eigenvalue of a matrix by power method.

UNIT II INTERPOLATION AND APPROXIMATION 9+ 3

Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton’s forward and
backward difference formulas.

UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION 9+ 3


Derivatives from difference tables – Divided differences and finite differences –Numerical integration by
trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – Two and Three point Gaussian
quadrature formulas – Double integrals using trapezoidal and Simpson’s rules.

UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL


EQUATIONS 9+ 3
Single step methods: Taylor series method – Euler and modified Euler methods – Fourth order Runge –
Kutta method for solving first and second order equations – Multistep methods: Milne’s and Adam’s
predictor and corrector methods.

UNIT V BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL DIFFERENTIAL


EQUATIONS 9+ 3

Finite difference solution of second order ordinary differential equation – Finite difference solution of one
dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two
dimensional Laplace and Poisson equations.

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
1. Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson Education
Asia, New Delhi, 2002.
2. Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub. Co. Ltd., New Delhi, 1999.

REFERENCES

1. Kandasamy, P., Thilagavathy, K. and Gunavathy, K., “Numerical Methods”, S.Chand Co. Ltd., New
Delhi, 2003.
2. Burden, R.L and Faires, T.D., “Numerical Analysis”, Seventh Edition, Thomson Asia Pvt. Ltd.,
Singapore, 2002.

You might also like