q2K BHP
Black History Portal
THE BHP WIRE —
HIDDEN TRUTHS
What's New!
THE JOURNEY THROUGH TIME

Explore Black History

Explore the people, places, events, achievements, struggles and stories that shaped our journey.

✊🏾

Civil Rights

Movements, leaders, victories and the continuing fight for equality.

⚙️

Black Inventors

Innovation, patents, science, technology and world-changing contributions.

🏆

Sports

Pioneers, champions, Negro Leagues, records, activism and excellence.

♟️

People

Meet the people whose lives, choices and achievements shaped the journey.

📍

Places

Black towns, communities, institutions and places where history happened.

📜

Events

Moments that changed communities, movements, institutions and the nation.

Enter a person, place, event, or topic.
MY'STORY

The MOVE Fire

This is a personal recollection on the Move fire on May 13, 1985 Philadelphia police fired thousands of rounds at the MOVE house, city officials approved dropping an explosive device on the roof, the resulting fire was allowed to burn, 11 people—including five children—died, and 61 homes were destroyed. Philadelphia City Council later called it a “brutal attack carried out by the City of Philadelphia on its own citizens” and acknowledged that no individual faced criminal consequences for the bombing. One timeline correction worth preserving for the BHP record: the major previous MOVE-police confrontation was August 8, 1978, about seven years before the bombing, not a year or two earlier. Officer James Ramp was killed, other police and firefighters were wounded, nine MOVE members were later convicted, and television cameras recorded police beating Delbert Africa during his arrest. The 1985 MOVE Commission later specifically criticized city planners for failing to adequately use lessons from that 1978 confrontation. And that actually strengthens the point you’re making: 1985 did not happen without precedent or institutional memory. There had already been a deadly confrontation with MOVE, years of conflict, negotiations and police involvement before Osage Avenue.

MORE →
BLACK FACTS
The Truths They Never Taught You...

Shirley Chisholm — Unbought and Unbossed

In 1968 Shirley Chisholm became the first Black woman elected to the United States Congress. In 1972 she launched a campaign for the Democratic presidential nomination, breaking another political barrier.

MORE →
BHP gathered finds from its connected research sources. Showing the 4 strongest Black History matches.
← BACK TO RESULTS
Wikipedia

Singular value

In mathematics, in particular in functional analysis, the singular values of a compact operator acting between Hilbert spaces and ⁠⁠, are the square roots of the (necessarily non-negative) eigenvalues of the self-adjoint operator (where denotes the adjoint of ⁠⁠).

The singular values are non-negative real numbers, usually listed in decreasing order ⁠⁠. The largest singular value is equal to the operator norm of (see Min-max theorem).

Visualization of a singular value decomposition (SVD) of a 2-dimensional, real shearing matrix M. First, we see the unit disc in blue together with the two canonical unit vectors. We then see the action of M, which distorts the disc to an ellipse. The SVD decomposes M into three simple transformations: a rotation V*, a scaling Σ along the rotated coordinate axes, and a second rotation U. Moreover, Σ is a (square, in this example) diagonal matrix containing in its diagonal the singular values of M, which represent the lengths σ1 and σ2 of the semi-axes of the ellipse.

If acts on a Euclidean space (for example, ⁠⁠), 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 ⁠⁠).

If ⁠⁠ is a normal matrix, then its singular values are the absolute values of its eigenvalues. Indeed, in this case, the spectral theorem can be applied to obtain unitary diagonalization of as ⁠⁠. Then, by definition, ⁠⁠.

Most norms on Hilbert space operators studied are defined using singular values. For example, the Ky Fan ⁠⁠-norm is the sum of the first singular values, the trace norm is the sum of all singular values, and the Schatten norm is the ⁠⁠-th root of the sum of the ⁠⁠-th 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 its diagonal. This is the singular value decomposition.

Basic properties

[edit]

For and ⁠⁠:

Min-max theorem for singular values:
Here, is a subspace of ⁠⁠;

Matrix transpose and conjugate do not alter singular values:

⁠⁠.

For any unitary matrices and ⁠⁠,

⁠⁠.

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. ⁠⁠ eigenvalues of ⁠⁠ are (where the are the singular values of ⁠⁠), and the remaining eigenvalues of ⁠⁠ are zero. Let be the singular value decomposition of ⁠⁠; then the eigenvectors of for ⁠⁠ are ⁠⁠.[1]: 52 

The smallest singular value

[edit]

The smallest singular value of a matrix ⁠⁠ is ⁠⁠. For a non-singular matrix ⁠⁠, it has the following properties:

  • .[2]: Thm.3.3 
  • For all indices ⁠⁠, ⁠⁠ ⁠⁠.[2]: Thm.3.3 

Intuitively, if ⁠⁠ is small, then the rows of ⁠⁠ are "almost" linearly dependent. If it is ⁠⁠, then the rows of ⁠⁠ are linearly dependent and ⁠⁠ is not invertible.

Inequalities about singular values

[edit]

See also:[3]

Singular values of sub-matrices

[edit]

For ⁠⁠,

  1. Let denote with one of its rows or columns deleted. Then
  2. Let denote with two of its rows and columns deleted. Then
  3. Let denote an submatrix of . Then

Singular values of A + B

[edit]

For ⁠⁠,

Singular values of AB

[edit]

For ⁠⁠,

For ⁠⁠,[4]

Singular values and eigenvalues

[edit]

For ⁠⁠,

  1. See:[5].
  2. Assume . Then for ,
    1. Weyl's theorem:
    2. For ,

History

[edit]

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 ⁠⁠-th singular number:[6]

This formulation made it possible to extend the notion of singular values to operators in Banach spaces.

Note that there is a more general concept of s-numbers, which also includes Gelfand and Kolmogorov width.

See also

[edit]

References

[edit]
  1. ^ Tao, Terence (2012). Topics in random matrix theory. Graduate studies in mathematics. Providence, R.I.: American Mathematical Society. ISBN 978-0-8218-7430-1.
  2. ^ a b Demmel, James W. (January 1997). Applied Numerical Linear Algebra. Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611971446. ISBN 978-0-89871-389-3..
  3. ^ R. A. Horn and C. R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991. Chap. 3.
  4. ^ Eisenstat, S. C.; Ipsen, I. C. F. (1995). "Relative Perturbation Techniques for Singular Value Problems." SIAM Journal on Numerical Analysis. 32 (6): 1972–1988. doi:10.1137/0732088. p.1977
  5. ^ R. Bhatia. Matrix Analysis. Springer-Verlag, New York, 1997. Prop. III.5.1
  6. ^ I. C. Gohberg and M. G. Krein. Introduction to the Theory of Linear Non-selfadjoint Operators. American Mathematical Society, Providence, R.I., 1969. Translated from the Russian by A. Feinstein. Translations of Mathematical Monographs, Vol. 18.

Source: Wikipedia. Article content is retrieved live through the MediaWiki API.

Wikipedia

Singular value

In mathematics, in particular in functional analysis, the singular values of a compact operator T : X → Y {\displaystyle \,T\!:X\rightarrow Y} acting between Hilbert spaces X {\displaystyle X} and ⁠ Y {\displaystyle Y} ⁠, are the square roots of the (necessarily non-negative) eigenvalues of the self-adjoint operator T ∗ T {\displaystyle T^{*}T} (where T ∗ {\displaystyle T^{*}} denotes the adjoint of ⁠ T {\displaystyle T} ⁠). The singular values are non-negative real numbers, usually listed in decreasing order ⁠ ( σ 1 ( T ) ≥ σ 2 ( T ) ≥ … ) {\displaystyle {\big (}\sigma _{1}(T)\geq \sigma _{2}(T)\geq \dots {\big )}} ⁠. The largest singular value σ 1 ( T ) {\displaystyle \sigma _{1}(T)} is equal to the operator norm of T {\displaystyle T} (see Min-max theorem). If T {\displaystyle T} acts on a Euclidean space (for example, ⁠ R n {\displaystyle \mathbb {R} ^{n}} ⁠), there is a simple geometric interpretation for the singular values: Consider the image by T {\displaystyle T} of the unit sphere; this is an ellipsoid, and the lengths of its semi-axes are the singular values of T {\displaystyle T} (the figure provides an example in ⁠ R 2 {\displaystyle \mathbb {R} ^{2}} ⁠). If ⁠ A {\displaystyle A} ⁠ is a normal matrix, then its singular values are the absolute values of its eigenvalues. Indeed, in this case, the spectral theorem can be applied to obtain unitary diagonalization of A {\displaystyle A} as ⁠ A = U Λ U ∗ {\displaystyle A=U\varLambda \,U^{*}} ⁠. Then, by definition, ⁠ A ∗ A = U Λ ∗ Λ U ∗ = U | Λ | U ∗ {\displaystyle \textstyle {\sqrt {A^{*}A}}=U{\sqrt {\varLambda ^{*}\varLambda }}~U^{*}=U\,\vert \varLambda \vert ~U^{*}} ⁠. Most norms on Hilbert space operators studied are defined using singular values. For example, the Ky Fan ⁠ k {\displaystyle k} ⁠-norm is the sum of the first k {\displaystyle k} singular values, the trace norm is the sum of all singular values, and the Schatten norm is the ⁠ p {\displaystyle p} ⁠-th root of the sum of the ⁠ p {\displaystyle p} ⁠-th 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 ⁠ U Σ V ∗ {\displaystyle U\varSigma \,V^{*}} ⁠, where U {\displaystyle U} and V ∗ {\displaystyle V^{*}} are unitary matrices and Σ {\displaystyle \varSigma } is a rectangular diagonal matrix with the singular values lying on its diagonal. This is the singular value decomposition.

MORE →
Wikipedia

Singular value decomposition

In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix into a rotation, followed by a scaling, followed by another rotation. It generalizes the eigendecomposition of a square normal matrix with an orthonormal eigenbasis to any ⁠ m × n {\displaystyle m\times n} ⁠ matrix. It is related to the polar decomposition, and is a common means for implementing low-rank approximation for matrices. Specifically, the singular value decomposition of an m × n {\displaystyle m\times n} complex matrix ⁠ M {\displaystyle \mathbf {M} } ⁠ is a factorization of the form ⁠ M = U Σ V ∗ {\displaystyle \mathbf {M} =\mathbf {U} \mathbf {\Sigma } \mathbf {V} ^{*}} ⁠, where ⁠ U {\displaystyle \mathbf {U} } ⁠ is an ⁠ m × m {\displaystyle m\times m} ⁠ complex unitary matrix, Σ {\displaystyle \mathbf {\Sigma } } is an m × n {\displaystyle m\times n} rectangular diagonal matrix with non-negative real numbers on the diagonal, ⁠ V {\displaystyle \mathbf {V} } ⁠ is an n × n {\displaystyle n\times n} complex unitary matrix, and ⁠ V ∗ {\displaystyle \mathbf {V} ^{*}} ⁠ is the conjugate transpose of ⁠ V {\displaystyle \mathbf {V} } ⁠. Such decompositions always exist for any complex matrix. If ⁠ M {\displaystyle \mathbf {M} } ⁠ is real, then some ⁠ U {\displaystyle \mathbf {U} } ⁠ and ⁠ V {\displaystyle \mathbf {V} } ⁠ can be found which are real (orthogonal) matrices; a real-valued SVD is often denoted ⁠ U Σ V T {\displaystyle \mathbf {U} \mathbf {\Sigma } \mathbf {V} ^{\mathsf {T}}} ⁠, where ⁠ V T {\displaystyle \mathbf {V} ^{\mathsf {T}}} ⁠ is the transpose of ⁠ V {\displaystyle \mathbf {V} } ⁠. The diagonal entries σ i = Σ i , i {\displaystyle \sigma _{i}=\mathbf {\Sigma } _{i,i}} of Σ {\displaystyle \mathbf {\Sigma } } are uniquely determined by ⁠ M {\displaystyle \mathbf {M} } ⁠, up to reordering, and are known as the singular values of ⁠ M {\displaystyle \mathbf {M} } ⁠. Conventionally they are arranged in descending order (from largest to smallest), which uniquely determines ⁠ Σ {\displaystyle \mathbf {\Sigma } } ⁠. The number of non-zero singular values, allowing repetitions, is equal to ⁠ r {\displaystyle r} ⁠, the rank of ⁠ M {\displaystyle \mathbf {M} } ⁠. The columns of ⁠ U {\displaystyle \mathbf {U} } ⁠ and the columns of ⁠ V {\displaystyle \mathbf {V} } ⁠ are called left-singular vectors and right-singular vectors of ⁠ M {\displaystyle \mathbf {M} } ⁠, respectively. They form two orthonormal bases, ⁠ { u 1 , … , u m } {\displaystyle \{\mathbf {u} _{1},\ldots ,\mathbf {u} _{m}\}} ⁠ and ⁠ { v 1 , … , v n } {\displaystyle \{\mathbf {v} _{1},\ldots ,\mathbf {v} _{n}\}} ⁠. In general the SVD is not unique, with certain unitary transformations of ⁠ U {\displaystyle \mathbf {U} } ⁠ and ⁠ V {\displaystyle \mathbf {V} } ⁠ producing valid alternative decompositions. The term SVD sometimes refers to the compact SVD, a similar decomposition ⁠ M = U r Σ r V r ∗ {\displaystyle \mathbf {M} =\mathbf {U} _{r}\mathbf {\Sigma } _{r}\mathbf {V} _{r}^{*}} ⁠, in which ⁠ Σ r {\displaystyle \mathbf {\Sigma } _{r}} ⁠ is an ⁠ r × r {\displaystyle r\times r} ⁠ matrix with only the non-zero singular values (allowing repetitions) on its main diagonal. In this variant, ⁠ U r {\displaystyle \mathbf {U} _{r}} ⁠ is an ⁠ m × r {\displaystyle m\times r} ⁠ semi-unitary matrix whose columns ⁠ { u 1 , … , u r } {\displaystyle \{\mathbf {u} _{1},\ldots ,\mathbf {u} _{r}\}} ⁠ span the columns of ⁠ M {\displaystyle \mathbf {M} } ⁠, and V r {\displaystyle \mathbf {V} _{r}} is an ⁠ n × r {\displaystyle n\times r} ⁠ semi-unitary matrix whose columns ⁠ { v 1 , … , v r } {\displaystyle \{\mathbf {v} _{1},\ldots ,\mathbf {v} _{r}\}} ⁠ span the columns of ⁠ M ∗ {\displaystyle \mathbf {M} ^{*}\!} ⁠. The SVD (with sorted singular values) splits ⁠ M {\displaystyle \mathbf {M} } ⁠ into a sum of ⁠ r {\displaystyle r} ⁠ rank-⁠ 1 {\displaystyle 1} ⁠ matrices, M = σ 1 u 1 v 1 ∗ + σ 2 u 2 v 2 ∗ + ⋯ + σ r u r v r ∗ {\displaystyle \textstyle \mathbf {M} =\sigma _{1}\mathbf {u} _{1}\mathbf {v} _{1}^{*}+\sigma _{2}\mathbf {u} _{2}\mathbf {v} _{2}^{*}+\cdots +\sigma _{r}\mathbf {u} _{r}\mathbf {v} _{r}^{*}\!} . Mathematical applications of the SVD include computing the pseudoinverse, matrix approximation, and determining the rank, range, and null space of a matrix. The SVD is also extremely useful in many areas of science, engineering, and statistics, such as signal processing, least squares fitting of data, and process control.

MORE →
No preview image
Wikipedia

Generalized singular value decomposition

In linear algebra, the generalized singular value decomposition (GSVD) is the name of two different techniques based on the singular value decomposition (SVD). The two versions differ because one version decomposes two matrices (somewhat like the higher-order or tensor SVD) and the other version uses a set of constraints imposed on the left and right singular vectors of a single-matrix SVD.

MORE →
No preview image
Wikipedia

Two-dimensional singular-value decomposition

In linear algebra, two-dimensional singular-value decomposition (2DSVD) computes the low-rank approximation of a set of matrices such as 2D images or weather maps in a manner almost identical to SVD (singular-value decomposition) which computes the low-rank approximation of a single matrix (or a set of 1D vectors).

MORE →
TOPIC OF THE DAY

Greenwood / Black Wall Street

Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.

MORE →
TRIVIA QUESTION OF THE DAY

Who became the first Black woman to travel into space?

Mae Jemison, aboard Space Shuttle Endeavour in 1992.