X
∈
R
m
×
n
X\in\mathbb{R}^{m\times n}
X∈Rm×n的转置:
O
(
m
n
)
O(mn)
O(mn)
矩阵
X
1
∈
R
m
×
n
X_1\in\mathbb{R}^{m\times n}
X1∈Rm×n和
X
2
∈
R
n
×
k
X_2\in\mathbb{R}^{n\times k}
X2∈Rn×k之乘:
O
(
m
n
k
)
O(mnk)
O(mnk)
从 “Introduction to Algorithms”,我们可以看到the matrix inversion is equivalent to matrix multiplication.
(定理28.1 Multiplication is no harder than inversion.)
(定理28.2 Inversion is no harder than multiplication.)