Orthogonal Diagonalization - Linear Algebra
- If and (rows), what is ?
- (rows). It equals with .
- Why can be replaced by in an orthogonal diagonalization ?
- The columns of are orthonormal, so .
- Which unit eigenvector with positive entries of (rows) belongs to eigenvalue ?
- . has null space spanned by .
- A symmetric matrix has eigenvalues . How many orthonormal eigenvectors for go into ?
- . For a symmetric matrix the eigenspace dimension equals the multiplicity of the eigenvalue.
- Which unit eigenvector with positive entries of (rows) belongs to eigenvalue ?
- . , then normalize.
- How does orthogonal diagonalization differ from ordinary diagonalization ?
- The columns of must be orthonormal eigenvectors, so is orthogonal and .
- When orthogonally diagonalizing a symmetric matrix, what extra step is needed for an eigenspace of dimension 2 or more?
- Apply Gram-Schmidt within that eigenspace to get an orthonormal basis of it, then use those vectors as columns of .
- What are the eigenvalues placed in when orthogonally diagonalizing (rows)?
- and . The trace is and the determinant is .
- With eigenvalues in decreasing order, what is in an orthogonal diagonalization of (rows)?
- (rows). The eigenvalues are , with eigenvectors along and .
- Why must the eigenvector columns of be unit vectors in ?
- With orthogonal but non-unit columns, is diagonal but not , so would not be .
- What are and in an orthogonal diagonalization of the diagonal matrix (rows)?
- and . A diagonal matrix is already diagonalized by the standard basis.
- What does it mean for a square matrix to be orthogonally diagonalizable?
- for some orthogonal matrix (so ) and diagonal matrix .