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

Lecture

Spectral Decomposition of Symmetric Matrices

In course

MATH-111(f): 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 covers the spectral decomposition theorem and the process of diagonalizing symmetric matrices. It explains how to find eigenspaces, orthogonal basis change matrices, and the properties of symmetric matrices. The instructor demonstrates the spectral decomposition of symmetric matrices and the conditions for a matrix to be orthogonally diagonalizable. The lecture also includes examples and exercises related to orthogonal matrices and eigenvalues. Additionally, it discusses the uniqueness of spectral decomposition and the properties of symmetric matrices. The theoretical part involves proofs of various theorems and lemmas, while the practical part consists of exercises and questions to test understanding.

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

Instructor

Mikaël Cavallin

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

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 .

Orthogonal matrix

In linear algebra, an orthogonal matrix, or orthonormal matrix, is a real square matrix whose columns and rows are orthonormal vectors. One way to express this is where QT is the transpose of Q and I is the identity matrix. This leads to the equivalent characterization: a matrix Q is orthogonal if its transpose is equal to its inverse: where Q−1 is the inverse of Q. An orthogonal matrix Q is necessarily invertible (with inverse Q−1 = QT), unitary (Q−1 = Q∗), where Q∗ is the Hermitian adjoint (conjugate transpose) of Q, and therefore normal (Q∗Q = QQ∗) over the real numbers.

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).

Symmetric matrix

In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, Because equal matrices have equal dimensions, only square matrices can be symmetric. The entries of a symmetric matrix are symmetric with respect to the main diagonal. So if denotes the entry in the th row and th column then for all indices and Every square diagonal matrix is symmetric, since all off-diagonal elements are zero. Similarly in characteristic different from 2, each diagonal element of a skew-symmetric matrix must be zero, since each is its own negative.

Eigendecomposition of a matrix

In linear algebra, eigendecomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors. Only diagonalizable matrices can be factorized in this way. When the matrix being factorized is a normal or real symmetric matrix, the decomposition is called "spectral decomposition", derived from the spectral theorem. Eigenvalue, eigenvector and eigenspace A (nonzero) vector v of dimension N is an eigenvector of a square N × N matrix A if it satisfies a linear equation of the form for some scalar λ.

Related lectures (38)

Symmetric Matrices and Orthogonal Matrices MOOC: Linear Algebra (Part 3)

Covers the properties of symmetric matrices, orthogonal matrices, and eigenvalues.

Decomposition Spectral: Symmetric Matrices Log in to Mediaspace to watch this video

Covers the decomposition of symmetric matrices into eigenvalues and eigenvectors.

Symmetric Matrices: Diagonalization Log in to Mediaspace to watch this video

Explores symmetric matrices, their diagonalization, and properties like eigenvalues and eigenvectors.

Symmetric Matrices: Properties and Decomposition Log in to Mediaspace to watch this video

Covers examples of symmetric matrices and their properties, including eigenvectors and eigenvalues.

Diagonalization of Symmetric Matrices Log in to Mediaspace to watch this video