Search Results for ""

There are a number of tilings of various shapes by all the 12 order n=6 polyiamonds, summarized in the following table. Several of these (starred in the table below) are also ...

The computation of points or values between ones that are known or tabulated using the surrounding points or values. In particular, given a univariate function f=f(x), ...

A theorem giving a criterion for an origami construction to be flat. Kawasaki's theorem states that a given crease pattern can be folded to a flat origami iff all the ...

A goodness-of-fit test for any statistical distribution. The test relies on the fact that the value of the sample cumulative density function is asymptotically normally ...

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...

Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...

The paradox of a man who states "I am lying." If he is lying, then he is telling the truth, and vice versa. Another version of this paradox is the Epimenides paradox. Such ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

A function I_n(x) which is one of the solutions to the modified Bessel differential equation and is closely related to the Bessel function of the first kind J_n(x). The above ...

A direct search method of optimization that works moderately well for stochastic problems. It is based on evaluating a function at the vertices of a simplex, then iteratively ...