Concept information
Preferred term
matrix diagonalization
Definition
- In linear algebra, a square matrix A is called diagonalizable or non-defective if it is similar to a diagonal matrix, i.e., if there exists an invertible matrix P and a diagonal matrix D such that P⁻¹ A P = D, or equivalently A = P D P⁻¹. (Such P P, D D are not unique.). For a finite-dimensional vector space V, a linear map T : V → V is called diagonalizable if there exists an ordered basis of V consisting of eigenvectors of T. These definitions are equivalent : if T has a matrix representation T = P D P⁻¹ as above, then the column vectors of P form a basis consisting of eigenvectors of T, and the diagonal entries of D are the corresponding eigenvalues of T; with respect to this eigenvector basis, A is represented by D. Diagonalization is the process of finding the above P and D. (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Diagonalizable_matrix)
Broader concept
In other languages
URI
http://data.loterre.fr/ark:/67375/MDL-L2JTZG8T-T
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}