4 points
* Two 1-hour lectures per week
* Second
semester
* Clayton
* Prerequisites: CSC1011 or equivalent and 12 points
of approved first-year mathematics subjects (or equivalent)
* Prohibitions:
MAA2032, MAT2452
Objectives On completion of the subject, students should understand the effect of stability on numerical algorithm design; understand basic algorithms for solving linear systems of equations; and understand how to construct algorithms with guaranteed stability for solving problems in numerical linear algebra.
Synopsis Numerical methods for solving systems of linear equations, special matrices, eigenvalues, error analysis for linear systems, overdetermined linear systems, curve fitting, polynomial approximation.
Assessment Examination (2 hours): 70%
* Practical
work: 30%
Recommended texts
Kahaner D and others Numerical methods and software Prentice-Hall, 1989
Back to the Information Technology Handbook, 1998
Published by Monash University, Australia
Maintained by wwwdev@monash.edu.au
Approved by M Rambert, Faculty of Information Technology
Copyright © Monash University 1997 - All Rights Reserved -
Caution