Search for a tool
Matrix Diagonalization

Tool to diagonalize a matrix. The diagonalization of a matrix consists of writing it in a base where its elements outside the diagonal are null. This transform was used in linear algebra so that it allow performing easier calculations.

Results

Matrix Diagonalization -

Tag(s) : Matrix

Share
Share
dCode and more

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!


Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!


Thanks to your feedback and relevant comments, dCode has developed the best 'Matrix Diagonalization' tool, so feel free to write! Thank you!

Matrix Diagonalization

Sponsored ads

Matrix Diagonalization


Loading...
(if this message do not disappear, try to refresh this page)

Answers to Questions (FAQ)

What is a diagonal matrix? (Definition)

A diagonal matrix is a matrix whose elements out of the trace (the main diagonal) are all null (zeros).

Example: $$ \begin{bmatrix} 1 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 3 \end{bmatrix} $$

What is a diagonalizable matrix? (Definition)

A matrix is diagonalizable if there exists an invertible matrix $ P $ and a diagonal matrix $ D $ such that $ M = PDP^{-1} $

How to diagonalize a matrix?

To diagonalize a matrix, a diagonalisation method consists in calculating its eigenvectors and its eigenvalues.

Example: The matrix $$ M = \begin{bmatrix} 1 & 2 \\ 2 & 1 \end{bmatrix} $$ has for eigenvalues $ 3 $ and $ -1 $ and eigenvectors respectively $ \begin{pmatrix} 1 \\ 1 \end{pmatrix} $ and $ \begin{pmatrix} -1 \\ 1 \end{pmatrix} $

The diagonal matrix $ D $ is composed of eigenvalues.

Example: $$ D = \begin{bmatrix} 3 & 0 \\ 0 & -1 \end{bmatrix} $$

The invertable matrix $ P $ is composed of the eigenvectors respectively in the same order of the columns than its associated eigenvalues.

P must be a normalized matrix.

Example: $$ P = \begin{bmatrix} 1 & -1 \\ 1 & 1 \end{bmatrix} $$ Normalization of P: $$ P = \frac{1}{\sqrt{2}} \begin{bmatrix} 1 & -1 \\ 1 & 1 \end{bmatrix} $$

How to prove that a matrix is not diagonalizable?

A matrix is not diagonalizable if it does not have as many dimensions as distinct eigenvectors.

Example: The matrix of dimension 2: $$ M = \begin{bmatrix} 5 & 1 \\ 0 & 5 \end{bmatrix} $$ has a double eigenvalue: $ 5 $ and therefore a single eigenvector $ \begin{pmatrix} 1 \\ 0 \end{pmatrix} $ so it is not diagonalizable.

Example: A 3x3 matrix with a triple eigenvalue therefore a single eigenvector is not diagonalizable.

How to check a diagonalized matrix calculation?

Calculate the inverse of the matrix $ P $

Diagonalization should give $ PDP^{-1} = M $

Source code

dCode retains ownership of the online 'Matrix Diagonalization' tool source code. Except explicit open source licence (indicated CC / Creative Commons / free), any 'Matrix Diagonalization' algorithm, applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any 'Matrix Diagonalization' function (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and no data download, script, copy-paste, or API access for 'Matrix Diagonalization' will be for free, same for offline use on PC, tablet, iPhone or Android ! dCode is free and online.

Need Help ?

Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!

Questions / Comments

Thanks to your feedback and relevant comments, dCode has developed the best 'Matrix Diagonalization' tool, so feel free to write! Thank you!


Source : https://www.dcode.fr/matrix-diagonalization
© 2021 dCode — The ultimate 'toolkit' to solve every games / riddles / geocaching / CTF.
Feedback