Linear Algebra:  2021-2022

Overview

The lectures for this course will be pre-recorded and will be available on Youtube (see Course materials for a structured list of the videos and slides).

The lectures will be supported by live discussion sessions on Teams. They take place each Friday at 11am and cover the material as indicated in the following table. The sessions are entirely driven by student questions. Students can ask questions live or post questions on Teams (possibly in advance).

The course introduces basic concepts and techniques from linear algebra that will be required in later courses in areas such as machine learning, computer graphics, quantum computing. The theoretical results covered in this course will be proved using mathematically rigorous proofs, and illustrated using suitable examples. The syllabus for the Preliminary Examination in Computer Science changed in the academic year 2019-2020 and then again in 2021-2022. Material on iterative solution to linear equations  has been removed. Past exam questions on these topics are therefore not suitable when attempting past exam questions.

This course is part of both the Preliminary Examination for Computer Science students and the Final Honour School for Computer Science and Philosophy students. Questions set from this course for the Final Honour School in Computer Science and Philosophy will be more challenging than those that are set for the Preliminary Examination in Computer Science, and students taking this exam should bear this in mind when attempting sample exam questions and past exam questions.

Learning outcomes

At the end of this course the student will be able to:

• Solve linear systems of equations.
• Comprehend vector spaces and subspaces.
• Understand fundamental concepts of linear maps, including isomorphisms, range and nullspace, matrices, change of bases and projections.
• Deal with Determinants.
• Understand similarity, including eigenvalues, eigenvectors, and diagonalisation.
• Have an insight into the applicability of linear algebra.

Synopsis

Lectures 1-20 cover the syllabus for the Preliminary Examination in Computer Science.

Lectures 1-17 cover the syllabus for the Final Honour School in Computer Science and Philosophy. They follow closely the corresponding chapters from the textbook.

• Lectures 1-3 Linear Systems: solving linear systems; linear geometry; reduced echelon form.

• Lectures 4-7 Vector Spaces: definition; linear independence; basis and dimension. 
  

• Lectures 8-13 Maps Between Spaces: isomorphisms; homomorphisms; computing linear maps; matrix operations; change of basis; projection. 
  

• Lectures 14-15 Determinants: definition; geometry of determinants; Laplace's formula.

• Lectures 16-17 Similarity: definition; eigenvectors and eigenvalues.

• Lectures 18-20 Least Squares and Factorisations: least squares; LU factorisation; QR factorisation; singular value decomposition.

Syllabus

• Linear systems
• Reduced echelon form
• Vector spaces
• Linear independence
• Basis and dimension
• Linear maps
• Isomorphism
• Range and null space
• Matrices
• Change of basis
• Orthogonal projection
• Determinants
• Laplace's formula
• Similarity
• Eigenvalues and eigenvectors
• Diagonalisation
• Least squares (CS Prelims only)
• LU factorisation, QR factorisation, singular value decomposition (CS Prelims only)

Reading list

• Jim Hefferon. Linear Algebra.

Taking our courses

This form is not to be used by students studying for a degree in the Department of Computer Science, or for Visiting Students who are registered for Computer Science courses

Other matriculated University of Oxford students who are interested in taking this, or other, courses in the Department of Computer Science, must complete this online form by 17.00 on Friday of 0th week of term in which the course is taught. Late requests, and requests sent by email, will not be considered. All requests must be approved by the relevant Computer Science departmental committee and can only be submitted using this form.