Difference between revisions of "Normal matrices"

From SklogWiki
Jump to: navigation, search
m (References)
(One intermediate revision by one other user not shown)
Line 13: Line 13:
*[http://en.wikipedia.org/wiki/Normal_matrix Normal_matrix entry in Wikipedia]
*[http://en.wikipedia.org/wiki/Normal_matrix Normal matrix entry in Wikipedia]
[[category: mathematics]]

Latest revision as of 12:19, 11 February 2008

A complex square matrix A is a normal matrix if

A^\dagger A=AA^\dagger ,

where A^\dagger is the conjugate transpose of A. That is, a matrix is normal if it commutes with its conjugate transpose: [A,A^\dagger]=0.

Normal matrices are precisely those to which the spectral theorem applies: a matrix A is normal if and only if it can be represented by a diagonal matrix \Lambda and a unitary matrix U by the formula

A = U \Lambda U^\dagger,


 \Lambda = \mathrm{diag} (\lambda_1, \lambda_2, \dots)
 U^\dagger U = U U^\dagger= I.

The entries \lambda_i of the diagonal matrix \Lambda are the eigenvalues of A, and the columns of U are the eigenvectors of A. The matching eigenvalues in \Lambda must be ordered as the eigenvectors are ordered as columns of U.