Jump to content

Duplication and elimination matrices

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SirMeowMeow (talk | contribs) at 22:49, 12 February 2021 (Undoing edits by Hellacioussatyr (talk) because the user is everywhere, making tiny edits and converting Latex into other templates.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, especially in linear algebra and matrix theory, the duplication matrix and the elimination matrix are linear transformations used for transforming half-vectorizations of matrices into vectorizations or (respectively) vice versa.

Duplication matrix

The duplication matrix is the unique matrix which, for any symmetric matrix , transforms into :

.

For the symmetric matrix , this transformation reads


The explicit formula for calculating the duplication matrix for a matrix is:

Where:

  • is a unit vector of order having the value in the position and 0 elsewhere;
  • is a matrix with 1 in position and and zero elsewhere

Elimination matrix

An elimination matrix is a matrix which, for any matrix , transforms into :

[1]

For the matrix , one choice for this transformation is given by

.

Notes

  1. ^ Magnus & Neudecker (1980), Definition 3.1

References

  • Magnus, Jan R.; Neudecker, Heinz (1980), "The elimination matrix: some lemmas and applications", SIAM Journal on Algebraic and Discrete Methods, 1 (4): 422–449, doi:10.1137/0601049, ISSN 0196-5212.
  • Jan R. Magnus and Heinz Neudecker (1988), Matrix Differential Calculus with Applications in Statistics and Econometrics, Wiley. ISBN 0-471-98633-X.
  • Jan R. Magnus (1988), Linear Structures, Oxford University Press. ISBN 0-19-520655-X