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 > Linear Systems >

NullSpace

NullSpace[m]
gives a list of vectors that forms a basis for the null space of the matrix m.
  • NullSpace works on both numerical and symbolic matrices.
  • The following options can be given:
MethodAutomaticmethod to use
Modulus0integer modulus to use
ToleranceAutomaticnumerical tolerance to use
ZeroTestAutomaticfunction to test whether matrix elements should be considered to be zero
  • NullSpace[m, ZeroTest->test] evaluates test[m[[i, j]]] to determine whether matrix elements are zero.
  • Possible settings for the Method option include "CofactorExpansion", "DivisionFreeRowReduction" and "OneStepRowReduction". The default setting of Automatic switches among these methods depending on the matrix given.
Find the null space of a 3×3 matrix:
The action of m on the vector is the zero vector:
Find the null space of a 3×3 matrix:
In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=
The action of m on the vector is the zero vector:
In[3]:=
Click for copyable input
Out[3]=
m is a 3×4 matrix:
Use exact arithmetic to find the null space:
Use machine arithmetic:
Use 20-digit precision arithmetic:
Compute the null space for a complex matrix:
Find the null space symbolically:
m is a 3×3 random matrix of integers between 0 and 4:
Use arithmetic modulo 5 to compute the null space:
The vector is in the null space modulo 5:
m is a 3×3 singular matrix with a nonempty null space:
Find a solution x1 for m.x=b:
All solutions are given by x1+x0 where x0 is any vector in the null space:
Find a basis for the eigenspace for a particular eigenvalue:
m is a 5×5 matrix:
The null space of m:
Arbitrary linear combinations of the null space of m give zero:
m is a 3×4 matrix of random zeros and ones:
The MatrixRank equals the column dimension of m minus the dimension of the null space:
New in 1 | Last modified in 3
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team