![]() | Department of Mathematics & Computer Science | |||
![]() |
Credits: 10 | Convenor: Dr Dietrich Notbohm | Semester: 2 |
Prerequisites: | essential: MC144, MC145 | |
Assessment: | Coursework, Maple project: 20% | One and a half hour exam: 80% |
Lectures: | 18 | Problem Classes: | none |
Tutorials: | 5 | Private Study: | 46 |
Labs: | 6 | Seminars: | none |
Project: | none | Other: | none |
Surgeries: | none | Total: | 75 |
To understand the definition and fundamental examples of vector spaces and subspaces; to be able to verify that certain subsets of vector spaces are subspaces; to understand the ideas of a linear combination of vectors, the space spanned by a set of vectors, linear independence, basis and dimension; to be able to find a basis for the space spanned by a given set of vectors.
To understand how to use elementary row operations on matrices to solve systems of linear equations; to know how to use Maple to carry out these computations; to understand the role of the rank and the row-reduced echelon form; to understand the varying nature of solution sets.
To be able to perform the operations of matrix algebra, including finding determinants and inverses; to know how to use Maple to carry out such tasks.
To be able to compute the eigenvalues and eigenvectors of a matrix; to know how to diagonalise matrices in simple cases.
An understanding of abstraction and the axiomatic method.
The ability to solve systems of linear equations methodically.
The ability to perform matrix computations including diagonalisation.
Knowledge of Maple as a tool for doing linear algebra.
The ability to present logical arguments in written form.
Definition of a vector space over a field , fundamental examples of
vector spaces, elementary consequences of the definition, subspaces,
intersections of subspaces, linear combinations of vectors, the space
spanned by a set of vectors, linear independence, basis, dimension, the
exchange process
Homogeneous and inhomogeneous systems of linear equations, the matrix
form of a system of linear equations, elementary row operations, Gaussian
elimination, row equivalence, row-reduced echelon form of a matrix, rank
of a matrix, parametric and non-parametric descriptions of the space
spanned by a set of vectors in , row space and row rank,
column space and column rank, null space and nullity
Addition and multiplication of matrices, invertibility, using row operations to find the inverse of an invertible matrix, elementary matrices, rank and invertibility, cofactors and minors of a matrix, determinants, the determinant of a product, the adjoint of a matrix
Eigenvalues, eigenvectors, the characteristic polynomial and characteristic equation of a matrix, similarity of matrices, diagonalisation, the Cayley-Hamilton Theorem, powers of a matrix
R. B. J. T. Allenby, Linear Algebra, Edward Arnold, 1995.
J. B. Fraleigh and R. A. Beauregard, Linear Algebra, 3rd edition, Addision-Wesley, 1995.
L. W. Johnson, R. P. Riess, and J. T. Arnold, Introduction to Linear Algebra, 3rd edition, Addison-Wesley, 1993.
S. Lang, Introduction to Linear Algebra, Springer Verlag, Undergraduate Texts in Mathematics.
L. Smith, Linear Algerba, Springer Verlag, Undergraduate Texts in Mathematics.
G. Strang, Linear Algebra and its Applications, 3rd edition, Harcourt Brace Jovanovich, 1988.
S. Lipschutz, Schaum's Outline of Theory and Problems of Linear Algebra, 2nd edition, McGraw-Hill, 1991.
The final assessment of this module will consist of 10% coursework, 10% from a MAPLE project and 80% from a one and a half hour examination during the Summer exam period. The 10% coursework contribution will be determined by students' solutions to coursework problems. The examination paper will contain 4 questions with full marks on the paper obtainable from 3 complete answers.
![]() ![]() ![]() ![]() ![]() |
Author: S. J. Ambler, tel: +44 (0)116 252 3884
Last updated: 2001-09-20
MCS Web Maintainer
This document has been approved by the Head of Department.
© University of Leicester.