Similarity Transformation and Matrix Diagonalization (original) (raw)

By Kardi Teknomo, PhD .
LinearAlgebra

< Next | Previous | Index >

A square matrix Similarity Transformation and Matrix Diagonalization is similar to a square matrixSimilarity Transformation and Matrix Diagonalization if there is a non-singular matrix such thatSimilarity Transformation and Matrix Diagonalization . Let us call matrixSimilarity Transformation and Matrix Diagonalization as a modal matrix.

Similarity transformation has several properties:

Since diagonal matrix has many nice properties similar to a scalar, we would like to find matrix similarity to a diagonal matrix. The only requirement to perform similarity transformation is to find a non singular modal matrixSimilarity Transformation and Matrix Diagonalization such thatSimilarity Transformation and Matrix Diagonalization . We can form modal matrixSimilarity Transformation and Matrix Diagonalization from the eigenvector of matrixSimilarity Transformation and Matrix Diagonalization . However, we are not sure if the modal matrixSimilarity Transformation and Matrix Diagonalization is nonsingular (has inverse).

We know that modal matrixSimilarity Transformation and Matrix Diagonalization is nonsingular when the eigenvectors of the square matrixSimilarity Transformation and Matrix Diagonalization are being linearly independent . But, again we are not sure whether the eigenvectors of the square matrixSimilarity Transformation and Matrix Diagonalization will be linearly independent. We only know that if all the eigenvalues of the square matrixSimilarity Transformation and Matrix Diagonalization are distinct (do not have any eigenvalue of multiple values) then the eigenvectors are linearly independent. Thus, any square matrix with distinct eigenvalues can be converted into diagonal matrix by similarity transformationSimilarity Transformation and Matrix Diagonalization .

To obtain modal matrixSimilarity Transformation and Matrix Diagonalization , we perform horizontal concatenation of theSimilarity Transformation and Matrix Diagonalization linearly independent eigenvectors of matrixSimilarity Transformation and Matrix Diagonalization such thatSimilarity Transformation and Matrix Diagonalization . Since eigenvalues of matrixSimilarity Transformation and Matrix Diagonalization are all distinct, modal matrixSimilarity Transformation and Matrix Diagonalization has full rank because the eigenvectors are linearly independent, therefore modal matrixSimilarity Transformation and Matrix Diagonalization has inverse (nonsingular). The diagonal elements of diagonal matrixSimilarity Transformation and Matrix Diagonalization consist of the eigenvalues ofSimilarity Transformation and Matrix Diagonalization .

Example:

Example:
MatrixSimilarity Transformation and Matrix Diagonalization has eigenvaluesSimilarity Transformation and Matrix Diagonalization (with algebraic multiplicity of 2) andSimilarity Transformation and Matrix Diagonalization (simple). The first eigenvalueSimilarity Transformation and Matrix Diagonalization has corresponding eigenvectorSimilarity Transformation and Matrix Diagonalization andSimilarity Transformation and Matrix Diagonalization . The first eigenvalueSimilarity Transformation and Matrix Diagonalization has geometric multiplicity of 2 because the two eigenvectorsSimilarity Transformation and Matrix Diagonalization andSimilarity Transformation and Matrix Diagonalization are linearly independent. The second eigenvalueSimilarity Transformation and Matrix Diagonalization has corresponding eigenvectorSimilarity Transformation and Matrix Diagonalization . Since matrixSimilarity Transformation and Matrix Diagonalization has 3 linearly independent eigenvectors, matrixSimilarity Transformation and Matrix Diagonalization is non-defective. We can form modal matrixSimilarity Transformation and Matrix Diagonalization such thatSimilarity Transformation and Matrix Diagonalization . Notice in this example that the eigenvalues are not all distinct but the eigenvectors are linearly independent, therefore the matrix is diagonalizable.

Example:

MatrixNon-Diagonalizable has multiple eigenvalue ofNon-Diagonalizable . The eigenvectors associated with eigenvalues are vectors of the form ofNon-Diagonalizable forNon-Diagonalizable any non-zero real number. Since the eigenvectors are linearly dependent, the modal matrixNon-Diagonalizable has no inverse and therefore matrixNon-Diagonalizable is non-diagonalizable.

See also : Matrix Eigen Value & Eigen Vector , Matrix Power , Equal matrix

Rate this tutorial or give your comments about this tutorial

< Next | Previous | Index >

This tutorial is copyrighted .