TOPICS
Search

Search Results for ""


731 - 740 of 1443 for Decomposition GroupSearch Results
In the Minkowski space of special relativity, a four-vector is a four-element vector x^mu=(x^0,x^1,x^2,x^3) that transforms under a Lorentz transformation like the position ...
Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...
The inverse of a square matrix A, sometimes called a reciprocal matrix, is a matrix A^(-1) such that AA^(-1)=I, (1) where I is the identity matrix. Courant and Hilbert (1989, ...
The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...
A Lorentz transformation is a four-dimensional transformation x^('mu)=Lambda^mu_nux^nu, (1) satisfied by all four-vectors x^nu, where Lambda^mu_nu is a so-called Lorentz ...
An Abelian semigroup is a set whose elements are related by a binary operation (such as addition, rotation, etc.) that is closed, associative, and commutative. A mathematical ...
A fractional ideal is a generalization of an ideal in a ring R. Instead, a fractional ideal is contained in the number field F, but has the property that there is an element ...
A semigroup S is said to be an inverse semigroup if, for every a in S, there is a unique b (called the inverse of a) such that a=aba and b=bab. This is equivalent to the ...
A square matrix A is a special orthogonal matrix if AA^(T)=I, (1) where I is the identity matrix, and the determinant satisfies detA=1. (2) The first condition means that A ...
A square matrix U is a special unitary matrix if UU^*=I, (1) where I is the identity matrix and U^* is the conjugate transpose matrix, and the determinant is detU=1. (2) The ...
1 ... 71|72|73|74|75|76|77 ... 145 Previous Next

...