Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Mathematica > Mathematics and Algorithms > Matrices and Linear Algebra > Matrix Operations >

MatrixPower

MatrixPower[m, n]
gives the n^(th) matrix power of the matrix m.
MatrixPower[m, n, v]
gives the n^(th) matrix power of the matrix m applied to the vector v.
  • MatrixPower[m, n] effectively evaluates the product of a matrix with itself n times.
  • When n is negative, MatrixPower finds powers of the inverse of the matrix m.  »
Compute for a symbolic (assumed to be integer) power:
Find the second inverse matrix power applied to a particular vector:
This is a more efficient way of computing m^(-1).m^(-1).b:
Use exact arithmetic to compute the matrix power:
Use machine arithmetic:
Use 20-digit precision arithmetic:
Compute the matrix power for a complex matrix:
Matrix power for a sparse matrix:
The middle row is a stencil for a second-order approximation to the sixth derivative:
Use a symbolic matrix with a symbolic power:
Construct a rotation matrix as a limit of repeated infinitesimal transformations:
Solve the constant coefficient system of difference equations x(n+1)=a.x(n):
This computes the fundamental solution phi(n):
Show that it satisfies equations and initial conditions:
Find the matrix exponential for a matrix without a full set of eigenvectors:
Compute the exponential as the power series for each term:
Get a sparse identity matrix with size, precision and data type consistent with an input matrix:
Sparse identity matrix with exact values:
Sparse identity matrix with machine-number values:
Inverse power iteration for the smallest eigenvalue of a sparse positive definite matrix:
Check the error in m.v - val v:
Shifted inverse power iteration for the largest eigenvalue:
Check the error in m.v - val v:
An easy way to evaluate a matrix polynomial:
Evaluate a characteristic polynomial:
If m is nonsingular, MatrixPower[m, n].MatrixPower[m, -n] is the identity:
New in 2 | Last modified in 6
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team