Joining the INP
Joining a school
Sign up
Welcome booklet
School / Prep
ENSEIRB-MATMECA
Internal code
EI9IF345
Description
The aim of the course is to explore methods for solving dense linear algebra problems in a high-performance computing context. Particular attention will be paid to the (re)formulation of these algorithms in a parallel context, in connection with scheduling and load balancing courses, but also in the context of advanced programming models.
Linear systems
Triangular factorizations (Cholesky, LU, ...)
Solving triangular systems
Using orthogonal bases (QR)
Singular/own value decomposition
Introduction to tensors
Teaching hours
- CIIntegrated courses14,66h
- TDTutorial2,67h
Mandatory prerequisites
Notion of numerical algorithms
Further information
Dense linear algebra: parallel and distributed algorithms.
Assessment of knowledge
Initial assessment / Main session - Tests
| Type of assessment | Type of test | Duration (in minutes) | Number of tests | Test coefficient | Eliminatory mark in the test | Remarks |
|---|---|---|---|---|---|---|
| Final inspection | Article Reading | Reading of an article with a report in the form of a presentation to the whole class. |