You are on page 1of 2

MAHENDRA ENGINEERING COLLEGE

(Autonomous)
Syllabus
Programme
Department CAD 5081
Code
I Semester
Maximum
Course code Course Name Hours/week Credit
marks
APPLIED MATHEMAICS FOR L T P C
17CAD11101 100
ENGINEERING DESIGN 4 0 0 4
To enable the students to,
 Understand the solution of algebraic and transcendental equations and study
the methods to solve linear system of equations by direct and iterative
Objective(s) methods.
 Acquire the knowledge to solve boundary value problems in ordinary and
Partial differential equations , using finite difference approximations.

At the end of the course the students will be able to


 Determine the solution of algebraic and transcendental equations and
system of linear equations numerically.
Outcome(s)
 Gain knowledge to solve ordinary and partial differential equations using
finite difference methods.

UNIT-I ALGEBRAIC EQUATIONS 12


Systems of linear equations: Gauss elimination method, Gauss Jordan method- Jacobi- Gauss Seidel-
iteration methods- Systems of non linear equations: fixed point iterations, Newton method, Eigen
value problems: power method.

UNIT-II COMPUTATIONAL METHODS IN ENGINEERING 12


Boundary value problems for ODE – Finite difference methods – Numerical solution of PDE –
Solution of Laplace's and Poisson equation – Liebmann's iteration process – Solution of heat
conduction equation by Schmidt explicit formula and Crank-Nicolson implicit scheme – Solution of
wave equation
UNIT-III TENSOR ANALYSIS 12
Summation convention – Contravariant and covariant vectors – contraction of tensors – inner product
– quotient law – metric tensor – Christoffel symbols – covariant differentiation – gradient, divergence
and curl
UNIT-IV CALCULUS OF VARIATION 12
Variation and its properties – Euler's equation – functionals dependent on first and higher order
derivatives – functionals dependent on functions of several independent variables – problems with
moving boundaries – direct methods – Ritz and Kantorovich methods.
UNIT-V FAST FOURIER TRANSFORM 12
Discrete Fourier transform – linearity and periodicity – inverse N-point DFT – DFT approximation of
Fourier coefficients – sampled Fourier series – Approximation of Fourier transform by an N-point
DFT – FFT – Computational efficiency of FFT
Total hours to be taught 60 PERIODS
TEXT BOOK :
1. James, G., Advanced Modern Engineering Mathematics, 3rd edition, Pearson Education, 2004
2. Grewal, B.S., Numerical methods in Engineering and Science, 7 th edition, Khanna Publishers,
2005
REFERENCES:
1. Gupta, A.S., Calculus of variations with applications, Prentice-Hall of India, New Delhi,
1997.
2. O'Neil, P.V., Advanced Engineering Mathematics, Thomson Asia Pvt. Ltd., Singapore, 2003
3. Andrews, L.C. and Philips, R. L. Mathematical Techniques for Engineers and Scientists,
Prentice Hall of India, 2006.

You might also like