Show/hide contentOpenClose All
Curricular information is subject to change
After successful completion of this module, a student should be able to:
1. Define and discuss the basic concepts of linear independence and span.
2. Determine when a subset is a subspace and when a given map is a linear transformation.
3. State several basic results on vector spaces relating bases, subspaces and dimension;
4. Compute the characteristic polynomial, eigenvalues and eigenvectors of a matrix and to determine whether or not a matrix can be diagonalized.
5. Apply the rank-nullity theorem and state the connection between linear transformations and matrices.
6. Apply Gaussian elimination techniques to:
(a) decide whether or not a given set of vectors is linear independent;
(b) decide whether a vector is in the span of a set of vectors;
(c) decide whether or not a vector is contained in the column space or row space or null space of a matrix;
(d) compute a basis for the column space, row space or null space of a matrix;
(e) compute a basis for the eigenspace of a matrix for each eigenvalue;
(f) obtain a matrix representation of a linear transformation.
7. Evaluate inner products on a vector space.
8. Compute an orthogonal/orthonormal basis using the Gram-Schmidt process.
9. Visualise and make sense of learning outcomes 1-8.
Module indicative contentis as follows: vector spaces over a field, subspaces, spanning sets, linear independence, bases, dimension, linear transformations and matrices, isomorphism, rank and nullity of a linear transformation/matrix, the Rank-Nullity Theorem, eigenvalues and eigenvectors, diagonalising a matrix, inner-product spaces, orthonormal bases, and and time allowing, positive definite matrices.
Student Effort Type | Hours |
---|---|
Lectures | 24 |
Tutorial | 12 |
Autonomous Student Learning | 76 |
Total | 112 |
This course relies heavily on the theory of systems of linear equations. Anyone taking this course should have a good grasp of the Gauss-Jordan algorithm, results relevant to solving systems of linear equations and basic matrix algebra including how to compute the inverse of an nxn matrix for n<5. Students should have previously taken and passed MST10030 Linear Algebra I, MATH10200, Matrix Algebra or an equivalent course.
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Class Test: In term class test. | Unspecified | n/a | Standard conversion grade scale 40% | No | 20 |
Examination: Final exam | 2 hour End of Trimester Exam | No | Standard conversion grade scale 40% | No | 80 |
Resit In | Terminal Exam |
---|---|
Autumn | Yes - 2 Hour |
• Group/class feedback, post-assessment