Tentalabbet

TNA010 · 6 credits · Basic level (G2F) · Matematik, Tillämpad matematik

Matrix Methods for AI

Active · next start HT 2026

100%

passed the latest regular sitting

UPG1 · 23 Dec 2024 · 8 students

100%

passed the regular sittings, all sittings over the last 5 years

UPG1 · 34 students

This module only reports passing results, so the pass rate does not show how many did not pass.

Part of 6 programmes

Hand-in or lab

UPG1 Inplementation and report of applied project

  • G

Main rounds

100% passed · 34 students

  • 100%8
  • 100%10
  • 100%8
  • 100%8

Later rounds

No sittings with at least 5 students.

    Other modules

    Partial exams, hand-ins and labs. They are not part of the figures at the top.

    Hand-in or lab

    UPG2 Hand-in assignments

    • G

    Main rounds

    100% passed · 11 students

    • 100%5
    • 100%6

    Later rounds

    No sittings with at least 5 students.

      Show small sittings (9)

      Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

      • 100%3
      • 100%3
      • 100%1
      • 100%2
      • 100%1
      • 100%1
      • 100%2
      • 100%1
      • 100%4

      About the course

      Aim

      The course aims to provide practical and theoretical knowledge about matrix methods used to solve problems in artificial intelligence applications. An important aspect of the course is to address a number of specific application problems in project form and thereby motivate, elucidate and introduce mathematical theory related to matrices and matrix computations. After completing the course, the course participant will achieve the following objectives.

      • Have knowledge about how vectors and matrices are used in AI applications,
      • Have knowledge of important concepts when solving systems of linear equations and least squares problems.
      • Use different matrix decompositions (LU, QR, and SVD decomposition) to solve practical and theoretical problems.
      • Know the principles of clustering and graph partitioning, and use such methods to solve practical problems.
      • Have knowledge about tensors and tensor decompositions, and use such methods to solve practical problems.
      • Have knowledge about non-negative matrix factorizations, and use such methods to solve practical problems.
      • Have knowledge about sources of error in computer arithmetic, how errors propagate in computations.
      • Know about cancellation and how it can be avoided.
      • Be able to reason about, interpret and perform basic sensitivity analysis.
      • Have knowledge about computer arithmetic and how hardware and memory hierarchy affect the efficiency of computer programs.

      Content

      Vectors and matrices in AI applications, matrix theory and matrix computations, solution of systems of linear equations and least squares problems, matrix decompositions, LU decomposition, QR decomposition, eigenvalues ​​and eigenvectors, singular value decomposition (SVD), singular values ​​and singular vectors, tensors, clustering and graph partitioning, non-negative matrix factorizaitons. Project work in a group where method and theory are used to solve an application problem in information technology, for example, classification of handwritten digits, text mining for document search, Page Rank for searching web pages, automatic extraction of keywords and key phrases, face recognition. The course also introduces error analysis, sensitivity analysis, condition number, memory hierarchy, design of software for computations.

      Examiner
      Berkant Savas
      Scheduled hours
      40 h
      Main field of study
      Matematik, Tillämpad matematik
      Syllabus on Studieinfo ↗