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

Lecture

Diagonalisation of Symmetric Matrix by Orthogonal Matrix

Description

This lecture covers the method of diagonalizing a symmetric matrix using an orthogonal matrix. Starting with finding the characteristic polynomial, it proceeds to finding distinct roots, constructing orthogonal bases, and using Gram-Schmidt process to obtain an orthonormal basis. The lecture concludes with the transformation matrix that diagonalizes the symmetric matrix.

In MOOC

Linear Algebra (Part 3)

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (28)

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.

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 .

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.

Skew-symmetric matrix

In mathematics, particularly in linear algebra, a skew-symmetric (or antisymmetric or antimetric) matrix is a square matrix whose transpose equals its negative. That is, it satisfies the condition In terms of the entries of the matrix, if denotes the entry in the -th row and -th column, then the skew-symmetric condition is equivalent to The matrix is skew-symmetric because Throughout, we assume that all matrix entries belong to a field whose characteristic is not equal to 2.

Toeplitz matrix

In linear algebra, a Toeplitz matrix or diagonal-constant matrix, named after Otto Toeplitz, is a matrix in which each descending diagonal from left to right is constant. For instance, the following matrix is a Toeplitz matrix: Any matrix of the form is a Toeplitz matrix. If the element of is denoted then we have A Toeplitz matrix is not necessarily square. A matrix equation of the form is called a Toeplitz system if is a Toeplitz matrix. If is an Toeplitz matrix, then the system has at-most only unique values, rather than .

Related lectures (44)

Symmetric Matrices and Orthogonal Matrices MOOC: Linear Algebra (Part 3)

Covers the properties of symmetric matrices, orthogonal matrices, and eigenvalues.

Orthogonal Base Change MOOC: Linear Algebra (Part 3)

Explores orthogonal base change in linear algebra, focusing on matrices and transformations.

Spectral Theorem Recap

Revisits the spectral theorem for symmetric matrices, emphasizing orthogonally diagonalizable properties and its equivalence with symmetric bilinear forms.

Convergence Rate Theorem: Part 1

Delves into the proof of the convergence rate theorem for an ergodic Markov chain, emphasizing eigenvalues and detailed balance properties.

Orthogonal Matrices: Properties and Applications