Search Results for ""

The 20 Cayley lines generated by a hexagon inscribed in a conic section pass four at a time though 15 points known as Salmon points (Wells 1991). There is a dual relationship ...

Let A be a relational system, and let L be a language which is appropriate for A. Let phi be a well-formed formula of L, and let s be a valuation in A. Then A|=_sphi is ...

The scalar curvature, also called the "curvature scalar" (e.g., Weinberg 1972, p. 135; Misner et al. 1973, p. 222) or "Ricci scalar," is given by R=g^(mukappa)R_(mukappa), ...

The Schröder-Bernstein theorem for numbers states that if n<=m<=n, then m=n. For sets, the theorem states that if there are injections of the set A into the set B and of B ...

Two families of equations used to find roots of nonlinear functions of a single variable. The "B" family is more robust and can be used in the neighborhood of degenerate ...

The Schur decomposition of a complex square matrix A is a matrix decomposition of the form Q^(H)AQ=T=D+N, (1) where Q is a unitary matrix, Q^(H) is its conjugate transpose, ...

A polyhedron constructed by ruling 2n equally spaced vertical lines along the surface of a cylinder together with 2n^3 circles around the cylinder at equally spaced heights. ...

The score function u(theta) is the partial derivativeof the log-likelihood function F(theta)=lnL(theta), where L(theta) is the standard likelihood function. Defining the ...

Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.

A root-finding algorithm which assumes a function to be approximately linear in the region of interest. Each improvement is taken as the point where the approximating line ...