elementwise division

In mathematics, the Hadamard product (also known as the element-wise product, entrywise product or Schur product) is a binary operation that takes in two matrices of the same dimensions and returns a matrix of the multiplied corresponding elements. This operation can be thought as a "naive matrix multiplication" and is different from the matrix product. It is attributed to, and named after, either French mathematician Jacques Hadamard or German mathematician Issai Schur.

The Hadamard product is associative and distributive. Unlike the matrix product, it is also commutative.

Definition

For two matrices and of the same dimension , the Hadamard product $A \odot B$ (sometimes $A \circ B$) is a matrix of the same dimension as the operands, with elements given by
:$(A \odot B)_ = (A)_ (B)_.$

For matrices of different dimensions ( and , where or ), the Hadamard product is undefined.

An example of the Hadamard product for two arbitrary 2 × 3 matrices:
:$\begin 2 & 3 & 1 \\ 0 & 8 & -2 \end \circ \begin 3 & 1 & 4 \\ 7 & 9 & 5 \end = \begin 2 \times 3 & 3 \times 1 & 1 \times 4 \\ 0 \times 7 & 8 \times 9 & -2 \times 5 \end = \begin 6 & 3 & 4 \\ 0 & 72 & -10 \end.$

Properties

* The Hadamard product is commutative (when working with a commutative ring), associative and distributive over addition. That is, if ''A'', ''B'', and ''C'' are matrices of the same size, and ''k'' is a scalar: $\begin A \odot B &= B \odot A, \\ A \odot (B \odot C) &= (A \odot B) \odot C, \\ A \odot (B + C) &= A \odot B + A \odot C, \\ (kA) \odot B &= A \odot (kB) = k(A \odot B), \\ A \odot 0 &= 0 \odot A = 0. \end$
* The identity matrix under Hadamard multiplication of two matrices is an matrix where all elements are equal to 1. This is different from the identity matrix under regular matrix multiplication, where only the elements of the main diagonal are equal to 1. Furthermore, a matrix has an inverse under Hadamard multiplication if and only if all of the elements are invertible, or equivalently over a field, if and only if none of the elements are equal to zero.
* For vectors and and corresponding diagonal matrices and with these vectors as their main diagonals, the following identity holds: $\mathbf^* (A \odot B)\mathbf = \operatorname\left(_\mathbf^* A _\mathbf ^\mathsf\right),$ where denotes the conjugate transpose of . In particular, using vectors of ones, this shows that the sum of all elements in the Hadamard product is the trace of where superscript T denotes the matrix transpose, that is, $\operatorname\left(AB^\right) = \mathbf^\mathsf\left(A\odot B\right)\mathbf$. A related result for square and , is that the row-sums of their Hadamard product are the diagonal elements of : $\sum_i (A \odot B)_ = \left(B^\mathsf A\right)_ = \left(AB^\mathsf\right)_.$ Similarly, $(\mathbf\mathbf^*) \odot A = D_\mathbf A D_\mathbf^*.$ Furthermore, a Hadamard matrix–vector product can be expressed as $(A \odot B) \mathbf = \operatorname(A D_\mathbf B^\mathsf),$ where $\operatorname(M)$ is the vector formed from the diagonals of matrix .
* The Hadamard product is a principal submatrix of the Kronecker product.
* The Hadamard product satisfies the rank inequality $\operatorname(A \odot B) \leq \operatorname(A) \operatorname(B).$
* If and are positive-definite matrices, then the following inequality involving the Hadamard product holds: $\prod_^n \lambda_i(A \odot B) \ge \prod_^n \lambda_i(A B),\quad k = 1, \ldots, n,$ where is the th largest eigenvalue of .
* If and are diagonal matrices, then $\begin D (A \odot B) E &= (D A E) \odot B = (D A) \odot (B E) \\ &= (AE) \odot (D B) = A \odot (D B E). \end$
* The Hadamard product of two vectors $\mathbf a$ and $\mathbf b$ is the same as matrix multiplication of the corresponding diagonal matrix of one vector by the other vector: $\mathbf a \odot \mathbf b = D_\mathbf \mathbf b = D_\mathbf \mathbf a.$
* The $\operatorname$ operator transforming a vector to a diagonal matrix may be expressed using the Hadamard product as $\operatorname(\mathbf) = (\mathbf \mathbf^T) \odot I,$ where $\mathbf$ is a constant vector with elements $1$, and $I$ is the identity matrix.

The mixed-product property

The Hadamard product obeys certain relationships with other matrix product operators.
* If $\otimes$ is the Kronecker product, assuming $A$ has the same dimensions as $C$ and $B$ as $D$, then $(A \otimes B) \odot (C \otimes D) = (A \odot C) \otimes (B \odot D) .$

* If $\bull$ is the face-splitting product, then $(A \bull B) \odot (C \bull D) = (A \odot C) \bull (B \odot D).$

* If $\ast$ is the column-wise Khatri–Rao product, then $(A \bull B)(C \ast D) = (A C) \odot (B D).$

Schur product theorem

The Hadamard product of two positive-semidefinite matrices is positive-semidefinite. This is known as the Schur product theorem, after Russian mathematician Issai Schur. For two positive-semidefinite matrices and , it is also known that the determinant of their Hadamard product is greater than or equal to the product of their respective determinants:$\det( \odot ) \ge \det() \det().$

Analogous operations

Other Hadamard operations are also seen in the mathematical literature, namely the ' and ' (which are in effect the same thing because of fractional indices), defined for a matrix such that:

For
$\begin &= ^ \\ B_ &= ^2 \end$

and for
$\begin &= ^ \\ B_ &= ^\frac12 \end$

The ' reads:
$\begin &= ^ \\ B_ &= ^ \end$

A ' is defined as:

$\begin &= \oslash \\ C_ &= \frac \end$

In programming languages

Most scientific or numerical programming languages include the Hadamard product, under various names.

In MATLAB, the Hadamard product is expressed as "dot multiply": a .* b, or the function call: times(a, b). It also has analogous dot operators which include, for example, the operators a .^ b and a ./ b. Because of this mechanism, it is possible to reserve * and ^ for matrix multiplication and matrix exponentials, respectively.

The programming language Julia has similar syntax as MATLAB, where Hadamard multiplication is called ''broadcast multiplication'' and also denoted with a .* b, and other operators are analogously defined element-wise, for example Hadamard powers use a .^ b. But unlike MATLAB, in Julia this "dot" syntax is generalized with a generic ''broadcasting operator .'' which can apply any function element-wise. This includes both binary operators (such as the aforementioned multiplication and exponentiation, as well as any other binary operator such as the Kronecker product), and also unary operators such as ! and √. Thus, any function in prefix notation f can be applied as f.(x).

Python does not have built-in array support, leading to inconsistent/conflicting notations. The NumPy numerical library interprets a*b or a.multiply(b) as the Hadamard product, and uses a@b or a.matmul(b) for the matrix product. With the SymPy symbolic library, multiplication of objects as either a*b or a@b will produce the matrix product. The Hadamard product can be obtained with the method call a.multiply_elementwise(b). Some Python packages include support for Hadamard powers using methods like np.power(a, b), or the Pandas method a.pow(b).

In C++, the Eigen library provides a cwiseProduct member function for the class (a.cwiseProduct(b)), while the Armadillo library uses the operator % to make compact expressions (a % b; a * b is a matrix product).

In GAUSS, and HP Prime, the operation is known as ''array multiplication.''

In Fortran, R, APL, J and Wolfram Language (Mathematica), the multiplication operator * or × apply the Hadamard product, whereas the matrix product is written using matmul, %*%, +.×, +/ .* and ., respectively.
The R packag
matrixcalc
introduces the function hadamard.prod() for Hadamard Product of numeric matrices or vectors.

Applications

The Hadamard product appears in lossy compression algorithms such as JPEG. The decoding step involves an entry-for-entry product, in other words the Hadamard product.

In image processing, the Hadamard operator can be used for enhancing, suppressing or masking image regions. One matrix represents the original image, the other acts as weight or masking matrix.

It is used in the machine learning literature, for example, to describe the architecture of recurrent neural networks as GRUs or LSTMs.

It is also used to study the statistical properties of random vectors and matrices.

The penetrating face product

According to the definition of V. Slyusar the penetrating face product of the ''p''×''g'' matrix $$ and ''n''-dimensional matrix $$ (''n'' > 1) with ''p''×''g'' blocks ( = _n) is a matrix of size $$ of the form:
$$$$
circ =
\left begin
\circ _1 & \circ _2 & \cdots & \circ _n
\end\right

Example

If
=
\begin
1 & 2 & 3 \\
4 & 5 & 6 \\
7 & 8 & 9
\end,\quad
=
\left begin
_1 & _2 & _3
\end\right=
\left begin
1 & 4 & 7 & 2 & 8 & 14 & 3 & 12 & 21 \\
8 & 20 & 5 & 10 & 25 & 40 & 12 & 30 & 6 \\
2 & 8 & 3 & 2 & 4 & 2 & 7 & 3 & 9
\end\right

then

$$$$circ =
\left begin
1 & 8 & 21 & 2 & 16 & 42 & 3 & 24 & 63 \\
32 & 100 & 30 & 40 & 125 & 240 & 48 & 150 & 36 \\
14 & 64 & 27 & 14 & 32 & 18 & 49 & 24 & 81
\end\right

Main properties

:$$circ = circ;
:$\bull =$circ\left( \otimes \mathbf ^\textsf\right),

where $\bull$ denotes the face-splitting product of matrices,
:$\mathbf \bull = \mathbf$circ, where $\mathbf$ is a vector.

Applications

The penetrating face product is used in the tensor-matrix theory of digital antenna arrays. This operation can also be used in artificial neural network models, specifically convolutional layers.

See also

* Frobenius inner product
* Pointwise product
* Kronecker product
* Khatri–Rao product

References

{{Linear algebra

Matrix theory
Issai Schur