Search Results for ""

Let M^n be a compact n-dimensional oriented Riemannian manifold without boundary, let O be a group representation of pi_1(M) by orthogonal matrices, and let E(O) be the ...

A dyadic, also known as a vector direct product, is a linear polynomial of dyads AB+CD+... consisting of nine components A_(ij) which transform as (A_(ij))^' = ...

The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...

The complex structure of a point x=x_1,x_2 in the plane is defined by the linear map J:R^2->R^2 J(x_1,x_2)=(-x_2,x_1), (1) and corresponds to a counterclockwise rotation by ...

Consider a collection of diagonal matrices H_1,...,H_k, which span a subspace h. Then the ith eigenvalue, i.e., the ith entry along the diagonal, is a linear functional on h, ...

The extension field K of a field F is called a splitting field for the polynomial f(x) in F[x] if f(x) factors completely into linear factors in K[x] and f(x) does not factor ...

The vector space generated by the rows of a matrix viewed as vectors. The row space of a n×m matrix A with real entries is a subspace generated by n elements of R^m, hence ...