Kardi Teknomo
Kardi Teknomo Kardi Teknomo Kardi Teknomo
   
 
  Research
  Publications
  Tutorials
  Resume
  Personal
  Contact

Matrix Size & Validation
Vector Algebra
What is Vector?
Vector Norm
Unit Vector
Vector Addition
Vector Subtraction
Vector Scalar Multiple
Vector Multiplication
Vector Inner Product
Vector Outer Product
Vector Cross Product
Vector Triple Cross Product
Vector Triple Dot Product
Scalar Triple Product
Orthogonal & Orthonormal Vector
Cos Angle of Vectors
Scalar and Vector Projection
Matrix Algebra
What is a matrix?
Special Matrices
Matrix One
Null Matrix
Matrix Diagonal Is Diagonal Matrix?
Identity Matrix
Matrix Determinant
Matrix Sum
Matrix Trace
Matrix Basic Operation
Is Equal Matrix?
Matrix Transpose
Matrix Addition
Matrix Subtraction
Matrix Multiplication
Matrix Scalar Multiple
Hadamard Product
Horizontal Concatenation
Vertical Concatenation
Elementary Row Operations
Matrix RREF
Finding inverse using RREF (Gauss-Jordan)
Finding Matrix Rank using RREF
Matrix Inverse
Is Singular Matrix?
Linear Transformation
Matrix Generalized Inverse
Solving System of Linear Equations
Linear combination, Span & Basis Vector
Linearly Dependent & Linearly Independent
Change of basis
Matrix Rank
Matrix Range
Matrix Nullity & Null Space
Eigen System
Matrix Eigen Value & Eigen Vector
Symmetric Matrix
Matrix Eigen Value & Eigen Vector for Symmetric Matrix
Similarity Transformation and Matrix Diagonalization
Matrix Power
Orthogonal Matrix
Spectral Decomposition
Singular Value Decomposition
Resources on Linear Algebra

Similarity Transformation and Matrix Diagonalization

By Kardi Teknomo, PhD.
LinearAlgebra

<Next | Previous | Index>

A square matrix Similarity Transformation and Matrix Diagonalizationis similar to a square matrix Similarity Transformation and Matrix Diagonalization if there is a non-singular matrix such thatSimilarity Transformation and Matrix Diagonalization.  Let us call matrix Similarity Transformation and Matrix Diagonalizationas 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 matrix Similarity Transformation and Matrix Diagonalizationsuch thatSimilarity Transformation and Matrix Diagonalization. We can form modal matrix Similarity Transformation and Matrix Diagonalizationfrom the eigenvector of matrixSimilarity Transformation and Matrix Diagonalization. However, we are not sure if the modal matrix Similarity Transformation and Matrix Diagonalizationis nonsingular (has inverse).

We know that modal matrix Similarity Transformation and Matrix Diagonalizationis nonsingular when the eigenvectors of the square matrix Similarity Transformation and Matrix Diagonalizationare being linearly independent. But, again we are not sure whether the eigenvectors of the square matrix Similarity Transformation and Matrix Diagonalizationwill be linearly independent. We only know that if all the eigenvalues of the square matrix Similarity Transformation and Matrix Diagonalizationare 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 matrix Similarity Transformation and Matrix Diagonalization, we perform horizontal concatenation of the Similarity Transformation and Matrix Diagonalizationlinearly independent eigenvectors of matrix Similarity Transformation and Matrix Diagonalizationsuch thatSimilarity Transformation and Matrix Diagonalization. Since eigenvalues of matrix Similarity Transformation and Matrix Diagonalizationare all distinct, modal matrix Similarity Transformation and Matrix Diagonalization has full rank because the eigenvectors are linearly independent, therefore modal matrix Similarity Transformation and Matrix Diagonalizationhas inverse (nonsingular). The diagonal elements of diagonal matrix Similarity Transformation and Matrix Diagonalizationconsist of the eigenvalues ofSimilarity Transformation and Matrix Diagonalization.

Example:

Find diagonal matrix of matrixSimilarity Transformation and Matrix Diagonalization
Solution: First, we find the eigenvector and eigenvalues of matrixSimilarity Transformation and Matrix Diagonalization. The matrix has 2 distinct eigenvalues. Eigenvalue Similarity Transformation and Matrix Diagonalizationhas corresponding eigenvectorSimilarity Transformation and Matrix Diagonalization and eigenvalue Similarity Transformation and Matrix Diagonalizationhas corresponding eigenvectorSimilarity Transformation and Matrix Diagonalization.  Since the eigenvalues are all distinct, the matrix is diagonalizable and the eigenvectors are linearly independent.
Next, we form modal matrixSimilarity Transformation and Matrix Diagonalization . The inverse modal matrix isSimilarity Transformation and Matrix Diagonalization.
Then, we obtain the diagonal matrixSimilarity Transformation and Matrix Diagonalization. Notice that the diagonal elements are the eigenvalues. Modal matrix Similarity Transformation and Matrix Diagonalizationis not orthogonal matrix becauseSimilarity Transformation and Matrix Diagonalization.

Example:
Matrix Similarity Transformation and Matrix Diagonalizationhas eigenvaluesSimilarity Transformation and Matrix Diagonalization(with algebraic multiplicity of 2) andSimilarity Transformation and Matrix Diagonalization(simple). The first eigenvalue Similarity Transformation and Matrix Diagonalizationhas corresponding eigenvector Similarity Transformation and Matrix Diagonalizationand Similarity Transformation and Matrix Diagonalization. The first eigenvalue Similarity Transformation and Matrix Diagonalizationhas geometric multiplicity of 2 because the two eigenvectors Similarity Transformation and Matrix Diagonalizationand Similarity Transformation and Matrix Diagonalizationare linearly independent. The second eigenvalue Similarity Transformation and Matrix Diagonalizationhas corresponding eigenvectorSimilarity Transformation and Matrix Diagonalization . Since matrix Similarity Transformation and Matrix Diagonalizationhas 3 linearly independent eigenvectors, matrix Similarity Transformation and Matrix Diagonalizationis non-defective. We can form modal matrix Similarity Transformation and Matrix Diagonalizationsuch 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:

Matrix Non-Diagonalizablehas multiple eigenvalue ofNon-Diagonalizable. The eigenvectors associated with eigenvalues are vectors of the form of Non-Diagonalizablefor Non-Diagonalizableany non-zero real number. Since the eigenvectors are linearly dependent, the modal matrix Non-Diagonalizablehas no inverse and therefore matrix Non-Diagonalizableis 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.

Preferable reference for this tutorial is

Teknomo, Kardi (2011) Linear Algebra tutorial. http:\\people.revoledu.com\kardi\ tutorial\LinearAlgebra\

 

 
© 2007 Kardi Teknomo. All Rights Reserved.
Designed by CNV Media