Search Results for ""

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

A method of stochastic optimization including techniques such as gradient search or Robbins-Monro stochastic approximation.

For discrete problems in which no efficient solution method is known, it might be necessary to test each possibility sequentially in order to determine if it is the solution. ...

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...

A method of displaying simple statistical parameters including hinges, the statistical median, and upper and lower values.

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.

A generalization of spun knots due to Zeeman. This method produces four-dimensional knot types that cannot be produced by ordinary spinning.

A magic square is a square array of numbers consisting of the distinct positive integers 1, 2, ..., n^2 arranged such that the sum of the n numbers in any horizontal, ...

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 ...