- nullspace
null-space
1> _мат. нуль-пространство
Новый большой англо-русский словарь. 2001.
nullspace
Смотреть что такое "nullspace" в других словарях:
Block Lanczos algorithm for nullspace of a matrix over a finite field — The Block Lanczos algorithm for nullspace of a matrix over a finite field is a procedure for finding the nullspace of a matrix using only multiplication of the matrix by long, thin matrices. These long, thin matrices are considered as vectors of… … Wikipedia
Witt's theorem — or the Witt theorem may also refer to the Bourbaki–Witt fixed point theorem of order theory. Witt s theorem, named after Ernst Witt, concerns symmetric bilinear forms on finite dimensional vector spaces. It tells us when we can extend an isometry … Wikipedia
Fundamental theorem of linear algebra — In mathematics, the fundamental theorem of linear algebra makes several statements regarding vector spaces. These may be stated concretely in terms of the rank r of an m times; n matrix A and its LDU factorization::PA=LDUwherein P is a… … Wikipedia
Kernel (matrix) — In linear algebra, the kernel or null space (also nullspace) of a matrix A is the set of all vectors x for which Ax = 0. The kernel of a matrix with n columns is a linear subspace of n dimensional Euclidean space.[1] The dimension… … Wikipedia
Lanczos algorithm — The Lanczos algorithm is an iterative algorithm invented by Cornelius Lanczos that is an adaptation of power methods to find eigenvalues and eigenvectors of a square matrix or the singular value decomposition of a rectangular matrix. It is… … Wikipedia
Centering matrix — In mathematics and multivariate statistics, the centering matrix [John I. Marden, Analyzing and Modeling Rank Data , Chapman Hall, 1995, ISBN 0412995212, page 59.] is a symmetric and idempotent matrix, which when multiplied with a vector has the… … Wikipedia
Eigendecomposition of a matrix — In the mathematical discipline of linear algebra, eigendecomposition or sometimes spectral decomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and… … Wikipedia
Vector space — This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… … Wikipedia
Kernel (mathematics) — In mathematics, the word kernel has several meanings. Kernel may mean a subset associated with a mapping:* The kernel of a mapping is the set of elements that map to the zero element (such as zero or zero vector), as in kernel of a linear… … Wikipedia
Row and column spaces — The row space of an m by n matrix with real entries is the subspace of R n generated by the row vectors of the matrix. Its dimension is equal to the rank of the matrix and is at most min( m , n ).The column space of an m by n matrix with real… … Wikipedia
Goddard–Thorn theorem — In mathematics, and in particular, in the mathematical background of string theory, the Goddard–Thorn theorem (also called the no ghost theorem) is a theorem about certain vector spaces. It is named after Peter Goddard and Charles Thorn. Contents … Wikipedia
