This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable. For guidance on developing this draft, see Wikipedia:So you made a userspace draft. Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
Singular Value Decomposition
The singular value decomposition (SVD) is one of the most powerful tools in theoretical and numerical linear algebra. The utility comes from three basic properties:
Every matrix has an SVD. The SVD provides an orthonormal resolution for the four invariant subspaces. The SVD provides an ordered list of singular values.
The Singular Value Decomposition Theorem
editExistence
editEvery matrix has a singular value decomposition. Given a matrix , that is, with rows, columns, and rank , the SVD can be written as
- ,
where
- resolves the column space,
- resolves the row space,
- contains the singular values.
The domain matrices are unitary:
Uniqueness
editThe singular values are unique, therefore the matrices and are unique. Typically the domain matrices are not unique. For example, there could be two different decompositions such that
References
edit- Golub, Gene H.; Van Loan, Charles F. (1996). Matrix Computations (3rd ed.). Johns Hopkins. ISBN 978-0-8018-5414-9.
- GSL Team (2007). "§14.4 Singular Value Decomposition". GNU Scientific Library. Reference Manual.
- Trefethen, Lloyd N.; Bau III, David (1997). Numerical linear algebra. Philadelphia: Society for Industrial and Applied Mathematics. ISBN 978-0-89871-361-9.
- Demmel, James; Kahan, William (1990). "Accurate singular values of bidiagonal matrices". Society for Industrial and Applied Mathematics. Journal on Scientific and Statistical Computing. 11 (5): 873–912. doi:10.1137/0911052.
External links
edit