Single-entry matrix
Appearance
In mathematics a single-entry matrix is a matrix where a single element is one and the rest of the elements are zero,[1][2] e.g.,
It is a specific type of a sparse matrix. The single-entry matrix can be regarded a row-selector when it is multiplied on the left side of the matrix, e.g.:
Alternatively, a column-selector when multiplied on the right side:
The name, single-entry matrix, is not common, but seen in a few works.[3]
A single-entry vector is a scaled standard unit vector.
See also
References
- ^ Kaare Brandt Petersen & Michael Syskind Pedersen (2008-02-16). "The Matrix Cookbook" (PDF).
- ^ Shohei Shimizu, Patrick O. Hoyer, Aapo Hyvärinen & Antti Kerminen (2006). "A Linear Non-Gaussian Acyclic Model for Causal Discovery" (PDF). Journal of Machine Learning Research. 7: 2003–2030.
{{cite journal}}
: CS1 maint: multiple names: authors list (link) - ^ Examples:
- "Distributed Gain Matrix Optimization in Non-Regenerative MIMO Relay Networks" (PDF).
- Marcel Blattner (2009). "B-Rank: A top N Recommendation Algorithm". arXiv:0908.2741 [physics.data-an].