Two matrices must have an equal number of rows and columns to be added.^[1] In which case, the sum of two matrices A and B will be a matrix which has the same number of rows and columns as A and B. The sum of A and B, denoted A + B, is computed by adding corresponding elements of A and B:^[2][3]

${\displaystyle {\begin{aligned}\mathbf {A} +\mathbf {B} &={\begin{bmatrix}a_{11}&a_{12}&\cdots &a_{1n}\\a_{21}&a_{22}&\cdots &a_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}&a_{m2}&\cdots &a_{mn}\\\end{bmatrix}}+{\begin{bmatrix}b_{11}&b_{12}&\cdots &b_{1n}\\b_{21}&b_{22}&\cdots &b_{2n}\\\vdots &\vdots &\ddots &\vdots \\b_{m1}&b_{m2}&\cdots &b_{mn}\\\end{bmatrix}}\\&={\begin{bmatrix}a_{11}+b_{11}&a_{12}+b_{12}&\cdots &a_{1n}+b_{1n}\\a_{21}+b_{21}&a_{22}+b_{22}&\cdots &a_{2n}+b_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}+b_{m1}&a_{m2}+b_{m2}&\cdots &a_{mn}+b_{mn}\\\end{bmatrix}}\\\end{aligned}}\,\!}$ 

Or more concisely (assuming that A + B = C):^[4][5]

${\displaystyle c_{ij}=a_{ij}+b_{ij}}$ 

For example:

${\displaystyle {\begin{bmatrix}1&3\\1&0\\1&2\end{bmatrix}}+{\begin{bmatrix}0&0\\7&5\\2&1\end{bmatrix}}={\begin{bmatrix}1+0&3+0\\1+7&0+5\\1+2&2+1\end{bmatrix}}={\begin{bmatrix}1&3\\8&5\\3&3\end{bmatrix}}}$ 

Similarly, it is also possible to subtract one matrix from another, as long as they have the same dimensions. The difference of A and B, denoted A − B, is computed by subtracting elements of B from corresponding elements of A, and has the same dimensions as A and B. For example:

${\displaystyle {\begin{bmatrix}1&3\\1&0\\1&2\end{bmatrix}}-{\begin{bmatrix}0&0\\7&5\\2&1\end{bmatrix}}={\begin{bmatrix}1-0&3-0\\1-7&0-5\\1-2&2-1\end{bmatrix}}={\begin{bmatrix}1&3\\-6&-5\\-1&1\end{bmatrix}}}$ 

Another operation, which is used less often, is the direct sum (denoted by ⊕). The Kronecker sum is also denoted ⊕; the context should make the usage clear. The direct sum of any pair of matrices A of size m × n and B of size p × q is a matrix of size (m + p) × (n + q) defined as:^[6][2]

${\displaystyle \mathbf {A} \oplus \mathbf {B} ={\begin{bmatrix}\mathbf {A} &{\boldsymbol {0}}\\{\boldsymbol {0}}&\mathbf {B} \end{bmatrix}}={\begin{bmatrix}a_{11}&\cdots &a_{1n}&0&\cdots &0\\\vdots &\ddots &\vdots &\vdots &\ddots &\vdots \\a_{m1}&\cdots &a_{mn}&0&\cdots &0\\0&\cdots &0&b_{11}&\cdots &b_{1q}\\\vdots &\ddots &\vdots &\vdots &\ddots &\vdots \\0&\cdots &0&b_{p1}&\cdots &b_{pq}\end{bmatrix}}}$ 

For instance,

${\displaystyle {\begin{bmatrix}1&3&2\\2&3&1\end{bmatrix}}\oplus {\begin{bmatrix}1&6\\0&1\end{bmatrix}}={\begin{bmatrix}1&3&2&0&0\\2&3&1&0&0\\0&0&0&1&6\\0&0&0&0&1\end{bmatrix}}}$ 

The direct sum of matrices is a special type of block matrix. In particular, the direct sum of square matrices is a block diagonal matrix.

The adjacency matrix of the union of disjoint graphs (or multigraphs) is the direct sum of their adjacency matrices. Any element in the direct sum of two vector spaces of matrices can be represented as a direct sum of two matrices.

In general, the direct sum of n matrices is:^[2]

${\displaystyle \bigoplus _{i=1}^{n}\mathbf {A} _{i}=\operatorname {diag} (\mathbf {A} _{1},\mathbf {A} _{2},\mathbf {A} _{3},\ldots ,\mathbf {A} _{n})={\begin{bmatrix}\mathbf {A} _{1}&{\boldsymbol {0}}&\cdots &{\boldsymbol {0}}\\{\boldsymbol {0}}&\mathbf {A} _{2}&\cdots &{\boldsymbol {0}}\\\vdots &\vdots &\ddots &\vdots \\{\boldsymbol {0}}&{\boldsymbol {0}}&\cdots &\mathbf {A} _{n}\\\end{bmatrix}}\,\!}$ 

where the zeros are actually blocks of zeros (i.e., zero matrices).

The Kronecker sum is different from the direct sum, but is also denoted by ⊕. It is defined using the Kronecker product ⊗ and normal matrix addition. If A is n-by-n, B is m-by-m and ${\displaystyle \mathbf {I} _{k}}$  denotes the k-by-k identity matrix then the Kronecker sum is defined by:

${\displaystyle \mathbf {A} \oplus \mathbf {B} =\mathbf {A} \otimes \mathbf {I} _{m}+\mathbf {I} _{n}\otimes \mathbf {B} .}$ 

• Matrix multiplication
• Vector addition

• Lipschutz, Seymour; Lipson, Marc (2017). Schaum's Outline of Linear Algebra (6 ed.). McGraw-Hill Education. ISBN 9781260011449.
• Riley, K.F.; Hobson, M.P.; Bence, S.J. (2006). Mathematical methods for physics and engineering (3 ed.). Cambridge University Press. doi:10.1017/CBO9780511810763. ISBN 978-0-521-86153-3.

• Direct sum of matrices at PlanetMath.
• Abstract nonsense: Direct Sum of Linear Transformations and Direct Sum of Matrices
• Mathematics Source Library: Arithmetic Matrix Operations
• Matrix Algebra and R