Return to Answer

Source Link

edited May 17, 2018 at 6:23

3.3k
14
17

The diagonalization of a matrix is only unique upto andup to an ordering of the eigenvalues. What is happininghappening here is that the Eigenvalues in dp and d.d are ordered differently. One easily verifies that

Simplify[SortBy[Diagonal[d.d], N] == SortBy[Diagonal[dp], N]]

Returns True.

The diagonalization of a matrix is only unique upto and ordering of the eigenvalues. What is happining here is that the Eigenvalues in dp and d.d are ordered differently. One easily verifies that

Simplify[SortBy[Diagonal[d.d], N] == SortBy[Diagonal[dp], N]]

Returns True.

The diagonalization of a matrix is only unique up to an ordering of the eigenvalues. What is happening here is that the Eigenvalues in dp and d.d are ordered differently. One easily verifies that

Simplify[SortBy[Diagonal[d.d], N] == SortBy[Diagonal[dp], N]]

Returns True.

Source Link

created May 16, 2018 at 11:10

TimRias

3.3k
14
17

The diagonalization of a matrix is only unique upto and ordering of the eigenvalues. What is happining here is that the Eigenvalues in dp and d.d are ordered differently. One easily verifies that

Simplify[SortBy[Diagonal[d.d], N] == SortBy[Diagonal[dp], N]]

Returns True.