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

Lecture

Matrix Computations: Eigenvalues and Eigenvectors

Description

This lecture covers the complexity of matrix computations, focusing on eigenvalues and eigenvectors of symmetric matrices. It discusses algorithms like QR and tridiagonal reduction, emphasizing backward error analysis and the impact of near-multiplicity on accuracy. The instructor explores the challenges in computing eigenvectors, including polytime algorithms, precision issues, and the worst-case complexity of computing all eigenvectors.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Analysis: Numerical analysis

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.

Eigenvalue algorithm

In numerical analysis, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Eigenvalues and eigenvectors and Generalized eigenvector Given an n × n square matrix A of real or complex numbers, an eigenvalue λ and its associated generalized eigenvector v are a pair obeying the relation where v is a nonzero n × 1 column vector, I is the n × n identity matrix, k is a positive integer, and both λ and v are allowed to be complex even when A is real.

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

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.

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.

Related lectures (45)

Matrix Computations: Eigenvalues and Eigenvectors

Delves into the complexity of matrix computations, focusing on eigenvalues and eigenvectors, algorithms, errors, and numerical stability.

Calcul de valeurs propres

Covers the calculation of eigenvalues and eigenvectors, emphasizing their significance and applications.

Eigenvalues and Optimization: Numerical Analysis Techniques

Discusses eigenvalues, their calculation methods, and their applications in optimization and numerical analysis.

Diagonalization of Linear Transformations

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

Eigenvalues and Eigenvectors of Markov Chains