(1.7 hours to learn)
The spectral decomposition is the decomposition of a symmetric matrix A into QDQ^T, where Q is an orthogonal matrix and D is a diagonal matrix. The columns of Q correspond to the eigenvectors of A, and the diagonal entries of D correspond to the eigenvalues. This is possible because of a surprising fact about symmetric matrices: they have a full set of orthogonal eigenvectors. This decomposition gives a useful way to think about symmetric matrices: they are like diagonal matrices in a rotated coordinate system.
This concept has the prerequisites:
Core resources (read/watch one of the following)
→ MIT Open Courseware: Linear Algebra (2011)
Videos for an introductory linear algebra course focusing on numerical methods.
→ Introduction to Linear Algebra
An introductory linear algebra textbook with an emphasis on numerical methods.
Location: Section 6.4, "Symmetric matrices," pages 330-335
→ Multivariable Mathematics
A textbook on linear algebra and multivariable calculus with proofs.
Location: Section 9.4, "The Spectral Theorem," pages 455-463
- Lagrange multipliers
- The spectral decomposition is an example of diagonalization .
- The spectral decomposition can also be characterized as:can be generalized to complex analogues of symmetric matrices, called [Hermitian matrices](hermitian_matrices)
- A symmetric matrix is positive definite if its eigenvalues are positive
- create concept: shift + click on graph
- change concept title: shift + click on existing concept
- link together concepts: shift + click drag from one concept to another
- remove concept from graph: click on concept then press delete/backspace
- add associated content to concept: click the small circle that appears on the node when hovering over it
- other actions: use the icons in the upper right corner to optimize the graph placement, preview the graph, or download a json representation