In this course we introduce matrices as a tool for representing and solving systems of linear equations. We begin with the row reduction algorithm for solving linear systems, and many applications. Then we move on to studying linear transformations and associated matrices and their determinants. We emphasise the geometric interpretations of these properties.
To gain insight into mathematical methods and techniques concerning linear systems and linear maps. How to work with linear systems efficiently on a computer, and some of the ideas underlying image processing software.
The most updated version of the timetables can be found on the students' website:
Mode of instruction
There will be a weekly lecture and also a weekly problem session. As part of the problem session there will be a short test each week, to help students judge their understanding of the material.
As well as the weekly tests, there will be a final examination. The final grade for the course will be an average of the grades from the weekly test and the grade for the final exam; the exam will count for 75%, and the tests for 25%.
David. C. Lay: *Linear Algebra and its Applications, Addison-Wesley. *
This book will be required for the course; weekly problem sessions will be based on it, and essential reading will be set from it. The 5th international edition is recommended, but other editions are also OK, just be aware that the page numbers for the required reading may be incorrect.
Signing up for classes and exams
Onderwijscoördinator Informatica, Riet Derogee.