TOPICS
Search

Search Results for ""


201 - 210 of 1392 for linear programmingSearch Results
A generalized eigenvector for an n×n matrix A is a vector v for which (A-lambdaI)^kv=0 for some positive integer k in Z^+. Here, I denotes the n×n identity matrix. The ...
There are at least two distinct (though related) notions of the term Hilbert algebra in functional analysis. In some literature, a linear manifold A of a (not necessarily ...
The commutator series of a Lie algebra g, sometimes called the derived series, is the sequence of subalgebras recursively defined by g^(k+1)=[g^k,g^k], (1) with g^0=g. The ...
The lower central series of a Lie algebra g is the sequence of subalgebras recursively defined by g_(k+1)=[g,g_k], (1) with g_0=g. The sequence of subspaces is always ...
The symmetric successive overrelaxation (SSOR) method combines two successive overrelaxation method (SOR) sweeps together in such a way that the resulting iteration matrix is ...
The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...
Stationary iterative methods are methods for solving a linear system of equations Ax=b, where A is a given matrix and b is a given vector. Stationary iterative methods can be ...
Two square matrices A and B that are related by B=X^(-1)AX, (1) where X is a square nonsingular matrix are said to be similar. A transformation of the form X^(-1)AX is called ...
There are at least two distinct notions known as the Whitehead group. Given an associative ring A with unit, the Whitehead group associated to A is the commutative quotient ...
Eigenvectors are a special set of vectors associated with a linear system of equations (i.e., a matrix equation) that are sometimes also known as characteristic vectors, ...
1 ... 18|19|20|21|22|23|24 ... 140 Previous Next

...