【数学】矩阵与矩阵运算

注：本文只适用于C++党使用。

一、矩阵：

1.定义：由$m\times n$个数$a_{ij}(i=1,2,\cdots ,m;j=1,2,\cdots ,n)$排成的$m$行$n$列的数表，称为$m\times n$矩阵，记为：
$$A={\left(a_{ij}\right)}_{m\times n}$$
在C++中，我们一般用结构体表示矩阵:

typedef struct {
	int li[101][101], m, n;
} matrix;

2.分类
(1).行矩阵： $1\times n$矩阵
(2).列矩阵： $m\times 1$矩阵
(3).$n$阶矩阵：$n\times n$矩阵，记作$A_n$
(4).单位矩阵：对角线为1，其余为0的n阶矩阵，记作$E_n$
(5).零矩阵：全为0的矩阵，记作$O_{m\times n}$。
二、矩阵运算：
1.加法：
设两个$m\times n$矩阵$A,B$，则$A+B={\left(a_{ij}+b_{ij}\right)}_{m\times n}(i=1,2,\cdots ,m;j=1,2,\cdots ,n)$
代码如下：

matrix operator + (matrix a, matrix b) {
    matrix I;
    I.m = a.m, I.n = a.n;
    for (int i = 0; i < a.m; i++)
        for (int j = 0; j < a.n; j++)
            I.li[i][j] = a.li[i][j] + b.li[i][j];
    return I;
}

2.减法：
设两个$m\times n$矩阵$A,B$，则$A-B={\left(a_{ij}-b_{ij}\right)}_{m\times n}(i=1,2,\cdots ,m;j=1,2,\cdots ,n)$
代码如下：

matrix operator - (matrix a, matrix b) {
  matrix I;
  I.m = a.m, I.n = a.n;
  for (int i = 0; i < a.m; i++)
      for (int j = 0; j < a.n; j++)
          I.li[i][j] = a.li[i][j] - b.li[i][j];
  return I;
}

3.数乘：设$m\times n$矩阵$A$，有$\lambda \in \mathbb{R}$，则$\lambda A={\left(\lambda a_{ij}\right)}_{m\times n}(i=1,2,\cdots ,m;j=1,2,\cdots ,n)$
代码如下：

matrix numMul(int lambda, matrix a) {
    matrix I;
    I.m = a.m, I.n = a.n;
    for (int i = 0; i < a.m; i++)
        for (int j = 0; j < a.n; j++)
            I.li[i][j] = a.li[i][j] * lambda;
    return I;
}

4.矩阵乘法：
设有$m\times s$矩阵$A$，$s\times n$矩阵$B$，定义$A,B$的乘积$C=(c_{ij}{)}_{m\times n}$，其中 $$c_{ij}=\sum _{k=1}^s{a}_{ik}{b}_{kj}(i=1,2,\cdots ,m;j=1,2,\cdots ,n)$$记为$C=AB$，读作$A$右乘$B$。
代码如下：

#include <cstring>
matrix operator * (matrix a, matrix b) {
  matrix I;
  memset(I.li, 0, sizeof I.li);
  I.m = a.m, I.n = b.n;
  for (int i = 0; i < a.m; i++)
      for (int j = 0; j < b.n; j++)
          for (int k = 0; k < a.n; k++)
              I.li[i][j] += a.li[i][j] * b.li[j][j];
  return I;
}

4.幂运算：
设$A$是$n$阶矩阵，定义$A$的正整数幂为：
$$A^1=A，A^k=A^{k-1}A$$
又定义 $A^0=E_n$
故可以幂运算用矩阵乘法实现，代码如下。

#include <cstring>
matrix pows(matrix a, int n) {
    matrix I;
    I.m = I.n = a.n;
    memset(I.li, 0, sizeof I.li);
    for (int i = 0; i < I.n; i++) I.li[i][i] = 1;
    while (n--) I = I * a;
    return I;
}

亦可用快速幂：

#include <cstring>
matrix pows(matrix a, int n) {
    matrix I;
    I.m = I.n = a.n;
    memset(I.li, 0, sizeof I.li);
    for (int i = 0; i < I.n; i++) I.li[i][i] = 1;
    while (n > 1) {
        if (n & 1) I = I * a;
        n >>= 1, a = a * a;
    }
    return I * a;
}

如果需要取模的话可以进行取模：

#include <cstring>
const int mod = 10000 //此处10000为取模数，可以改变。
matrix operator % (matrix a, matrix b) {
    matrix I;
    memset(I.li, 0, sizeof I.li);
    I.m = a.m, I.n = b.n;
    for (int i = 0; i < a.m; i++)
        for (int j = 0; j < b.n; j++)
            for (int k = 0; k < a.n; k++)
                I.li[i][j] += a.li[i][j] * b.li[j][j] % mod;
    return I;
}

综上，矩阵及运算代码可归为以下代码：

#include <cstring>
typedef struct {
    int li[101][101], m, n;
} matrix;
matrix operator + (matrix a, matrix b) {
    matrix I;
    I.m = a.m, I.n = a.n;
    for (int i = 0; i < a.m; i++)
        for (int j = 0; j < a.n; j++)
            I.li[i][j] = a.li[i][j] + b.li[i][j];
    return I;
}
matrix operator - (matrix a, matrix b) {
    matrix I;
    I.m = a.m, I.n = a.n;
    for (int i = 0; i < a.m; i++)
        for (int j = 0; j < a.n; j++)
            I.li[i][j] = a.li[i][j] - b.li[i][j];
    return I;
}
matrix numMul(int lambda, matrix a) {
    matrix I;
    I.m = a.m, I.n = a.n;
    for (int i = 0; i < a.m; i++)
        for (int j = 0; j < a.n; j++)
            I.li[i][j] = a.li[i][j] * lambda;
    return I;
}
matrix operator * (matrix a, matrix b) {
    matrix I;
    memset(I.li, 0, sizeof I.li);
    I.m = a.m, I.n = b.n;
    for (int i = 0; i < a.m; i++)
        for (int j = 0; j < b.n; j++)
            for (int k = 0; k < a.n; k++)
                I.li[i][j] += a.li[i][j] * b.li[j][j];
    return I;
}
const int mod = 10000 //此处10000为取模数，可以改变。
matrix operator % (matrix a, matrix b) {
      matrix I;
      memset(I.li, 0, sizeof I.li);
      I.m = a.m, I.n = b.n;
      for (int i = 0; i < a.m; i++)
          for (int j = 0; j < b.n; j++)
              for (int k = 0; k < a.n; k++)
	              I.li[i][j] += a.li[i][j] * b.li[j][j] % mod;
      return I;
matrix pows(matrix a, int n) {
    matrix I;
    I.m = I.n = a.n;
    memset(I.li, 0, sizeof I.li);
    for (int i = 0; i < I.n; i++) I.li[i][i] = 1;
    while (n > 1) {
        if (n & 1) I = I * a;
        n >>= 1, a = a * a;
    }
    return I * a;
}
matrix modpows(matrix a, int n) {
    matrix I;
    I.m = I.n = a.n;
    memset(I.li, 0, sizeof I.li);
    for (int i = 0; i < I.n; i++) I.li[i][i] = 1;
    while (n > 1) {
        if (n & 1) I = I % a;
        n >>= 1, a = a % a;
    }
    return I % a;
}