Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Linear Systems: Operations and Solutions

In course

MATH-111(e): Linear Algebra

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications. ...

Description

This lecture focuses on linear systems of equations, discussing operations such as row operations and their impact on the solutions. The instructor demonstrates how to systematically transform a system into triangular and diagonal forms, leading to unique or parametrized solutions. Through examples, the lecture illustrates the process of solving systems with different numbers of equations and variables, emphasizing the importance of understanding the geometric interpretation of solutions. The concept of free and dependent variables is introduced, along with the notion of equivalent systems. The lecture concludes by exploring the intersection of planes in 3D space and the implications for system solutions.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

Nicolas Boumal

Jérôme Scherer

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

Diagonal matrix

In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal matrix is , while an example of a 3×3 diagonal matrix is. An identity matrix of any size, or any multiple of it (a scalar matrix), is a diagonal matrix. A diagonal matrix is sometimes called a scaling matrix, since matrix multiplication with it results in changing scale (size).

Diagonal

In geometry, a diagonal is a line segment joining two vertices of a polygon or polyhedron, when those vertices are not on the same edge. Informally, any sloping line is called diagonal. The word diagonal derives from the ancient Greek διαγώνιος diagonios, "from angle to angle" (from διά- dia-, "through", "across" and γωνία gonia, "angle", related to gony "knee"); it was used by both Strabo and Euclid to refer to a line connecting two vertices of a rhombus or cuboid, and later adopted into Latin as diagonus ("slanting line").

Row echelon form

In linear algebra, a matrix is in echelon form if it has the shape resulting from a Gaussian elimination. A matrix being in row echelon form means that Gaussian elimination has operated on the rows, and column echelon form means that Gaussian elimination has operated on the columns. In other words, a matrix is in column echelon form if its transpose is in row echelon form. Therefore, only row echelon forms are considered in the remainder of this article. The similar properties of column echelon form are easily deduced by transposing all the matrices.

Elementary matrix

In mathematics, an elementary matrix is a matrix which differs from the identity matrix by one single elementary row operation. The elementary matrices generate the general linear group GLn(F) when F is a field. Left multiplication (pre-multiplication) by an elementary matrix represents elementary row operations, while right multiplication (post-multiplication) represents elementary column operations. Elementary row operations are used in Gaussian elimination to reduce a matrix to row echelon form.

Jordan normal form

In linear algebra, a Jordan normal form, also known as a Jordan canonical form (JCF), is an upper triangular matrix of a particular form called a Jordan matrix representing a linear operator on a finite-dimensional vector space with respect to some basis. Such a matrix has each non-zero off-diagonal entry equal to 1, immediately above the main diagonal (on the superdiagonal), and with identical diagonal entries to the left and below them. Let V be a vector space over a field K.

Related lectures (44)

Matrix Invertibility MOOC: Linear Algebra (Part 2)

Explores matrix invertibility and unique solutions in linear systems through row operations.

Linear Systems Resolution MOOC: Warm-up for EPFL MOOC: Linear Algebra (Part 1)

Covers the resolution of linear systems using the Gauss method to determine unique, infinite, or no solutions.

Linear Systems: Chapters 4, 5, 6

Explores the link between linear systems and optimization through elimination and LU decomposition.

Linear Algebra: Diagonalization

Explores the diagonalization of matrices and the conditions for exact diagonalization, with examples demonstrating the process.

Singular Value Decomposition: Applications and Interpretation Log in to Mediaspace to watch this video