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

Lecture

Untitled

Official source

https://switch-video-production.os.zhdk.cloud.switch.ch/transcoding/36/6b/5cb4351c1ee0eb31a1b7e75441e5/h264-1080p.mp4?X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=c70ce910fb73491f9933421af7a4fcee%2F20240725%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Date=20240725T143309Z&X-Amz-Expires=86400&X-Amz-SignedHeaders=host&X-Amz-Signature=3ee38c89fac7b23658d001fc37464b9ebe807b08485c6b809729cdf511fe8c60

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (28)

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 .

Nilpotent matrix

In linear algebra, a nilpotent matrix is a square matrix N such that for some positive integer . The smallest such is called the index of , sometimes the degree of . More generally, a nilpotent transformation is a linear transformation of a vector space such that for some positive integer (and thus, for all ). Both of these concepts are special cases of a more general concept of nilpotence that applies to elements of rings. The matrix is nilpotent with index 2, since .

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.

Linear algebra

Linear algebra is the branch of mathematics concerning linear equations such as: linear maps such as: and their representations in vector spaces and through matrices. Linear algebra is central to almost all areas of mathematics. For instance, linear algebra is fundamental in modern presentations of geometry, including for defining basic objects such as lines, planes and rotations. Also, functional analysis, a branch of mathematical analysis, may be viewed as the application of linear algebra to spaces of functions.

Matrix similarity

In linear algebra, two n-by-n matrices A and B are called similar if there exists an invertible n-by-n matrix P such that Similar matrices represent the same linear map under two (possibly) different bases, with P being the change of basis matrix. A transformation A ↦ P−1AP is called a similarity transformation or conjugation of the matrix A. In the general linear group, similarity is therefore the same as conjugacy, and similar matrices are also called conjugate; however, in a given subgroup H of the general linear group, the notion of conjugacy may be more restrictive than similarity, since it requires that P be chosen to lie in H.

Related lectures (27)

Diagonalization of Linear Transformations

Covers the diagonalization of linear transformations in R^3, exploring properties and examples.

Diagonalization of Linear Transformations

Explains the diagonalization of linear transformations using eigenvectors and eigenvalues to form a diagonal matrix.

Linear Algebra: Reduction of Linear Application

Covers the reduction of a linear application and finding corresponding reduced forms and bases.

Matrix Reduction: Part 1

Covers the reduction of a linear transformation in a 2-dimensional space to find a simpler matrix representation.

Diagonalization of Linear Maps