Matrix Power Calculator

Raise a square matrix to any integer power with step-by-step successive multiplications.

Enter Matrix & Exponent

Matrix A

Result

A3 =
Matrix Size 2 x 2
Exponent 3
Method Successive multiplication

Step-by-Step Solution

A^n = A × A × ... × A (n times)

What is Matrix Exponentiation?

Matrix exponentiation (or matrix power) is the operation of multiplying a square matrix by itself a specified number of times. For a square matrix A and a positive integer n, An = A × A × ... × A (n times). This operation is only defined for square matrices because matrix multiplication requires compatible dimensions.

Special Cases

Exponent n = 0

Any non-singular square matrix raised to the power 0 gives the identity matrix.

A^0 = I (identity matrix)

Exponent n = 1

Any matrix raised to the power 1 is just the matrix itself.

A^1 = A

Negative Exponent

A negative exponent means computing the inverse first, then raising to the positive power.

A^(-n) = (A^(-1))^n

Power Rule

Matrix powers follow the standard exponent rules for compatible operations.

A^m × A^n = A^(m+n)

How to Compute Matrix Powers

Successive Multiplication Method

  1. Start with the original matrix A.
  2. Multiply the current result by A to get the next power.
  3. Repeat until you reach the desired exponent.
  4. For negative exponents, first compute A-1, then raise that to the positive power.

Applications

Matrix exponentiation is widely used in solving linear recurrence relations (like computing Fibonacci numbers efficiently), modeling Markov chains (steady-state probabilities), solving systems of linear differential equations, graph theory (counting paths of length n), and computer graphics (composing repeated transformations).

Computational Efficiency

  • Naive successive multiplication takes O(n) matrix multiplications.
  • Exponentiation by squaring reduces this to O(log n) multiplications.
  • Diagonalizable matrices can be raised to any power via eigendecomposition: An = P Dn P-1.
  • For very large exponents, eigendecomposition or squaring methods are preferred.