Search Results for ""

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

The analytic summation of a hypergeometric series. Powerful general techniques of hypergeometric summation include Gosper's algorithm, Sister Celine's method, Wilf-Zeilberger ...

A lozenge (or rhombus) algorithm is a class of transformation that can be used to attempt to produce series convergence improvement (Hamming 1986, p. 207). The best-known ...

If replacing each number by its square or cube in a magic square produces another magic square, the square is said to be a trimagic square. Trimagic squares are also called ...

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 bootstrap method is a computer-based method for assigning measures of accuracy to sample estimates (Efron and Tibshirani 1994). This technique allows estimation of the ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...

In abstract topology, a machine is method for producing infinite loop spaces and spectra. In automata theory, an abstract machine that is implemented in hardware is simply ...

A popular acronym for "principal ideal domain." In engineering circles, the acronym PID refers to the "proportional-integral-derivative method" algorithm for controlling ...