Numerical methods for engineers
J C Lattanzio
3 points * 26 lectures, 12 practice classes/computer laboratory sessions * First/Second semester * Clayton * Prerequisites: MAT1920
Matrix algebra; errors and accuracy; introduction to computing; solution of linear invertible systems (existence of solution, Gaussian elimination, the LU decomposition, pivoting and ill-conditioned systems, tri-diagonal systems, iterative methods); solution of m x n linear systems (echelon form, basic and free variables, general solution); eigenvalues and eigenvectors (characteristic equation, power method); solution of non-linear equations (bracketing method, fixed-point iteration, Newton-Raphson method, systems of non-linear equations); least-squares curve-fitting (linear, polynomial and general regression); interpolation (linear and quadratic, Lagrange interpolating polynomials, cubic splines); numerical integration (the mid-point and trapezoidal rules, Simpson's rule, Richardson extrapolation); ordinary differential equations (Euler's method, the improved and modified Euler's methods, fourth order Runge-Kutta method, systems of ODEs).
Assessment
Examinations (1.5 hours): 71% * Assignments (3 @ 7% each): 21% * Tests (2 @ 4% each): 8%
Prescribed texts
Lattanzio J C Numerical methods for engineers lDept Mathematics, Monash U, 1994
Mathews J H Numerical methods for mathematics, science and engineering 2nd edn, Prentice-Hall, 1992