Search Results for ""

A method for constructing magic squares of odd order, also called de la Loubere's method.

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

A map which uses a set of rules to transform elements of a sequence into a new sequence using a set of rules which "translate" from the original sequence to its ...

The substitution of x=w-p/(3w) (1) into the standard form cubic equation x^3+px=q. (2) The result reduces the cubic to the equation w^3-(p^3)/(27w^3)-q=0, (3) which is easily ...

A variation of the method of false position for finding roots which fits the function in question with an exponential.

A method for constructing magic squares of odd order, also called the Siamese method.

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...

The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...

The method for solving the Goursat problem and Cauchy problem for linear hyperbolic partial differential equations using a Riemann function.