Search Results for ""

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

A usually simple algorithm or identity. The term is frequently applied to specific orders of Newton-Cotes formulas. The designation "rule n" is also given to the nth ...

A stochastic approximation method that functions by placing conditions on iterative step sizes and whose convergence is guaranteed under mild conditions. However, the method ...

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.

The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...

Differential evolution is a stochastic parallel direct search evolution strategy optimization method that is fairly fast and reasonably robust. Differential evolution is ...

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Rosenbrock methods.

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Kaps-Rentrop methods.

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