Numerical methods
4 points * Second semester * Clayton * Prerequisites: MAT1020 * Prohibitions: ATM2132, MAT2930, MAT2452, GAS2622
Objectives On the completion of this subject students will be able to utilise at least one technique for solving the following types of problems: solving systems of linear and nonlinear equations, eigenvalues and eigenvectors, curve fitting and interpolation, numerical integration and differential equations; formulate practical problems on numerical algorithms and solve them on computers; appreciate the power and limitations of computers; adapt general techniques to specific problems; improve the ability to write practical computer programs; develop an interest in how numerical techniques can be used to solve problems; see the given techniques as having other applications in different areas; evaluate critically the results.
Synopsis Algorithms. Solution of non-linear equations. Solution of systems of equations. Interpolation and least-squares curve fitting. Numerical integration and differentiation. Numerical solution of ordinary differential equations.
Assessment Examinations (1.5 hours): 85% * Tests and assignments during the semester: 15%
Prescribed texts
Page M A Notes on numerical methods Department of Mathematics, Monash U, 1992
Recommended texts
Atkinson K Elementary numerical analysis Wiley, 1985
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |