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

Lecture

Jordan Form: Diagonalization and Nilpotent Matrices

In course

MATH-115(b): Advanced linear algebra II

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et de démontrer rigoureusement les résultats principaux du sujet. ...

Description

This lecture covers the concept of Jordan form, focusing on diagonalization and nilpotent matrices. The instructor explains the decomposition of matrices, the properties of nilpotent matrices, and the Jordan normal form. The lecture also discusses the number of Jordan blocks for each eigenvalue and their sizes.

Instructor

Marc Troyanov

Doctorat en mathématiques à l'Université de Genève (1987) - Postdoc à Paris et Salt-Lake City, puis professeur assistant à l'UQAM (Montréal). Venu en 1993 à l'EPFL comme professeur assistant, nommé MER en 1999 puis professeur titulaire en 2005. Domaine de recherche : géométrie différentielle, analyse sur les variétés et sur les espaces métriques.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (24)

Diagonalizable matrix

In linear algebra, a square matrix is called diagonalizable or non-defective if it is similar to a diagonal matrix, i.e., if there exists an invertible matrix and a diagonal matrix such that , or equivalently . (Such , are not unique.) For a finite-dimensional vector space , a linear map is called diagonalizable if there exists an ordered basis of consisting of eigenvectors of .

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.

QR decomposition

In linear algebra, a QR decomposition, also known as a QR factorization or QU factorization, is a decomposition of a matrix A into a product A = QR of an orthonormal matrix Q and an upper triangular matrix R. QR decomposition is often used to solve the linear least squares problem and is the basis for a particular eigenvalue algorithm, the QR algorithm. Any real square matrix A may be decomposed as where Q is an orthogonal matrix (its columns are orthogonal unit vectors meaning ) and R is an upper triangular matrix (also called right triangular matrix).

LU decomposition

In numerical analysis and linear algebra, lower–upper (LU) decomposition or factorization factors a matrix as the product of a lower triangular matrix and an upper triangular matrix (see matrix decomposition). The product sometimes includes a permutation matrix as well. LU decomposition can be viewed as the matrix form of Gaussian elimination. Computers usually solve square systems of linear equations using LU decomposition, and it is also a key step when inverting a matrix or computing the determinant of a matrix.

Cholesky decomposition

In linear algebra, the Cholesky decomposition or Cholesky factorization (pronounced ʃəˈlɛski ) is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for efficient numerical solutions, e.g., Monte Carlo simulations. It was discovered by André-Louis Cholesky for real matrices, and posthumously published in 1924. When it is applicable, the Cholesky decomposition is roughly twice as efficient as the LU decomposition for solving systems of linear equations.

Related lectures (40)

Jordan Form: Decomposition and Properties

Covers the decomposition of a matrix into Jordan blocks and the process of finding the Jordan form.

Diagonalization by Blocks

Introduces diagonalization by blocks and stable subspaces under linear transformations with examples and proofs.

SVD: Singular Value Decomposition

Covers the concept of Singular Value Decomposition (SVD) for compressing information in matrices and images.

Diagonalization of Linear Maps

Explores the diagonalization of linear maps by finding a basis formed by eigenvectors.

Diagonalization: Examples MOOC: Linear Algebra (Part 2)