null space


Also found in: Dictionary, Thesaurus, Acronyms, Wikipedia.

null space

[′nəl ′spās]
(mathematics)
For a linear transformation, the vector subspace of all vectors which the transformation sends to the zero vector. Also known as kernel.
References in periodicals archive ?
4) that the accuracy of computing the null space is controlled by the error parameter [delta], which in turn scales proportionally to the norm of the right-hand side b.
When the dimension of the null space is unknown, the algorithm above can also be used as a rank-revealing scheme; see also [23].
As the null space of P is fixed, the operator H is unique.
17), of dimension n' = 2, for the null space of N is given by
Numerical experiments suggest that when n is even the minimal degree is m' = n/2 if and only if the dimension of the null space of N is n' = 2.
One approach for computing a null space basis Z is the following.
A basis Z of this form is called a variable elimination basis or a fundamental null space basis [21].
We start with a definition of a cycle null space basis of a graph.
The following lemma introduces a graph which will be used for enumeration of the cycle null space basis vectors in our application.
In Section 3, the null space algorithm and its algebraic properties are presented.
The final computational algorithm, which is solved by the null space strategy, is formulated by introducing the vector h = -[L.
3) When Dirichlet boundary conditions are imposed, the dimension of the discrete null space is smaller and is related to the number of node groups (where a group consists of nodes that are connected together via Dirichlet edges).