# MA1251 Numerical Methods Syllabus

MA1251    NUMERICAL METHODS                    3  1  0  100

AIM
With the present development of the computer technology, it is necessary to develop efficient algorithms for solving problems in science, engineering and technology. This course gives a complete procedure for solving different kinds of problems occur in engineering numerically.

OBJECTIVES
At the end of the course, the students would be acquainted with the basic concepts in numerical methods and their uses are summarized as follows:

•    The roots of nonlinear (algebraic or transcendental) equations, solutions of large system of linear equations and eigenvalue problem of a matrix can be obtained numerically where analytical methods fail to give solution.
•    When huge amounts of experimental data are involved, the methods discussed on interpolation will be useful in constructing approximate polynomial to represent the data and to find the intermediate values.
•    The numerical differentiation and integration find application when the function in the analytical form is too complicated or the huge amounts of data are given such as series of measurements, observations or some other empirical information.
•    Since many physical laws are couched in terms of rate of change of one/two or more independent variables, most of the engineering problems are
characterized in the form of either nonlinear ordinary differential equations or partial differential equations. The methods introduced in the solution of ordinary differential equations and partial differential equations will be useful in attempting any engineering problem.

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.

Previous
Next Post »