Search Results for ""

Gram-Schmidt orthogonalization, also called the Gram-Schmidt process, is a procedure which takes a nonorthogonal set of linearly independent functions and constructs an ...

A 2-variable oriented knot polynomial P_L(a,z) motivated by the Jones polynomial (Freyd et al. 1985). Its name is an acronym for the last names of its co-discoverers: Hoste, ...

One of the most useful tools in nonstandard analysis is the concept of a hyperfinite set. To understand a hyperfinite set, begin with an arbitrary infinite set X whose ...

An idoneal number, also called a suitable number or convenient number, is a positive integer D for which the fact that a number is a monomorph (i.e., is expressible in only ...

Let |A| denote the cardinal number of set A, then it follows immediately that |A union B|=|A|+|B|-|A intersection B|, (1) where union denotes union, and intersection denotes ...

The inverse cosine is the multivalued function cos^(-1)z (Zwillinger 1995, p. 465), also denoted arccosz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. 307; ...

Jacobi's imaginary transformations relate elliptic functions to other elliptic functions of the same type but having different arguments. In the case of the Jacobi elliptic ...

In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...

A lattice reduction algorithm, named after discoverers Lenstra, Lenstra, and Lovasz (1982), that produces a lattice basis of "short" vectors. It was noticed by Lenstra et al. ...

The intersection of two lines L_1 and L_2 in two dimensions with, L_1 containing the points (x_1,y_1) and (x_2,y_2), and L_2 containing the points (x_3,y_3) and (x_4,y_4), is ...