Course Description
-
Course Name
Linear Algebra for AI
-
Host University
Vrije Universiteit Amsterdam
-
Location
Amsterdam, The Netherlands
-
Area of Study
Algebra
-
Language Level
Taught In English
-
Prerequisites
ISA offers course level recommendations in an effort to facilitate the determination of course levels by credential evaluators. We advise each institution to have their own credentials evaluator make the final decision regarding course levels.
-
Course Level Recommendations
Upper
ISA offers course level recommendations in an effort to facilitate the determination of course levels by credential evaluators.We advice each institution to have their own credentials evaluator make the final decision regrading course levels.
-
ECTS Credits
6 -
Recommended U.S. Semester Credits3
-
Recommended U.S. Quarter Units4
Hours & Credits
-
Overview
Course Objective
Students will be able to explain, interrelate, know the basic properties of, and construct simple arguments (Knowledge and understanding, Making judgements, Communication). Next to that, students will learn the
following skills, which are organized by topic (Applying knowledge and understanding):
Linear systems:
- Can solve systems of linear equations using row-reduction
- Can determine the number of solutions of a linear system
- Can prove or disprove simple statements concerning linear systems
Linear transformations:
- Can determine if a linear transformation is one-to-one and onto
- Can compute the standard matrix of a linear transformation
- Can use row-reduction to compute the inverse of a matrix
- Can prove or disprove simple statements concerning linear transformations
Subspaces and bases:
- Can compute bases for the row and column space of a matrix
- Can compute the dimension and determine a basis of a subspace
- Can prove or disprove simple statements concerning linear systems
Eigenvalues and eigenvectors:
- Can compute the eigenvalues of a matrix using the characteristic equation
- Can compute bases for the eigenspaces of a matrix
- Can diagonalize a matrix
- Can prove or disprove simple statements concerning eigenvalues andeigenvectors
Orthogonality:
- Can compute the orthogonal projection onto a subspace
- Can determine an orthonormal basis for a subspace using the
Gramm-Schmidt algorithm
- Can solve least-squares problems using an orthogonal projection
- Can orthogonally diagonalize a symmetric matrix
- Can compute a singular value decomposition of a matrix
- Can prove or disprove simple statements concerning orthogonalityCourse Content
The topics that will be treated are listed below. For every topic, the relevant concepts are listed.
Linear systems:
linear system (consistent/inconsistent/homogeneous/inhomogeneous), (augmented) coefficient matrix, row equivalence, pivot position/column, (reduced) echelon form, basic/free variable, spanning set, parametric vector form, linear (in)dependence.
Linear transformations:
linear transformation, (co)domain, range and image, standard matrix, one-to-one and onto, singularity, determinant, elementary matrices.
Subspaces and bases:
subspace, column and null space, basis, coordinate system, dimension, rank.
Eigenvalues and eigenvectors:
eigenvalue, eigenvector, eigenspace, characteristic equation/polynomial, algebraic multiplicity, similarity, diagonalization and diagonalizability.
Orthogonality:
dot product, norm, distance, orthogonality, orthogonal complement, orthogonal set/basis, orthogonal projection, orthonormality, orthonormal basis, Gramm-Schmidt process, least squares problem/solution, orthogonal diagonalization, singular value/vector, singular value decomposition, Moore-Penrose inverse.Additional Information Teaching Methods
The course is spread over a period of seven weeks. Each week there will be two theoretical classes of 90 minutes each and two exercise classes of 90 minutes each.
Method of Assessment
There is a written exam at the end of the course.
Additional Information Target Audience
Bachelor Artificial Intelligence (year 2)
Course Disclaimer
Courses and course hours of instruction are subject to change.
Some courses may require additional fees.