# Difference between revisions of "How do you actually find the Jordan canonical form of a matrix?"

Line 1: | Line 1: | ||

Computing the matrix exponential | Computing the matrix exponential exp^(At) is easy if A is already in diagonal form (i.e., all elements not on the diagonal are zero). The nxn matrix A can be transformed to a similar diagonal nxn matrix D if and only if A has n linearly independent eigenvectors. This is of great consequence because it simplifies the work required to solve a system of linear ODEs or when using the convolution integral. | ||

If the nxn matrix A does not have n linearly independent eigenvectors, it cannot be represented by a similar diagonal matrix. A similar matrix has the same eigenvalues and eigenvectors as A. We then try to find what are called "generalized eigenvectors" until we have a total of n eigenvectors. Then we can transform matrix A to its Jordan form J = | If the nxn matrix A does not have n linearly independent eigenvectors, it cannot be represented by a similar diagonal matrix. A similar matrix has the same eigenvalues and eigenvectors as A. We then try to find what are called "generalized eigenvectors" until we have a total of n eigenvectors. Then we can transform matrix A to its Jordan form J = inv(P)*A*P, where P is an invertible nxn matrix with the n eigenvectors (including the generalized eigenvectors) as columns. | ||

If A does not have n linearly independent eigenvectors, then J will not be diagonal, but will be in a block-diagonal form that separates the different "normal modes" of the system into Jordan blocks. To find the matrix exponential of J, one finds the matrix exponential of each Jordan block separately. | If A does not have n linearly independent eigenvectors, then J will not be diagonal, but will be in a block-diagonal form that separates the different "normal modes" of the system into Jordan blocks. To find the matrix exponential of J, one finds the matrix exponential of each Jordan block separately. | ||

Line 8: | Line 8: | ||

http://www.maths.surrey.ac.uk/explore/emmaspages/option3.html | http://www.maths.surrey.ac.uk/explore/emmaspages/option3.html | ||

or consult the book by Perko titled "Differential Equations and Dynamical Systems" | or consult the book by Perko titled "Differential Equations and Dynamical Systems". | ||

--[[User:Soto|Luis Soto]] 18:51, 15 October 2008 (PDT) | --[[User:Soto|Luis Soto]] 18:51, 15 October 2008 (PDT) | ||

[[Category: CDS 101/110 FAQ - Lecture 3-1]] | [[Category: CDS 101/110 FAQ - Lecture 3-1]] | ||

[[Category: CDS 101/110 FAQ - Lecture 3-1, Fall 2008]] | [[Category: CDS 101/110 FAQ - Lecture 3-1, Fall 2008]] |

## Revision as of 01:56, 16 October 2008

Computing the matrix exponential exp^(At) is easy if A is already in diagonal form (i.e., all elements not on the diagonal are zero). The nxn matrix A can be transformed to a similar diagonal nxn matrix D if and only if A has n linearly independent eigenvectors. This is of great consequence because it simplifies the work required to solve a system of linear ODEs or when using the convolution integral.

If the nxn matrix A does not have n linearly independent eigenvectors, it cannot be represented by a similar diagonal matrix. A similar matrix has the same eigenvalues and eigenvectors as A. We then try to find what are called "generalized eigenvectors" until we have a total of n eigenvectors. Then we can transform matrix A to its Jordan form J = inv(P)*A*P, where P is an invertible nxn matrix with the n eigenvectors (including the generalized eigenvectors) as columns.

If A does not have n linearly independent eigenvectors, then J will not be diagonal, but will be in a block-diagonal form that separates the different "normal modes" of the system into Jordan blocks. To find the matrix exponential of J, one finds the matrix exponential of each Jordan block separately.

For definitions and simple examples you can go to http://www.maths.surrey.ac.uk/explore/emmaspages/option3.html

or consult the book by Perko titled "Differential Equations and Dynamical Systems". --Luis Soto 18:51, 15 October 2008 (PDT)