The singular values are non-negative real numbers, usually listed in decreasing order (σ1(T), σ2(T), …). The largest singular value σ1(T) is equal to the operator norm of T (see Min-max theorem).
If T acts on Euclidean space , there is a simple geometric interpretation for the singular values: Consider the image by of the unit sphere; this is an ellipsoid, and the lengths of its semi-axes are the singular values of (the figure provides an example in ).
The singular values are the absolute values of the eigenvalues of a normal matrixA, because the spectral theorem can be applied to obtain unitary diagonalization of as . Therefore, .
Most norms on Hilbert space operators studied are defined using singular values. For example, the Ky Fan-k-norm is the sum of first k singular values, the trace norm is the sum of all singular values, and the Schatten norm is the pth root of the sum of the pth powers of the singular values. Note that each norm is defined only on a special class of operators, hence singular values can be useful in classifying different operators.
In the finite-dimensional case, a matrix can always be decomposed in the form , where and are unitary matrices and is a rectangular diagonal matrix with the singular values lying on the diagonal. This is the singular value decomposition.
Basic properties
For , and .
Min-max theorem for singular values. Here is a subspace of of dimension .
Matrix transpose and conjugate do not alter singular values.
For any unitary
Relation to eigenvalues:
Relation to trace:
.
If has full rank, the product of singular values is .
If has full rank, the product of singular values is .
If is square and has full rank, the product of singular values is .
If is normal, then , that is, its singular values are the absolute values of its eigenvalues.
For a generic rectangular matrix , let be its augmented matrix. It has eigenvalues (where are the singular values of ) and the remaining eigenvalues are zero. Let be the singular value decomposition, then the eigenvectors of are for : 52
The smallest singular value
The smallest singular value of a matrix A is σn(A). It has the following properties for a non-singular matrix A:
The 2-norm of the inverse matrix A−1 equals the inverse σn−1(A).: Thm.3.3
The absolute values of all elements in the inverse matrix A−1 are at most the inverse σn−1(A).: Thm.3.3
Intuitively, if σn(A) is small, then the rows of A are "almost" linearly dependent. If it is σn(A) = 0, then the rows of A are linearly dependent and A is not invertible.
Inequalities about singular values
See also.
Singular values of sub-matrices
For
Let denote with one of its rows or columns deleted. Then
Let denote with two of its rows and columns deleted. Then
Let denote an submatrix of . Then
Singular values of A + B
For
Singular values of AB
For
For
Singular values and eigenvalues
For .
See
Assume . Then for :
Weyl's theorem
For .
History
This concept was introduced by Erhard Schmidt in 1907. Schmidt called singular values "eigenvalues" at that time. The name "singular value" was first quoted by Smithies in 1937. In 1957, Allahverdiev proved the following characterization of the nth singular number:
This formulation made it possible to extend the notion of singular values to operators in Banach space. Note that there is a more general concept of s-numbers, which also includes Gelfand and Kolmogorov width.
Cauchy interlacing theorem or Poincaré separation theorem
Schur–Horn theorem
Singular value decomposition
wikipedia, wiki, encyclopedia, book, library, article, read, free download, Information about Singular value, What is Singular value? What does Singular value mean?