Top Qs
Timeline
Chat
Perspective

Orthogonal diagonalization

Method in linear algebra From Wikipedia, the free encyclopedia

Remove ads
Remove ads

In linear algebra, an orthogonal diagonalization of a normal matrix (e.g. a symmetric matrix) is a diagonalization by means of an orthogonal change of coordinates.[1]

The following is an orthogonal diagonalization algorithm that diagonalizes a quadratic form q(x) on n by means of an orthogonal change of coordinates X = PY.[2]

  • Step 1: find the symmetric matrix A which represents q and find its characteristic polynomial
  • Step 2: find the eigenvalues of A which are the roots of .
  • Step 3: for each eigenvalue of A from step 2, find an orthogonal basis of its eigenspace.
  • Step 4: normalize all eigenvectors in step 3 which then form an orthonormal basis of n.
  • Step 5: let P be the matrix whose columns are the normalized eigenvectors in step 4.

Then X = PY is the required orthogonal change of coordinates, and the diagonal entries of will be the eigenvalues which correspond to the columns of P.

Remove ads

References

Loading content...
Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.

Remove ads