Single-entry matrix

From HandWiki

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.,

[math]\displaystyle{ \mathbf{J}^{23} = \left[\begin{matrix} 0 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{matrix}\right]. }[/math]

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.:

[math]\displaystyle{ \mathbf{J}^{23}\mathbf{A} = \left[ \begin{matrix} 0 & 0& 0 \\ a_{31} & a_{32} & a_{33} \\ 0 & 0 & 0 \end{matrix}\right]. }[/math]

Alternatively, a column-selector when multiplied on the right side:

[math]\displaystyle{ \mathbf{A}\mathbf{J}^{23} = \left[ \begin{matrix} 0 & 0 & a_{12} \\ 0 & 0 & a_{22} \\ 0 & 0 & a_{32} \end{matrix}\right]. }[/math]

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

  1. "The Matrix Cookbook". 2008-02-16. http://www2.imm.dtu.dk/pubdb/views/edoc_download.php/3274/pdf/imm3274.pdf. 
  2. Shohei Shimizu, Patrick O. Hoyer, Aapo Hyvärinen & Antti Kerminen (2006). "A Linear Non-Gaussian Acyclic Model for Causal Discovery". Journal of Machine Learning Research 7: 2003–2030. http://www.cs.helsinki.fi/group/neuroinf/lingam/JMLR06.pdf. 
  3. Examples:
    • "Distributed Gain Matrix Optimization in Non-Regenerative MIMO Relay Networks". http://www.nari.ee.ethz.ch/wireless/pubs/files/asilomar09r.pdf. 
    • Marcel Blattner (2009). "B-Rank: A top N Recommendation Algorithm". arXiv:0908.2741 [physics.data-an].