FACTOID # 55: NationMaster.com is now 40 times the size of the CIA World Factbook!
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RELATED ARTICLES
People who viewed "Nullspace" also viewed:
RECENT ARTICLES
More Recent Articles »
 

FACTS & STATISTICS    Simple view

  1. Select countries to view: (hold down Control key and click to select several)

     

     

    Compare:

     

     

  1. Select fact or statistic: (* = graphable)

     

     

     

  2. (OPTIONAL) Compare to statistic: (both need to be graphable)

     

     

     

  3. View result as:

     

       
(OR) SEARCH ALL encyclopedia, stats & forums:   

Encyclopedia > Nullspace

The null space (also nullspace) of a matrix A is the set of all vectors v which solve the equation Av = 0, a linear subspace of the space of all vectors. It is also called the kernel of A if A is interpreted as a linear map (see kernel). In set notation,


Null A = {v: vRn and Av = 0 }.


The dimension of this linear subspace is called the nullity of A. This can be calculated as the number of columns that don't contain pivots in the row echelon form of the matrix A. The Rank-Nullity Theorem states that the rank of any matrix plus its nullity equals the number of columns of that matrix.


The right singular vectors of A corresponding to zero singular values form an orthonormal basis for the null space of A.


The null space of A can be used to find and express all solutions (the complete solution) of the equation Av = b. If the free variables of v are set to zero, a solution to this reduced equation is called a particular solution. The complete solution of the equation is equal to the particular solution added to any linear combination of vectors from the null space. The particular solutions vary according to b, while the null space vectors do not.


To show this works we consider each direction. In one direction, if Av=b, and Au=0, as is the case for any linear combination u of vectors from the null space, then it's clear that A(v+u) = b. In the other direction, if we have a solution x to Ax=b, then we can find a vector in the null space with the same values for the free variables in x, and subtract it to find the corresponding particular solution. Such a vector must exist, since Au=0 has a solution for any fixed value of the free variables.


Here is a concrete example. Suppose x+y = 7. You can arbitrarily pick x as your pivot (particular) variable, leaving y as the free variable. To find the particular solution, we set all free variables (y) to zero, and solve to find that x = 7. To compute the nullspace, we set the free variable y to 1, change the constant to zero, and solve. This produces the equation x + 1 = 0, or x = -1. That means that the null space basis vector is [-1 1]. We conclude that the complete solution to x + y = 7 is [7 0] + c[-1 1], where c is an arbitrary real constant.

Topics in mathematics related to linear algebra

Edit (http://en.wikipedia.org/w/wiki.phtml?title=MediaWiki:Space&action=edit)

Vectors | Vector spaces | Linear span | Linear transformation | Linear independence | Linear combination | Basis | Column space | Row space | Dual space | Orthogonality | Eigenvector | Eigenvalue | Least squares regressions | Outer product | Cross product | Dot product | Transpose | Matrix decomposition


  Results from FactBites:
 
Null space (82 words)
The null space (also spelt nullspace) of a m by n matrix A is the set of all vectors v which are solutions to the equation:
This is the same as the kernel of A if it is interpreted as a linear map.
The rank of any matrix plus its nullity equals the number of columns of that matrix.
Matrix Invariants (435 words)
Given an m x n sparse matrix A over a ring R, return the nullspace of A (or the kernel of A, considered as a linear transformation or map), which is the R-space consisting of all vectors v of length m such that v.A = 0.
Given an m x n sparse matrix A over a ring R, return a (dense-representation) basis matrix of the nullspace of A. This is a matrix N having m columns and the maximal number of independent rows subject to the condition that N.A = 0.
This function has the advantage that the nullspace is not returned as a R-space, so echelonization of the resulting nullspace may be avoided.
  More results at FactBites »


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.