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

Lecture

Singular Value Decomposition

Description

This lecture covers the singular value decomposition theorem for a matrix A of rank r, where Σ is a diagonal matrix with non-zero singular values of A, and U, V are orthogonal matrices such that A = UV. The lecture explains the proof by constructing orthonormal bases, normalizing them, and completing them to form an orthonormal basis. The process involves transforming bases, normalizing vectors, and decomposing A into UΣV. The lecture concludes with the matrix representation of the decomposition.

In MOOC

Linear Algebra (Part 3)

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (27)

Singular value decomposition

In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix. It generalizes the eigendecomposition of a square normal matrix with an orthonormal eigenbasis to any matrix. It is related to the polar decomposition. Specifically, the singular value decomposition of an complex matrix M is a factorization of the form where U is an complex unitary matrix, is an rectangular diagonal matrix with non-negative real numbers on the diagonal, V is an complex unitary matrix, and is the conjugate transpose of V.

Matrix decomposition

In the mathematical discipline of linear algebra, a matrix decomposition or matrix factorization is a factorization of a matrix into a product of matrices. There are many different matrix decompositions; each finds use among a particular class of problems. In numerical analysis, different decompositions are used to implement efficient matrix algorithms. For instance, when solving a system of linear equations , the matrix A can be decomposed via the LU decomposition.

Polar decomposition

In mathematics, the polar decomposition of a square real or complex matrix is a factorization of the form , where is a unitary matrix and is a positive semi-definite Hermitian matrix ( is an orthogonal matrix and is a positive semi-definite symmetric matrix in the real case), both square and of the same size. Intuitively, if a real matrix is interpreted as a linear transformation of -dimensional space , the polar decomposition separates it into a rotation or reflection of , and a scaling of the space along a set of orthogonal axes.

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.

Related lectures (46)

SVD: Singular Value Decomposition

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

Singular Value Decomposition: Example MOOC: Linear Algebra (Part 3)

Explains the step-by-step process of finding the singular value decomposition of a matrix.

Singular Value Decomposition

Explores Singular Value Decomposition, low-rank approximation, fundamental subspaces, and matrix norms.

QR Factorization: Orthogonal Bases MOOC: Linear Algebra (Part 3)

Covers the QR factorization of a matrix A into Q and R.

Singular Value Decomposition

Explores Singular Value Decomposition and its role in unsupervised learning and dimensionality reduction, emphasizing its properties and applications.

Related concepts (27)

Singular value decomposition