Lecture

Subspaces, Spectra, and Projections

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-341: Linear models

Regression modelling is a fundamental tool of statistics, because it describes how the law of a random variable of interest may depend on other variables. This course aims to familiarize students with linear models and some of their extensions, which lie a ...

Description

This lecture covers the concepts of subspaces, spectra, and projections in linear algebra. It explains the column space, null space, and orthogonal complement of a matrix, as well as the Spectral Theorem and Singular Value Decomposition. The properties of symmetric matrices, eigenvalues, eigenvectors, and orthogonal projections onto subspaces are discussed in detail.

Instructors (2)

Victor Panaretos

Curriculum vitae Background & EducationPublications & PreprintsHonours & AwardsEditorial ActivitiesInvited Talks & Seminars Teaching & PhD PhD Students Ulysse Naepels, Nikitas Georgakis, Ho Yun Past EPFL PhD Students Andrea Kraus, Shahin Tavakoli, Mikael Kuusela, Yoav Zemel, Marie-Hélène Descary, Valentina Masarotto, Tomas Rubin, Tomas Masák, Laya Ghodrati, Kartik Waghmare, Leonardo Santoro Past EPFL PhD Students as codirector Matthieu Simeoni, Ophelia Miralles, Sonia Alouini, Timmy Rong Tian Tse, Krali M

Tomas Masák

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

Eigenvalues and eigenvectors

In linear algebra, an eigenvector (ˈaɪgənˌvɛktər) or characteristic vector of a linear transformation is a nonzero vector that changes at most by a constant factor when that linear transformation is applied to it. The corresponding eigenvalue, often represented by , is the multiplying factor. Geometrically, a transformation matrix rotates, stretches, or shears the vectors it acts upon. The eigenvectors for a linear transformation matrix are the set of vectors that are only stretched, with no rotation or shear.

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

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.

Orthogonal complement

In the mathematical fields of linear algebra and functional analysis, the orthogonal complement of a subspace W of a vector space V equipped with a bilinear form B is the set W⊥ of all vectors in V that are orthogonal to every vector in W. Informally, it is called the perp, short for perpendicular complement. It is a subspace of V. Let be the vector space equipped with the usual dot product (thus making it an inner product space), and let with then its orthogonal complement can also be defined as being The fact that every column vector in is orthogonal to every column vector in can be checked by direct computation.

Projection (linear algebra)

In linear algebra and functional analysis, a projection is a linear transformation from a vector space to itself (an endomorphism) such that . That is, whenever is applied twice to any vector, it gives the same result as if it were applied once (i.e. is idempotent). It leaves its unchanged. This definition of "projection" formalizes and generalizes the idea of graphical projection. One can also consider the effect of a projection on a geometrical object by examining the effect of the projection on points in the object.

Related lectures (64)

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

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

Linear Algebra: Singular Value Decomposition

Delves into singular value decomposition and its applications in linear algebra.

Diagonalization of Symmetric Matrices

Covers the diagonalization of symmetric matrices and the spectral theorem.

Eigenvalues and Eigenvectors Decomposition

Covers the decomposition of a matrix into its eigenvalues and eigenvectors, the orthogonality of eigenvectors, and the normalization of vectors.

Symmetric Matrices, Eigenvalues, Eigenvectors, Spectral Theorem MOOC: Linear Algebra (Part 3)