MA3201 - Numerical Methods
|Student Contribution Band:
||College of Science and Engineering
Numerical linear algebra: LU, QR, SVD factorisations, eigenvalue computations, least
squares; numerical partial differential equations: finite differences, stability analysis,
iterative solutions for elliptic equations.
- manipulate advanced algebraic expressions and equations using appropriate techniques;
- factorise systems of linear equations (A=LU, A=LDU, PA=LU, A=AT=LDLT);
- understand fundamental theorems and definitions of linear algebra (operation counts,
vector norms, matrix norms, condition numbers, Gerschgorin's Theorem, left and right
- apply linear algebra methods to solve eigenvalue and eigenvector problems, including
QR algorithms and SVD factorisation;
- solve continuous and discrete least squares problems;
- classify partial differential equations and analytically solve certain types;
- construct numerical algorithms for different classes of partial differential equations
- communicate mathematical thinking incorporating the concepts and methods presented
in the course.
||MA2000 and MA2201
Study Period 2
|Census Date 23-Aug-2018
||Assoc. Professor Shaun Belward
||<Person not found>.
- 26 hours lectures
- 13 hours practicals
||end of semester exam (50%); other exams (10% - 20%); assignments (30% - 40%).
Minor variations might occur due to the continuous Subject quality improvement
process, and in case of
minor variation(s) in assessment details, the Subject Outline represents the latest