ESO 208A : Computational Methods in Engineering

Sachchida Nand Tripathi

HAG Professor, Department of Civil Engineering

Ph.D. (Environmental Engineering), University of Reading,

UK (2000)
M.Tech. (Environmental Engineering), NIT-Allahabad (1995)
B.Tech. (Civil Engineering), IIT-BHU (1992)
 ESO 208A : Computational Methods in Engineering

Text Book:

Guha, S. and Srivastava, R. (2010). Numerical Method for

Engineering and Science, 1st Edition, Oxford University Press.
Corrections to the 1st Edition at:
http://home.iitk.ac.in/~rajeshs/ErrorsInFirstEditionNM.pdf

Reference Books:

1. Chapra, S. C., and Canale, R. P. (2012). Numerical Methods

for Engineers, 6th Edition, McGraw-Hill Education (India).
2. Atkinson, K. E. (2008). An Introduction to Numerical
Analysis, 2nd Edition, John Wiley & Sons.
ESO 208A : Computational Methods in Engineering

Grading Policy:

Final Exam 45%

Mid Semester Exam 30%
Quiz (2 No.) 15%
Programming Assignment 10%
Tutorial 5% (bonus)
Philosophy: Tool and Application
Stress on Application Stress on Tool

Hammer Hammer

Nail in wood – to join pieces Force required

Nail in wall – hang a picture Angle to strike
Nail in the coffin Height of drop
…. ….

Hammer and Tongs

Hammer and Sickle
….
When the frame is properly
positioned, I will shake my
head and you should hammer
the nail through it.
• 20 cm x 30 cm rectangular plate
• Initially at temperature f(x,y). Then, insulated at x=0,
zero temperature at y=0, and convective heat
transfer at x=20 and at y=30
• Find temperature variation with time at the center

Experimental:
T   2T  2T 
    
2 
t  x  y 
2

Analytical :  
 
T ( x, y, t )   cij e cos i x sin  j y 
  i2  2j t

i 1 j 1

Numerical: Reduce to algebraic equations

 Numerical Methods
• All problems have to be reduced to
addition/subtraction/multiplication/division
• E.g., find the length of a square plate with area equal to 2
m2
• x2=2 or f(x)=x2−2=0 True Value: 1.414213562373095
– Traditional method
– Successive refinement (1:2;
x 11.4:1.5; 1.41:1.42…)
– Iterative method x  2  x

(1,1.5,1.4166667,1.4142157,1.4142136)
(100,50.01,25.024996,12.552458,….11 iterations, 1.4142136)
• Another Example:
• N machines make n types of parts, requiring tmp time
each
• If total times, Ti ( i=1,2,..N) are given, find number of
each type of part, nj ( j=1,2,…N)

 t11 t12 ... t1N   n1   T1 

t t ... t   n  T 
 21 22 2 N   2    2 
 . . . .  .   . 
 
t N 1 t N 2 ... t NN  nN  TN 

Ax  b
 Syllabus

• Introduction: Engineering problems and computational methods

• Error Analysis: Round-off and Truncation errors; Backward and Forward error
analysis
• Roots of Nonlinear Equations: Bisection method, Method of False Position,
Secant method, fixed-point method, Newton-Raphson method, Muller and
Bairstow methods; Roots of system of non-linear equations
• Solution of System of Linear Equations: Direct methods (Gauss Elimination,
Gauss-Jordan, LU decomposition, Choleski decomposition, Thomas Algorithm);
Iterative methods (Gauss-Jacobi, Gauss-Seidel)
• Approximation of functions: Approximation using polynomials (Least squares
estimation, orthogonal basis functions); Interpolation (Newton’s divided difference
and Lagrange interpolating polynomials, Spline interpolation); Regression
• Eigen values and Eigen vectors: Power and inverse power methods, and QR
decomposition
 Syllabus

• Numerical Integration and Differentiation: Newton-Cotes integration formula,

Romberg integration and Gauss-Legendre quadrature; Finite difference
approximation, Richardson’s extrapolation
• Ordinary Differential Equations (Initial Value Problems): Euler’s method,
Multi-step methods, Runge-Kutta methods, System of IVPs, Stiff problems and
Gear’s method
• Ordinary Differential Equations (Boundary Value Problems): Shooting and
direct methods
• Partial Differential Equations: Introduction to solution of PDEs, Parabolic
(diffusion equation and advection-diffusion equation), Elliptic (Laplace equation)
and Hyperbolic (Wave equation) equations