MatrixPower[m,n]
给出 m 的 n 次矩阵幂.
MatrixPower[m,n,v]
给出矩阵 m 用于矢量 v 的 n 次矩阵幂.
MatrixPower
MatrixPower[m,n]
给出 m 的 n 次矩阵幂.
MatrixPower[m,n,v]
给出矩阵 m 用于矢量 v 的 n 次矩阵幂.
更多信息和选项
- MatrixPower[m,n] 有效地计算出一个矩阵与它自身乘积 n 次的结果. »
- 当 n 是负数,MatrixPower 得到 m 的逆的幂. »
- 当 n 不是整数时,MatrixPower 可用矩阵幂替换常规幂有效计算函数的幂级数. »
- MatrixPower 只对方阵有效.
范例
打开所有单元 关闭所有单元基本范例 (4)
m = (| | |
| - | - |
| a | b |
| c | d |);MatrixPower[m, 2]//MatrixForm% == m.mm = (| | |
| - | - |
| a | b |
| c | d |);MatrixPower[m, -2]//Simplify//MatrixForm% == Inverse[m].Inverse[m]//SimplifyMatrixPower[{{1, 1}, {1, 2}}, 10]{{1, 1}, {1, 2}} ^ 10MatrixPower[{{0, 0, 1}, {0, 2, 0}, {-1, 0, 0}}, n]范围 (15)
基本用法 (9)
MatrixPower[{{1.2, 2.5, -3.2}, {0.7, -9.4, 5.8}, {-0.2, 0.3, 6.4}}, 5]MatrixPower[{{1.2, 2.5, -3.2}, {0.7, -9.4, 5.8}, {-0.2, 0.3, 6.4}}, 3 / 2]MatrixPower[{{1. + I, 2, 3 - 2 I}, {0, 4 π, 5I}, {E, 0, 6}}, 2]//MatrixFormMatrixPower[{{2, 3, 0}, {4, 9, 0}, {0, 0, 4}}, 14]//MatrixFormMatrixPower[{{2, 3, 0}, {4, 9, 0}, {0, 0, 4}}, -3 / 2]//MatrixFormm = RandomReal[1, {2, 2}, WorkingPrecision -> 20]MatrixPower[m, -5]MatrixPower[m, Pi]MatrixPower[{{a, b}, {0, c}}, 4]MatrixPower[{{0, a}, {b, 0}}, n]m = RandomReal[{0, 1}, {800, 800}];MatrixPower[m, 2]; //AbsoluteTimingMatrixPower[m, 2, Range[800]]; //AbsoluteTimingℱ = FiniteField[29, 4];
m = {{ℱ[12], ℱ[23], ℱ[34]}, {ℱ[45], ℱ[56], ℱ[67]}, {ℱ[78], ℱ[89], ℱ[90]}};
MatrixPower[m, 123456789]//MatrixFormMatrixPower[m, -987654321]//MatrixForm将 CenteredInterval 矩阵提升到整数幂:
(m = Map[CenteredInterval, RandomReal[{-10, 10}, {3, 3}, WorkingPrecision -> 10], {2}])//MatrixForm(mpow = MatrixPower[m, 17])//MatrixFormranrep[e_CenteredInterval] := e["Center"] + RandomInteger[{-1000, 1000}] / 1000 e["Radius"]
(mrep = Map[ranrep, m, {2}])//MatrixForm验证 mpow 是否包含 MatrixPower[mrep,17]:
MapThread[IntervalMemberQ, {mpow, MatrixPower[mrep, 17]}, 2]//MatrixForm特殊矩阵 (6)
mat = SparseArray[{{1, 3} -> 1, {2, 2} -> 2, {3, 1} -> 3}, {3, 3}]MatrixPower[mat, 2]%//MatrixFormMatrixPower[mat, 2.5]m = SparseArray[Band[{1, 2}] -> 2, {1000, 1000}]v = SparseArray[{{1} -> 1, {-1} -> -1.5}, {1000}]MatrixPower[m, 4, v]//ShortQuantityArray[{{1, 2}, {3, 4}}, "Meters"]MatrixPower[%, 2]SymmetrizedArray[{{1, 1} -> 3, {2, 2} -> 1, {3, 1} -> -5}, {3, 3}, Symmetric[All]]MatrixPower[%, -2]IdentityMatrix 的幂是其自身:
MatrixPower[IdentityMatrix[3], n]MatrixPower[DiagonalMatrix[{a, b, c}], n]对 HilbertMatrix 开负数次方:
MatrixPower[HilbertMatrix[2], -2]//MatrixFormrpoly[n_] := RandomInteger[{-2 ^ 10, 2 ^ 10}, {n + 1}].x ^ Range[0, n]
SeedRandom[1234];
m = Table[rpoly[100], {10}, {10}];MatrixPower[m, 20]//Short[#, 5]&//AbsoluteTiming应用 (5)
a = {{0, 1, 0}, {1, 0, 0}, {0, 1, 1}};使用 MatrixPower 定义基本解
:
ϕ[n_] = MatrixPower[a, n]Simplify[ϕ[n + 1] == a.ϕ[n]]Simplify[ϕ[0] == IdentityMatrix[3]]m = {{1, 1, 1, 1}, {0, 1, 1, 1}, {0, 0, 1, 1}, {0, 0, 0, 1}};mp = MatrixPower[m, n]Sum[(%/n!), {n, 0, ∞}]% == MatrixExp[m]MatrixPower[{{1, θ / n}, {-θ / n, 1}}, n]Limit[%, n -> Infinity] // FullSimplifyn = 100;m = SparseArray[{{i_, i_} -> 2., {i_, j_} /; Abs[i - j] == 1 -> -1.}, {n, n}, 0.]v = Normalize[MatrixPower[m, -20, RandomReal[1, n]]];
val = Norm[m.v]Norm[m.v - val v]v = Normalize[MatrixPower[m - 4 MatrixPower[m, 0], -20, RandomReal[1, n]]];
val = Norm[m.v]Norm[m.v - val v]mpe[p_, x_, m_] := Module[{cl = CoefficientList[p, x]},
Sum[MatrixPower[m, i - 1] cl[[i]], {i, Length[cl]}]]mpe[1 + 2 x + 3 x ^ 3, x, {{1, 2}, {3, 4}}]m = Reverse[IdentityMatrix[4]];p = CharacteristicPolynomial[m, x]mpe[p, x, m]属性和关系 (10)
对于正整数幂
,MatrixPower[m,n] 等价于
(
次):
m = {{1, 2}, {π, .5}};
MatrixPower[m, 3] == m.m.m使用 Apply (@@) 可更简洁地表达该方程式:
MatrixPower[m, 100] == Dot@@ConstantArray[m, {100}]对于负整数幂
,MatrixPower[m,-n] 等价于
(
次):
m = {{1, 2}, {π, .5}};
MatrixPower[m, -3] == Inverse[m].Inverse[m].Inverse[m]使用 Apply 可更简洁地表达该方程式:
MatrixPower[m, -100] == Dot@@ConstantArray[Inverse[m], {100}]MatrixPower[{{1, 2}, {0, 0}}, -1]对非奇异矩阵 m,MatrixPower[m,0] 是单位矩阵:
m = {{1, 2}, {3, 4}};Det[m]MatrixPower[m, 0]//MatrixForm如果 m 为非奇异,MatrixPower[m, n].MatrixPower[m,-n] 为单位矩阵:
m = RandomReal[1, {5, 5}];
n = RandomInteger[{1, 9}];Chop[MatrixPower[m, n].MatrixPower[m, -n]]//MatrixForm对于非整数幂,MatrixPower 可用 MatrixPower 代换 Power 有效使用幂级数:
a = {{1, -(1/6)}, {1, (1/6)}};MatrixPower[a, 1 / 2] == Sum[(Derivative[k][Sqrt][1]/k!) MatrixPower[a - IdentityMatrix[2], k], {k, 0, ∞}]同样,MatrixPower 是将幂应用于适当函数的 MatrixFunction:
MatrixPower[a, 1 / 2] == MatrixFunction[x |-> x^1 / 2, a]d = {1, 2, 3, 4};
s = 2 / 3;MatrixPower[DiagonalMatrix[d], s]DiagonalMatrix[d ^ s]对于任何幂
和可对角化矩阵
,MatrixPower[m,s] 等于
:
m = {{1, 2}, {π, .5}};DiagonalizableMatrixQ[m]使用 JordanDecomposition 可求得对角化:
{v, d} = JordanDecomposition[m];m == v.d.Inverse[v]MatrixPower[m, 1 / 2]% == v.Sqrt[d].Inverse[v]对于实对称矩阵 s 和整数幂 n,MatrixPower[s,n] 也是实对称:
s = {{1, 2}, {2, 1}};
{SymmetricMatrixQ[s], SymmetricMatrixQ[MatrixPower[s, -5]]}埃尔米特矩阵的相似陈述 (analogous statement) 判定为真:
h = {{1, 2 + 3 I}, {2 - 3 I, 4}};
{HermitianMatrixQ[h], HermitianMatrixQ[MatrixPower[h, 7]]}对于正交矩阵 o 和任何幂 s,MatrixPower[o,s] 也为正交:
o = RotationMatrix[π / 6];
{OrthogonalMatrixQ[o], OrthogonalMatrixQ[MatrixPower[o, Sqrt[2]]]}酉矩阵的相似陈述 (analogous statement) 判定为真:
u = {{0, -I}, {I, 0}};
{UnitaryMatrixQ[u], UnitaryMatrixQ[MatrixPower[u, -π]]}
可通过 JordanDecomposition
作为
计算得到:
m = {{2, 0, 0, 0}, {0, 1, 0, 0}, {1, -1, 1, 0}, {1, -1, 1, 1}};
{v, j} = JordanDecomposition[m];
MatrixPower[m, -1 / 2] == v.MatrixPower[j, -1 / 2].Inverse[v]MatrixForm /@ {j, MatrixPower[j, -1 / 2]}相关指南
-
▪
- 矩阵运算 ▪
- 递归与求和函数 ▪
- 符号向量、矩阵和数组
历史
1991年引入 (2.0) | 在以下年份被更新:2003 (5.0) ▪ 2007 (6.0) ▪ 2014 (10.0) ▪ 2022 (13.2) ▪ 2024 (14.0)
文本
Wolfram Research (1991),MatrixPower,Wolfram 语言函数,https://reference.wolfram.com/language/ref/MatrixPower.html (更新于 2024 年).
CMS
Wolfram 语言. 1991. "MatrixPower." Wolfram 语言与系统参考资料中心. Wolfram Research. 最新版本 2024. https://reference.wolfram.com/language/ref/MatrixPower.html.
APA
Wolfram 语言. (1991). MatrixPower. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/ref/MatrixPower.html 年
BibTeX
@misc{reference.wolfram_2026_matrixpower, author="Wolfram Research", title="{MatrixPower}", year="2024", howpublished="\url{https://reference.wolfram.com/language/ref/MatrixPower.html}", note=[Accessed: 08-November-2026]}
BibLaTeX
@online{reference.wolfram_2026_matrixpower, organization={Wolfram Research}, title={MatrixPower}, year={2024}, url={https://reference.wolfram.com/language/ref/MatrixPower.html}, note=[Accessed: 08-November-2026]}