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

Lecture

Linear Systems: Diagonalization and Solutions

Description

This lecture covers the diagonalization of matrices, particularly when dealing with complex eigenvalues. The process involves transforming the matrix to a simpler form using eigenvectors. By applying the change of basis matrix, the instructor demonstrates how to find real solutions to the system of linear equations. The lecture concludes with a focus on eliminating the imaginary part of the solutions to obtain real-valued expressions.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (26)

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

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 .

Generalized eigenvector

In linear algebra, a generalized eigenvector of an matrix is a vector which satisfies certain criteria which are more relaxed than those for an (ordinary) eigenvector. Let be an -dimensional vector space and let be the matrix representation of a linear map from to with respect to some ordered basis. There may not always exist a full set of linearly independent eigenvectors of that form a complete basis for . That is, the matrix may not be diagonalizable.

Change of basis

In mathematics, an ordered basis of a vector space of finite dimension n allows representing uniquely any element of the vector space by a coordinate vector, which is a sequence of n scalars called coordinates. If two different bases are considered, the coordinate vector that represents a vector v on one basis is, in general, different from the coordinate vector that represents v on the other basis. A change of basis consists of converting every assertion expressed in terms of coordinates relative to one basis into an assertion expressed in terms of coordinates relative to the other basis.

Related lectures (36)

Diagonalization in 3D Linear Algebra

Explores diagonalization in 3D linear algebra, covering conditions for diagonalizability and eigenvectors.

Diagonalization of Linear Maps

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

Diagonalization of Linear Transformations

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

Linear Algebra: Eigenvalues and Eigenvectors

Explores eigenvalues, eigenvectors, diagonalization, and spectral theorem in linear algebra.

Diagonalization: Examples MOOC: Linear Algebra (Part 2)